proposition: Lemma lerq0 x : (ratr F x <= 0) = (x <= 0).
proof: Proof. by rewrite (_ : 0 = ratr F 0) ?ler_rat ?rmorph0. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(fintype bigop order ssralg countalg div ssrnum) mathcomp(ssrint prime archimedean)