proposition: Lemma charf0_separable K : [char L] =i pred0 -> forall x, separable_element K x.
proof: Proof. move=> charL0 x; have [n /andP[charLn]] := separable_exponent K x. by rewrite (pnat_1 charLn (sub_in_pnat _ charLn)) // => p _; rewrite charL0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun eqtype ssrnat seq div) mathcomp(choice fintype tuple finfun bigop finset prime) mathcomp(binomial ssralg poly polydiv fingroup perm) mathcomp(morphism quotient gproduct finalg zmodp cyclic) mathcomp(matrix mxalgebra mxpoly polyXY vector falgebra) mathcomp(fieldext)