proposition: Lemma cyclic_abelian A : cyclic A -> abelian A.
proof: Proof. by case/cyclicP=> a ->; apply: cycle_abelian. 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)