proposition: Lemma mem_cycle x i : x ^+ i \in <[x]>.
proof: Proof. by rewrite groupX // cycle_id. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)