proposition: Fact fib_cont_aux1 n: exists i, fib i.+2 <= n.+1.
proof: Proof. by exists 0. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)