Theorems · Theorem · order theory
eq_top_of_bot_isCompl
∀ {α : Type u_1} [inst : Lattice α] [inst_1 : BoundedOrder α] {x : α}, IsCompl ⊥ x → x = ⊤- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses propext
- Assumes
- LatticeBoundedOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- Bot.botstatement and proof · cited by 4,720
- Latticestatement and proof · cited by 916
- IsComplstatement and proof · cited by 351
- BoundedOrderstatement and proof · cited by 270
- IsCompl.symmproof · cited by 80
- eq_top_of_isCompl_botproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- eq_bot_of_top_isComplproof · cited by 0