Theorems · Theorem · order theory
bot_notMem_iff
∀ {α : Type u} [inst : PartialOrder α] [inst_1 : OrderBot α] {s : Set α}, ⊥ ∉ s ↔ ∀ x ∈ s, ⊥ < x- Defined in
- Mathlib.Order.BoundedOrder.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses no axioms
- Assumes
- PartialOrderOrderBot
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.
- Setstatement and proof · cited by 53,352
- PartialOrderstatement and proof · cited by 6,410
- Bot.botstatement and proof · cited by 4,720
- OrderBotstatement and proof · cited by 1,055
- Ne.bot_ltproof · cited by 116
- LT.lt.falseproof · cited by 66
Cited by2
Results whose statement or proof uses this declaration.
- zero_notMem_iffproof · cited by 0
- one_notMem_iffproof · cited by 0