proposition: Lemma card_min_repn0 n: card_min_rep n 0 = (n==0).
proof: Proof. case nz: (n==0); first by rewrite (eqP nz) card_min_rep0m. rewrite card_min_repE big_hasC => //; apply /hasPn => i. rewrite mem_index_iota=> /andP[ha _]; rewrite size_eq0; move:(Zeck_zeck_val i). move: ha; case:i; first by rewrite leqn0 fib_eq0 nz. by move=> i; case: (Zeck i.+1) => //; rewrite Zeckv_nil. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)