proposition: Lemma posJ x : le 0 x -> conj x = x.
proof: Proof. by case/posP=> {x}u ->; rewrite rmorphM /= conjK mulrC. 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)