proposition: Lemma like_fib_shift F m: like_fib F -> like_fib(fun n => F (n + m)).
proof: Proof. by move => h n; rewrite !addSn h. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq path fintype div bigop binomial) mathcomp(prime finset ssralg ssrnum ssrint)