proposition: Lemma NonnegativeReals_dense : ∏ x y : NonnegativeReals, x < y -> ∃ r : NonnegativeRationals, x < NonnegativeRationals_to_NonnegativeReals r × NonnegativeRationals_to_NonnegativeReals r < y.
proof: Proof. intros x y. apply hinhuniv ; intros q. generalize (is_Dcuts_open y (pr1 q) (pr2 (pr2 q))). apply hinhfun ; intros r. exists (pr1 r) ; split ; apply hinhpr. - exists (pr1 q) ; split. + exact (pr1 (pr2 q)). + exact (pr2 (pr2 r)). - exists (pr1 r) ; split. + exact (isirrefl_ltNonnegativeRationals _). + exact (pr1 (pr2 r)). Qed.
imports: UniMath.MoreFoundations.Orders UniMath.MoreFoundations.Tactics UniMath.MoreFoundations.Notations UniMath.RealNumbers.Sets UniMath.Algebra.ConstructiveStructures UniMath.OrderTheory.Lattice.Lattice UniMath.RealNumbers.Prelim UniMath.RealNumbers.NonnegativeRationals