proposition: Lemma abelian_sol G : abelian G -> solvable G.
proof: Proof. by move/abelian_nil/nilpotent_sol. Qed.
imports: mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq path) mathcomp(fintype div bigop prime finset fingroup morphism) mathcomp(automorphism quotient commutator gproduct) mathcomp(gfunctor center gseries cyclic)