proposition: Theorem FTtype5_exclusion M : M \in 'M -> FTtype M != 5.
proof: Proof. move=> maxM; apply: wlog_neg; rewrite negbK => Mtype5. have notMtype2: FTtype M != 2 by rewrite (eqP Mtype5). have [U W W1 W2 defW [[MtypeP _] _]] := FTtypeP 5 maxM Mtype5. have [zeta [irr_zeta Szeta zeta1w1]] := FTtypeP_ref_irr maxM MtypeP. exact: (FTtype5_exclusion_main _ MtypeP _ irr_zeta). Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(ssrbool ssrfun eqtype ssrnat seq path div choice fintype) mathcomp(tuple finfun bigop order prime ssralg poly finset center) mathcomp(fingroup morphism perm automorphism quotient action finalg zmodp) mathcomp(gfunctor gproduct cyclic commutator gseries nilpotent pgroup) mathcomp(sylow hall abelian maximal frobenius) mathcomp(matrix mxalgebra mxrepresentation mxabelem vector) odd_order(BGsection1 BGsection3 BGsection7 BGsection15 BGsection16) mathcomp(ssrnum algC classfun character integral_char inertia vcharacter) odd_order(PFsection1 PFsection2 PFsection3 PFsection4) odd_order(PFsection5 PFsection6 PFsection7 PFsection8 PFsection9)