Theorems · Theorem · order theory
CountableInfClosed.isGLB_mem
∀ {α : Type u_2} [inst : LE α] {s : Set α},
CountableInfClosed s → ∀ t ⊆ s, t.Nonempty → t.Countable → ∀ (x : α), IsGLB t x → x ∈ s- Defined in
- Mathlib.Order.CountableSupClosed
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Nonemptystatement · cited by 2,627
- Set.Countablestatement · cited by 545
- IsGLBstatement · cited by 213
- CountableInfClosedstatement and proof · cited by 27
Cited by10
Results whose statement or proof uses this declaration.
- CountableInfClosed.iInf_memproof · cited by 3
- CountableInfClosed.infClosedproof · cited by 3
- countableInfClosed_preimage_ofDualproof · cited by 1
- CountableInfClosed.prodproof · cited by 1
- countableSupClosed_preimage_ofDualproof · cited by 1
- CountableInfClosed.sInterproof · cited by 1
- countableInfClosed_preimage_toDualproof · cited by 0
- countableInfClosure_eq_sInterproof · cited by 0
- CountableInfClosed.interproof · cited by 0
- countableSupClosed_preimage_toDualproof · cited by 0