proposition: Fact conjg_porbits_stab : [set fbbij (slporbits t) x | x in (slporbits s)] \subset slporbits t.
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