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