proposition: Lemma symh_pol_any b d : d < b -> symh_pol d = symh_pol_bound b d.
proof: Proof. move=> H; apply/mpolyP => m. by rewrite mcoeff_symh_pol mcoeff_symh_pol_bound. 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