proposition: Lemma nat_list_succ n (q:= (list_of_num (bin_of_nat n.+1))): rev q = true :: behead (rev q).
proof: Proof. by rewrite /q (eqP (nat_list_succ' n)) rev_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)