proposition: Lemma mmeasure_poly_eq0 p : (mmeasure p == 0%N) = (p == 0).
proof: Proof. apply/idP/eqP=> [z_p|->]; last by rewrite mmeasure0. apply/mpoly_eqP; move: z_p; rewrite mmeasureE. rewrite {2}[p]freeg_mpoly; case: (msupp p). by rewrite !big_nil /= freegU0. by move=> m q; rewrite !big_cons -leqn0 geq_max. 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