proposition: Lemma between_ltNonnegativeRationals : ∏ x y : NonnegativeRationals, x < y -> ∑ t : NonnegativeRationals, x < t × t < y.
proof: Proof. intros x y H. set (z := hqlth_between (pr1 x) (pr1 y) H). assert (Hz : hqleh 0%hq (pr1 z)). { apply istranshqleh with (pr1 x). { now apply (pr2 x). } apply (hqlthtoleh (pr1 x) (pr1 z)), (pr1 (pr2 z)). } exists (hq_to_hnnq_set _ Hz). exact (pr2 z). Qed.
imports: UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.PartA UniMath.MoreFoundations.Sets UniMath.MoreFoundations.Orders UniMath.RealNumbers.Sets UniMath.RealNumbers.Fields UniMath.Algebra.DivisionRig UniMath.OrderTheory.Lattice.Lattice UniMath.RealNumbers.Prelim