Mathlib Map

Theorems · Theorem · order theory

mem_countableSupClosure_iff_iSup

∀ {α : Type u_2} {s : Set α} {a : α} [inst : CompleteLattice α],
  a ∈ countableSupClosure 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.

Cited by1

Results whose statement or proof uses this declaration.