proposition: Lemma FR_0: FR 0 = 1.
proof: Proof. by rewrite /FR Zeckp_0 FA_00. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)