proposition: Lemma boolRP (R : ringType) (b : bool) : reflect (b%:R = 0 :> R) (~~b).
proof: Proof. Proof using. apply (iffP idP) => [/negbTE -> // | H]. apply/negP => Hb; move: H; rewrite Hb /= => /eqP. by rewrite oner_eq0. 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