proposition: Lemma FM_recc2 n: FMc (n.+1) = (FMc n - (odd n)).*2.+1.
proof: Proof. by rewrite (FM_recE1 n) addnK FM_cE. 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)