proposition: Lemma sympolyf_evalE (q : {mpoly R[m]}) : q \mPo [tuple sympol 'e_i.+1 | i < m] = sympolyf_eval q.
proof: Proof. rewrite /sympolyf_eval /mmap /mmap1 comp_mpolyE. rewrite raddf_sum /=; apply eq_bigr => mon _. rewrite mulr_algl; congr (_ *: _). rewrite rmorph_prod /=; apply eq_bigr => i _. by rewrite tnth_mktuple rmorphXn /=. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(ssralg ssrint fingroup perm) mathcomp(ssrcomplements freeg mpoly) sorted tools ordtype permuted partition skewpart composition Yamanouchi std tableau stdtab skewtab permcent antisym Schur_mpoly therule Schur_altdef unitriginv