proposition: Lemma separable_poly_neq0 p : separable p -> p != 0.
proof: Proof. by apply: contraTneq => ->; rewrite unlock deriv0 coprime0p eqp01. 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)