proposition: Lemma classXI p1 p2 q1 q2 : (p2, q2) != (p1, q1) -> (classX p1 q1) :&: (classX p2 q2) = set0.
proof: Proof. Proof using. move=> /eqP qp; apply class_disj. apply/imsetP => []/= [x _]. rewrite prod_conjg /= => [] [] qp1 qp2. by apply qp; congr (_, _); rewrite -[LHS]CTpartnK -[RHS]CTpartnK; congr partnCT; rewrite -[LHS]permCTP -[RHS]permCTP ?qp1 ?qp2 cycle_type_conjg. Qed.
imports: HB(structures) mathcomp(all_ssreflect) mathcomp(ssralg fingroup morphism perm gproduct) mathcomp(ssrnum matrix vector mxalgebra algC) mathcomp(classfun character mxrepresentation) tools ordcast partition sorted permcomp cycles cycletype permcent