Theorems · Theorem · order theory
LT.lt.eq_bot
∀ {α : Type u_2} [inst : Preorder α] [inst_1 : BoundedOrder α] [IsSimpleOrder α] {a b : α}, a < b → a = ⊥Alias of IsSimpleOrder.eq_bot_of_lt.
- Defined in
- Mathlib.Order.Atoms
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement · cited by 7,952
- Bot.botstatement · cited by 4,720
- BoundedOrderstatement · cited by 270
- IsSimpleOrderstatement · cited by 54
- IsSimpleOrder.eq_bot_of_ltproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.