proposition: Lemma msupp_map_mpoly p : injective f -> perm_eq (msupp (map_mpoly f p)) (msupp p).
proof: Proof. move=> inj_f; apply/uniq_perm; rewrite ?msupp_uniq //=. by move=> m; rewrite !mcoeff_msupp mcoeff_map_mpoly raddf_eq0. 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