proposition: Lemma rpredZ_Cint (S : zmodClosed V) : {in Cint & S, forall z u, z *: u \in S}.
proof: Proof. by move=> _ u /CintP[m ->]; apply: rpredZint. 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)