proposition: Lemma int_in_N_nat (x: nat): int_in_N (x%:Z).
proof: Proof. by rewrite /int_in_N. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)