proposition: Lemma eqr_nat m n : (m%:R == n%:R :> R) = (m == n)%N.
proof: Proof. by rewrite (inj_eq (mulrIn _)) ?oner_eq0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)