proposition: Lemma rat_in_N_nat (x: nat) : rat_in_N (x%:Z%:Q).
proof: Proof. by rewrite /rat_in_N rat_in_Z_int /= /int_in_N /floorq numq_int denq_int divn1. 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)