proposition: Lemma minCpoly_monic x : minCpoly x \is monic.
proof: Proof. by have [p [-> mon_p] _] := minCpolyP x; rewrite map_monic. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrfun ssrnat eqtype seq choice) mathcomp(div fintype path bigop finset prime order ssralg) mathcomp(poly polydiv mxpoly generic_quotient countalg) mathcomp(ssrnum closed_field ssrint archimedean rat intdiv) mathcomp(algebraics_fundamentals)