Theorems · Definition · order theory
WithBot.LT.casesOn
∀ {α : Type u_1} [inst : LT α] {motive : (a a_1 : WithBot α) → a.LT a_1 → Prop} {a a_1 : WithBot α} (t : a.LT a_1),
(∀ (b : α), motive ⊥ ↑b ⋯) → (∀ {a b : α} (a_2 : a < b), motive ↑a ↑b ⋯) → motive a a_1 t- Defined in
- Mathlib.Order.WithBot
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
- Assumes
- LT
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
- WithBotstatement and proof · cited by 1,498
- WithBot.somestatement and proof · cited by 541
- WithBot.LTstatement and proof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- ENat.lift_eq_toNat_of_lt_topproof · cited by 4
- WithBot.lt_def_auxproof · cited by 1