fact: Definition least_upper_bound_is_upper_bound {I} {p : I -> P} (x : least_upper_bound p) : isupperbound p x := least_suchthat_satisfies x.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo