proposition: Lemma intr_N (t: int): (-t)%:Q = -(t%:Q).
proof: Proof. by rewrite - (mulrN1 t%:~R) -(mulrN1 t) intrM //. 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)