proposition: Lemma mulrn_wge0 x n : 0 <= x -> 0 <= x *+ n.
proof: Proof. by move=> /(ler_wMn2r n); rewrite mul0rn. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)