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