proposition: Lemma riemannR_gt0 a i : 0 <= a -> 0 < riemannR a i.
proof: Proof. by move=> ?; rewrite /riemannR invr_gt0 powR_gt0. Qed.
imports: mathcomp(all_ssreflect ssralg ssrint ssrnum matrix) mathcomp(interval rat) mathcomp(boolp classical_sets functions) mathcomp(mathcomp_extra) reals ereal signed topology normedtype landau sequences derive realfun itv convex