Theorems · Theorem · order theory
LowerSet.compl_bot
∀ {α : Type u_1} [inst : LE α], ⊥.compl = ⊥- Defined in
- Mathlib.Order.UpperLower.CompleteLattice
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 58 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LE
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.
- Bot.botstatement · cited by 4,720
- UpperSetstatement · cited by 245
- LowerSetstatement · cited by 230
- Set.compl_emptyproof · cited by 33
- UpperSet.extproof · cited by 29
- LowerSet.complstatement · cited by 17
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.