Theorems · Theorem · order theory
eq_bot_of_top_isCompl
∀ {α : Type u_1} [inst : Lattice α] [inst_1 : BoundedOrder α] {x : α}, IsCompl ⊤ x → x = ⊥- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
- 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 and proof · cited by 9,680
- Bot.botstatement · cited by 4,720
- Latticestatement and proof · cited by 916
- IsComplstatement and proof · cited by 351
- BoundedOrderstatement and proof · cited by 270
- IsCompl.dualproof · cited by 6
- eq_top_of_bot_isComplproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.