proposition: Lemma perm_of_setpartE P : partition P [set: T] -> cycle_type (perm_of_setpart P) = setpart_shape P :> seq nat.
proof: Proof. Proof using. by move=> /porbits_perm_of_setpart pcy; rewrite /= pcy. 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