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