proposition: Lemma FM_codd n: odd (FMc (n.+1)).
proof: Proof. by rewrite FM_recE1 oddD FM_dodd /=; case: odd. 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)