proposition: Lemma Dcuts_lt_le_rel : ∏ x y : Dcuts_set, Dcuts_lt_rel x y -> Dcuts_le_rel x y.
proof: Proof. intros x y ; apply hinhuniv ; intros r. intros n Xn. apply is_Dcuts_bot with (pr1 r). - exact (pr2 (pr2 r)). - apply lt_leNonnegativeRationals. apply Dcuts_finite with x. + exact (pr1 (pr2 r)). + exact Xn. 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