Theorems · Theorem · order theory
CountableSupClosed.of_iSup_mem
∀ {α : Type u_2} {s : Set α} [inst : CompleteLattice α],
(∀ (A : ℕ → α), (∀ (n : ℕ), A n ∈ s) → ⨆ n, A n ∈ s) → CountableSupClosed s- Defined in
- Mathlib.Order.CountableSupClosed
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
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.rangeproof · cited by 4,705
- Set.Nonemptyproof · cited by 2,627
- iSupstatement and proof · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- Set.Countableproof · cited by 545
- IsLUBproof · cited by 280
- CountableSupClosedstatement · cited by 27
- IsLUB.uniqueproof · cited by 21
- Set.Countable.exists_eq_rangeproof · cited by 17
- isLUB_iSupproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- mem_countableSupClosure_iff_iSupproof · cited by 1