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