Theorems · Theorem · order theory
CompleteLattice.isCompactElement_iff_exists_le_iSup_of_le_iSup
∀ {α : Type u} [inst : CompleteLattice α] (k : α),
IsCompactElement k ↔ ∀ (ι : Type u) (s : ι → α), k ≤ iSup s → ∃ t, k ≤ t.sup s- Defined in
- Mathlib.Order.CompactlyGenerated.Basic
- 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.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Set.Elemproof · cited by 7,166
- Set.rangeproof · cited by 4,705
- Finset.univproof · cited by 3,473
- LE.le.transproof · cited by 3,151
- iSupstatement and proof · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- SupSet.sSupproof · cited by 954
- Finset.imageproof · cited by 910
- Finset.supstatement and proof · cited by 530
Cited by1
Results whose statement or proof uses this declaration.
- TopologicalSpace.Opens.isCompactElement_iffproof · cited by 1