Theorems · Theorem · order theory
WithBot.unbotA_eq_unbot
∀ {α : Type u_1} [inst : Nonempty α] {a : WithBot α} (ha : a ≠ ⊥), a.unbotA = a.unbot ha- Defined in
- Mathlib.Order.WithBot
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses propext, Classical.choice
- Assumes
- Nonempty
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.
- Bot.botstatement and proof · cited by 4,720
- WithBotstatement and proof · cited by 1,498
- WithBot.someproof · cited by 541
- WithBot.recBotCoeproof · cited by 101
- WithBot.unbotstatement · cited by 23
- WithBot.unbotAstatement · cited by 10
Cited by1
Results whose statement or proof uses this declaration.
- WithBot.tendsto_unbotproof · cited by 1