proposition: Lemma mleadM_le p q : (mlead (p * q) <= (mlead p + mlead q)%MM)%O.
proof: Proof. have [->|] := eqVneq (p * q) 0; first by rewrite mlead0 le0x. move/mlead_supp/msuppM_le/allpairsP => [[m1 m2] /=] [m1_in_p m2_in_q ->]. by apply/lem_add; apply/msupp_le_mlead. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq path) mathcomp(choice fintype tuple finfun bigop finset binomial) mathcomp(order fingroup perm ssralg zmodp poly ssrint) mathcomp(matrix vector) mathcomp(bigenough) ssrcomplements freeg