proposition: Lemma minCpolyP x : {p : {poly rat} | minCpoly x = pQtoC p /\ p \is monic & forall q, root (pQtoC q) x = (p %| q)%R}.
proof: Proof. by rewrite /minCpoly; case: (minCpoly_subproof x) => p; exists p. 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)