proposition: Lemma msuppZ c p : c != 0 -> perm_eq (msupp (c *: p)) (msupp p).
proof: Proof. move=> nz_c; apply/uniq_perm=> // m. by rewrite !mcoeff_msupp mcoeffZ mulf_eq0 (negbTE nz_c). 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