fact: Definition least_upper_bound_subtype_is_upper_bound {A : hsubtype P} (x : least_upper_bound_subtype A) {y : P} (A_y : A y) : y ≤ x := least_upper_bound_is_upper_bound x (y,,A_y).
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.WellOrderedSets UniMath.OrderTheory.DCPOs.AlternativeDefinitions.Dcpo