proposition: Lemma finField_is_abelem : is_abelem [set: F].
proof: Proof. have [p pr_p charFp] := finCharP. by apply/is_abelemP; exists p; last apply: fin_ring_char_abelem. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype div tuple bigop prime finset fingroup) mathcomp(ssralg poly polydiv morphism action countalg) mathcomp(finalg zmodp cyclic center pgroup abelian matrix) mathcomp(mxpoly vector falgebra fieldext separable galois)