Theorems · Theorem · order theory
TopHom.sup_apply
∀ {α : Type u_2} {β : Type u_3} [inst : Top α] [inst_1 : SemilatticeSup β] [inst_2 : OrderTop β] (f g : TopHom α β)
(a : α), (f ⊔ g) a = f a ⊔ g a- Defined in
- Mathlib.Order.Hom.Bounded
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext
- Assumes
- TopSemilatticeSupOrderTop
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- SemilatticeSupstatement and proof · cited by 785
- OrderTopstatement and proof · cited by 493
- Topstatement and proof · cited by 93
- TopHomstatement and proof · cited by 37
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.