proposition: Lemma Zeckp_eq0 n: (Zeckp n == 0) = (n == 0).
proof: Proof. case:n; first by rewrite Zeckp_0. by move => n; rewrite /Zeckp Zeck_S' /Zeck_valp big_cons addn_eq0 fib_eq0 //. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)