proposition: Lemma isperm_of_porbit C : #|C| > 1 -> perm_of_porbit C \is cyclic.
proof: Proof. Proof using. move=> Hsize; apply /cards1P; exists C. exact: porbit_set_of_set. 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