proposition: Lemma cycle_generator a x : generator <[a]> x -> x \in <[a]>.
proof: Proof. by move/(<[a]> =P _)->; apply: cycle_id. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice div) mathcomp(fintype bigop prime finset fingroup morphism) mathcomp(perm automorphism quotient gproduct ssralg) mathcomp(finalg zmodp poly)