fact: Definition ZornsLemma {A} (R: relation A) {preR: PreOrder R} (chains_have_upper_bounds: ∀ (C: A → Prop), (∀ x y, C x → C y → R x y ∨ R y x) → ∃ m, ∀ x, C x → R x m) := ∃ m, ∀ x, R m x → R x m.
imports: Coq(Relations Equivalence Morphisms Utf8) Coq(ChoiceFacts ClassicalFacts) Coq.Program(Basics) Coq.Logic(SetoidChoice)