fact: Definition make_least_upper_bound {I} {p : I -> P} (x:P) (x_lub : is_least_upper_bound p x) : least_upper_bound p := make_least_suchthat x x_lub.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo