proposition: Lemma minSimpleOdd_prime gT (G : {group gT}) : odd #|G| -> simple G -> prime #|G|.
proof: Proof. by move/minSimpleOdd_ind; apply: simple_sol_prime. Qed.
imports: HB(structures) mathcomp.ssreflect.ssreflect mathcomp(ssrbool ssrfun eqtype ssrnat seq div choice fintype bigop) mathcomp(finset prime fingroup morphism automorphism action quotient) mathcomp(gfunctor cyclic pgroup center commutator gseries nilpotent) mathcomp(sylow abelian maximal hall) odd_order(BGsection1 BGsection6)