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