proposition: Lemma FA_mm m: FA m.+1 m.+1 = FA 0 m.
proof: Proof. by move:(FA_gen m 0); rewrite addn0 FA_0S => ->. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)