proposition: Lemma mFT_cent1_proper x : x != 1 -> 'C[x] \proper G.
proof: Proof. by rewrite -cycle_eq1 -cent_cycle; apply: mFT_cent_proper. 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)