fact: Definition make_dcpo_is_least_upperbound {X : dcpo} (D : directed_set X) (x : X) (H₁ : ∏ (i : D), D i ⊑ x) (H₂ : ∏ (x' : X), (∏ (i : D), D i ⊑ x') → x ⊑ x') : is_least_upperbound X D x.
imports: UniMath.MoreFoundations.All UniMath.OrderTheory.Posets.Basics UniMath.OrderTheory.Posets.MonotoneFunctions UniMath.OrderTheory.Posets.PointedPosets UniMath.OrderTheory.DCPOs.Core.DirectedSets