proposition: Lemma sympolyf_evalK q : sympolyf (sympolyf_eval q) = q.
proof: Proof. rewrite /sympolyf; case: (SF _) => [x [xeq _]]. move: xeq; rewrite -sympolyf_evalE. exact: msym_fundamental_un. 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