proposition: Lemma ler_niMr x y : y <= 0 -> x <= 1 -> y <= y * x.
proof: Proof. by move=> hx hy; rewrite -{1}[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)