proposition: Lemma lern1 n : n%:R <= 1 :> R = (n <= 1)%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)