proposition: Lemma eqCmodMl0 e : {in Num.int, forall x, x * e == 0 %[mod e]}%C.
proof: Proof. by move=> x Zx; rewrite -(mulr0 x) eqCmodMl. 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)