proposition: Lemma bin_invert_alt_compat n: bin_invert n = nat_of_bin (num_of_list (bin_invert_alt (list_of_num (bin_of_nat n)))).
proof: Proof. rewrite /bin_invert /bin_invert_alt. case: (bin_invert_aux _) => // a l. by rewrite lastI; case: (last a l) => //; rewrite num_of_list_false. 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)