Theorems · Theorem · order theory
WithBot.unbotA.congr_simp
∀ {α : Type u_1} [inst : Nonempty α] (a a_1 : WithBot α), a = a_1 → a.unbotA = a_1.unbotA- Defined in
- Mathlib.Order.WithBot
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses Classical.choice
- Assumes
- Nonempty
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- WithBotstatement and proof · cited by 1,498
- WithBot.unbotAstatement and proof · cited by 10
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.