Theorems · Theorem · order theory
inf_sSup_eq_iSup_inf_sup_finset
∀ {α : Type u_2} [inst : CompleteLattice α] [IsCompactlyGenerated α] {a : α} {s : Set α},
a ⊓ sSup s = ⨆ t, ⨆ (_ : ↑t ⊆ s), a ⊓ t.sup idThis property is equivalent to α being upper continuous.
- Defined in
- Mathlib.Order.CompactlyGenerated.Basic
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
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
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement and proof · cited by 8,199
- LE.le.transproof · cited by 3,151
- iSupstatement · cited by 2,415
- le_antisymmproof · cited by 2,068
- CompleteLatticestatement and proof · cited by 1,048
- SupSet.sSupstatement and proof · cited by 954
- Finset.supstatement and proof · cited by 530
- iSup_leproof · cited by 190
- le_infproof · cited by 107
- le_iSup₂proof · cited by 56
Cited by4
Results whose statement or proof uses this declaration.
- iSupIndep_iff_supIndepproof · cited by 2
- sSupIndep_iff_finiteproof · cited by 1
- disjoint_biSup_of_finite_disjoint_biSupproof · cited by 1
- iSupIndep_iff_supIndep_of_injOnproof · cited by 0