proposition: Lemma eqr_int m n : (m%:~R == n%:~R :> R) = (m == n).
proof: Proof. by rewrite (inj_eq (mulrIz _)) ?oner_eq0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat choice seq) mathcomp(fintype finfun bigop order ssralg countalg ssrnum) mathcomp(poly)