proposition: Lemma fib_gt0 m: 0 < m -> 0 < fib m.
proof: Proof. by elim: m=> [|[|m] IH _] //; rewrite fibSS addn_gt0 IH. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)