proposition: Lemma abelianJ A x : abelian (A :^ x) = abelian A.
proof: Proof. by rewrite /abelian centJ conjSg. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq choice) mathcomp(fintype div path tuple bigop prime finset)