proposition: Lemma mmeasureD_le p q : mmeasure (p + q) <= maxn (mmeasure p) (mmeasure q).
proof: Proof. rewrite {1}mmeasureE big_tnth; apply/bigmax_leqP=> /= i _. set m := tnth _ _; have: m \in msupp (p + q) by apply/mem_tnth. move/msuppD_le; rewrite leq_max mem_cat. by case/orP=> /mmeasure_mnm_lt->; rewrite !simpm. 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