proposition: Lemma conjbijK (U V : finType) (s : {perm U}) (t : {perm V}) (eqct : cycle_type s = cycle_type t :> seq nat) : cancel (conjbij eqct) (conjbij (esym eqct)).
proof: Proof. Proof using. apply cymapK => C HC; rewrite /= fbbijK //; exact: 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