proposition: Lemma rat_in_Z_int (x: int): rat_in_Z (x%:Q).
proof: Proof. by rewrite /rat_in_Z /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)