proposition: Lemma bin_invert_altE l a s: bin_invert_aux l = rcons s a -> bin_invert_alt l = rcons s true.
proof: Proof. rewrite /bin_invert_alt => ->. by case:s => // b s; rewrite rcons_cons // belast_rcons. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)