proposition: Fact conjg_porbits_homog : {in porbits s, forall C, #|fbbij (U := slporbits s) (slporbits t) C| = #|C| }.
proof: Proof. Proof using eqct. by have := fbbijP cycle_type_eq => [] []. 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