proposition: Lemma Dcuts_min_max : ∏ x y : Dcuts, Dcuts_min x (Dcuts_max x y) = x.
proof: Proof. intros x y. apply Dcuts_eq_is_eq ; intros r. split. - intros Hr. exact (pr1 Hr). - intros Xr. split. + exact Xr. + apply hinhpr. now left. 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