proposition: Lemma cfuniCTE s : ('1_[s]) = (cycle_type s == ct)%:R.
proof: Proof. Proof using. rewrite /cfuniCT cfunElock genGid inE /=. congr ((nat_of_bool _) %:R); apply/idP/idP. - rewrite classCTP => /subsetP; apply. apply /imsetP; exists 1%g; first by rewrite inE. by rewrite conjg1. - move=> /eqP <-; apply/subsetP => t /imsetP[c _ ->{t}]. by rewrite -classCTP cycle_type_conjg. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(tuple finfun finset path bigop) mathcomp(fingroup perm action) mathcomp(ssralg matrix mxalgebra algC classfun) partition tools sorted permcomp fibered_set cycles