proposition: Lemma nat_list_succ' n: ends_with_a (list_of_num (bin_of_nat n.+1)) true.
proof: Proof. rewrite /ends_with_a /=; apply/eqP. by elim: (pos_of_nat n n) => // p /= {1} -> /=; case: p. 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)