Theorems · Theorem · order theory
Order.Ideal.bot_mem
∀ {P : Type u_1} [inst : LE P] [inst_1 : OrderBot P] (s : Order.Ideal P), ⊥ ∈ s- Defined in
- Mathlib.Order.Ideal
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses Classical.choice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- OrderBotstatement and proof · cited by 1,055
- bot_leproof · cited by 306
- Order.Idealstatement and proof · cited by 102
- Set.Nonempty.someproof · cited by 53
- Set.Nonempty.some_memproof · cited by 42
- Order.Ideal.lowerproof · cited by 11
- Order.Ideal.nonempty'proof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Order.Ideal.IsPrime.mem_or_compl_memproof · cited by 2
- Order.PFilter.top_memproof · cited by 0