proposition: Lemma Aut_cyclic_abelian : cyclic G -> abelian (Aut G).
proof: Proof. by case/cyclicP=> x ->; apply: Aut_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)