proposition: Lemma fib_eq0 n: (fib n == 0) = (n == 0).
proof: Proof. by case: n => [|n]=> //=; rewrite eqn0Ngt fib_gt0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)