proposition: Lemma ler_peMl x y : 0 <= y -> 1 <= x -> y <= x * y.
proof: Proof. by move=> hy hx; rewrite -{1}[y]mul1r ler_wpM2r. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)