Theorems · Theorem · order theory
SupPrime.ne_bot
∀ {α : Type u_2} [inst : SemilatticeSup α] {a : α} [inst_1 : OrderBot α], SupPrime a → a ≠ ⊥- Defined in
- Mathlib.Order.Irreducible
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
- Assumes
- SemilatticeSupOrderBot
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.
- Bot.botstatement and proof · cited by 4,720
- OrderBotstatement and proof · cited by 1,055
- SemilatticeSupstatement and proof · cited by 785
- SupPrimestatement and proof · cited by 19
- not_supPrime_botproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- SupPrime.le_finset_supproof · cited by 1