proposition: Lemma Dcuts_min_gt : ∏ x y z : Dcuts, z < x → z < y → z < (Dcuts_min x y).
proof: Proof. intros x y z. apply hinhfun2. intros r q. generalize (isdecrel_ltNonnegativeRationals (pr1 r) (pr1 q)) ; apply sumofmaps ; intros H. - exists (pr1 r). repeat split. + exact (pr1 (pr2 r)). + exact (pr2 (pr2 r)). + apply is_Dcuts_bot with (1 := pr2 (pr2 q)), lt_leNonnegativeRationals, H. - exists (pr1 q). repeat split. + exact (pr1 (pr2 q)). + apply is_Dcuts_bot with (1 := pr2 (pr2 r)), notlt_geNonnegativeRationals, H. + exact (pr2 (pr2 q)). 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