proposition: Lemma cycle_type_eq : forall i, #|fiber (slporbits s) i| = #|fiber (slporbits t) i|.
proof: Proof. Proof using eqct. by move=> i; rewrite !fiber_slporbitE eqct. 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