Theorems · Theorem · order theory
OrderHom.iSup_apply
∀ {α : Type u_1} {β : Type u_2} [inst : Preorder α] {ι : Sort u_3} [inst_1 : CompleteLattice β] (f : ι → α →o β)
(x : α), (⨆ i, f i) x = ⨆ i, (f i) x- Defined in
- Mathlib.Order.Hom.Order
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Quot.sound
- Assumes
- PreorderCompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Preorderstatement and proof · cited by 7,952
- Set.rangeproof · cited by 4,705
- iSupstatement · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- OrderHomstatement and proof · cited by 934
- iSup_rangeproof · cited by 24
- OrderHom.sSup_applyproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- OrderHom.coe_iSupproof · cited by 0