proposition: Lemma cyclicP A : reflect (exists x, A = <[x]>) (cyclic A).
proof: Proof. exact: exists_eqP. 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)