proposition: Lemma log2_eq0 n: (log2 n == 0) = (n == 0).
proof: Proof. by case: n => // n; rewrite /log2 (eqP (nat_list_succ' n)) size_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)