proposition: Lemma tperm_conj x1 y1 x2 y2 : x1 != y1 -> x2 != y2 -> exists t, tperm x2 y2 = ((tperm x1 y1) ^ t)%g.
proof: Proof. move=> /cycle_type_tperm H1 /cycle_type_tperm H2. by apply/conj_permP; rewrite H1 H2. 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