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