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