fact: Definition bound_relation (W: { W | well_ordered W }) b := let S := proj1_sig W in (∀ x, x ∈ S → x ≼ b) ∧ ((∃ b', ∀ x, x ∈ S → x ≺ b') → ¬b ∈ S).
imports: Coq(Relations Equivalence Morphisms Utf8) Coq(ChoiceFacts ClassicalFacts) Coq.Program(Basics) Coq.Logic(SetoidChoice)