Theorems · Definition · order theory
SupHom.withBot
{α : Type u_1} →
{β : Type u_2} →
[inst : SemilatticeSup α] → [inst_1 : SemilatticeSup β] → SupHom α β → SupBotHom (WithBot α) (WithBot β)Adjoins a ⊥ to the domain and codomain of a SupHom.
- Defined in
- Mathlib.Order.Hom.WithTopBot
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext, Quot.sound
- Assumes
- SemilatticeSupSemilatticeSup
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- WithBotstatement · cited by 1,498
- SemilatticeSupstatement and proof · cited by 785
- SupHomstatement and proof · cited by 68
- WithBot.mapproof · cited by 66
- SupBotHomstatement · cited by 54
Cited by4
Results whose statement or proof uses this declaration.
- LatticeHom.withBotproof · cited by 4
- SupHom.withBot_compstatement and proof · cited by 0
- SupHom.withBot_idstatement and proof · cited by 0
- SupHom.withBot_toFunstatement and proof · cited by 0