proposition: Lemma isassoc_Dcuts_min : ∏ x y z : Dcuts, Dcuts_min (Dcuts_min x y) z = Dcuts_min x (Dcuts_min y z).
proof: Proof. intros x y z. apply Dcuts_eq_is_eq ; intros r. split ; intros Hr ; repeat split. - apply (pr1 (pr1 Hr)). - apply (pr2 (pr1 Hr)). - apply (pr2 Hr). - apply (pr1 Hr). - apply (pr1 (pr2 Hr)). - apply (pr2 (pr2 Hr)). 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