Theorems · Theorem · order theory
BotHom.mk.inj
∀ {α : Type u_6} {β : Type u_7} {inst : Bot α} {inst_1 : Bot β} {toFun : α → β} {map_bot' : toFun ⊥ = ⊥}
{toFun_1 : α → β} {map_bot'_1 : toFun_1 ⊥ = ⊥},
{ toFun := toFun, map_bot' := map_bot' } = { toFun := toFun_1, map_bot' := map_bot'_1 } → toFun = toFun_1- Defined in
- Mathlib.Order.Hom.Bounded
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Bot.botstatement and proof · cited by 4,720
- Botstatement and proof · cited by 96
- BotHomstatement · cited by 37
- BotHom.mk.noConfusionproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- BotHom.mk.injEqproof · cited by 0