proposition: Lemma minr_pMl x y z : 0 <= x -> min y z * x = min (y * x) (z * x).
proof: Proof. by move=> *; rewrite mulrC minr_pMr // ![_ * x]mulrC. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)