proposition: Lemma numq_le0 x : (numq x <= 0) = (x <= 0).
proof: Proof. by rewrite -oppr_ge0 -numqN numq_ge0 oppr_ge0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype bigop order ssralg countalg div ssrnum) mathcomp(ssrint prime archimedean)