proposition: Lemma conj_stdtabsh_bij sh : bijective (@conj_stdtabsh sh).
proof: Proof. by exists (stdtabshcast (conj_intpartK sh) \o conj_stdtabsh) => t; apply val_inj; rewrite /= val_stdtabshcast /= conj_tabK //; have:= stdtabshP t => /andP[]. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(perm fingroup) tools combclass partition Yamanouchi ordtype std tableau