Theorems · Theorem · order theory
OrderHom.sSup_apply
∀ {α : Type u_1} {β : Type u_2} [inst : Preorder α] [inst_1 : CompleteLattice β] (s : Set (α →o β)) (x : α),
(sSup s) x = ⨆ f ∈ s, f x- Defined in
- Mathlib.Order.Hom.Order
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses no axioms
- Assumes
- PreorderCompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Setstatement and proof · cited by 53,352
- Preorderstatement and proof · cited by 7,952
- iSupstatement · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- SupSet.sSupstatement · cited by 954
- OrderHomstatement and proof · cited by 934
Cited by1
Results whose statement or proof uses this declaration.
- OrderHom.iSup_applyproof · cited by 1