Theorems · Definition · order theory
SupHom.toFun
{α : Type u_6} → {β : Type u_7} → [inst : Max α] → [inst_1 : Max β] → SupHom α β → α → βThe underlying function of a SupHom.
Do not use this function directly. Instead use the coercion coming from the FunLike
instance.
- Defined in
- Mathlib.Order.Hom.Lattice
- Cited by
- 43 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SupHomstatement and proof · cited by 68
Cited by77
Results whose statement or proof uses this declaration.
- LatticeHom.map_inf'statement · cited by 4
- LatticeHom.toInfHomproof · cited by 2
- HeytingHom.mk.injstatement and proof · cited by 1
- HeytingHom.mk.noConfusionstatement and proof · cited by 1
- SupBotHom.coe_mkstatement and proof · cited by 1
- LatticeHom.mk.injstatement and proof · cited by 1
- LatticeHom.mk.noConfusionstatement and proof · cited by 1
- SupBotHom.toBotHomproof · cited by 1
- BoundedLatticeHom.toBoundedOrderHomproof · cited by 1
- BoundedLatticeHom.toInfTopHomproof · cited by 1
- BiheytingHom.mk.injstatement and proof · cited by 1
- BiheytingHom.mk.noConfusionstatement and proof · cited by 1