proposition: Lemma FcharNvar (nvar0 nvar1 n : nat) (f : 'CF('SG_n)) : (n <= nvar0.+1)%N || (nvar1 < nvar0.+1)%N -> cnvarhomsym nvar1 (Fchar nvar0 f) = (Fchar nvar1 f).
proof: Proof. rewrite !FcharE => Hn; rewrite linear_sum /=; apply eq_bigr => la _. by rewrite linearZ /= cnvarhomsymp. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(fingroup perm morphism gproduct) mathcomp(rat ssralg ssrint ssrnum algC vector archimedean) mathcomp(mxrepresentation classfun character) mathcomp(mpoly) sorted ordtype tools partition antisym sympoly homogsym Cauchy Schur_altdef stdtab therule permcomp cycletype towerSn permcent reprSn unitriginv MurnaghanNakayama