proposition: Lemma pos_linear x y : le 0 x -> le 0 y -> le x y || le y x.
proof: Proof. move=> pos_x pos_y; rewrite leB -opprB orbC leB !posE normN -eqf_sqr. by rewrite normK rmorphB !posJ ?subrr. 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)