Theorems · Theorem · order theory
mem_countableInfClosure_iff_iInf
∀ {α : Type u_2} {s : Set α} {a : α} [inst : CompleteLattice α],
a ∈ countableInfClosure s ↔ ∃ t, (∀ (n : ℕ), t n ∈ s) ∧ ⨅ n, t n = a- Defined in
- Mathlib.Order.CountableSupClosed
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 77 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.
Cites17
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Set.ofPredproof · cited by 6,101
- le_antisymmproof · cited by 2,068
- iInfstatement and proof · cited by 1,690
- CompleteLatticestatement and proof · cited by 1,048
- ClosureOperatorstatement · cited by 371
- Nat.unpairproof · cited by 67
- CountableInfClosedproof · cited by 27
- countableInfClosurestatement and proof · cited by 21
- ciInf_constproof · cited by 20
- subset_countableInfClosureproof · cited by 7
Cited by1
Results whose statement or proof uses this declaration.
- SupClosed.countableInfClosureproof · cited by 0