proposition: Fact cnvarhomsym_subproof (p : {homsym R[m, d]}) : (cnvarsym n0 p) \is d.-homsym.
proof: Proof. Proof using. case: p => [p] /=; rewrite unfold_in /= => Hp; rewrite unfold_in. rewrite /cnvarsym /=; apply/mwmwgt_homogP. have [f [Hf Hfhom]] := sym_fundamental_homog (sympolP p) Hp. rewrite /sympolyf; case: (sym_fundamental _) => [g []] /=. by rewrite -Hf => H _; rewrite (msym_fundamental_un H). Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(ssralg matrix vector ssrnum algC archimedean) mathcomp(fingroup perm) mathcomp(ssrcomplements freeg mpoly) tools sorted ordtype permuted partition permcent antisym Schur_mpoly Schur_altdef sympoly