proposition: Lemma minr_nMr x y z : x <= 0 -> x * min y z = max (x * y) (x * z).
proof: Proof. by move=> x_le0; apply: real_minr_nMr. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)