Theorems · Theorem · order theory
isCompl_top_bot
∀ {α : Type u_1} [inst : Lattice α] [inst_1 : BoundedOrder α], IsCompl ⊤ ⊥- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 5 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.
Cites8
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 and proof · cited by 4,720
- Latticestatement and proof · cited by 916
- IsComplstatement · cited by 351
- BoundedOrderstatement and proof · cited by 270
- inf_bot_eqproof · cited by 14
- top_sup_eqproof · cited by 8
- IsCompl.of_eqproof · cited by 7
Cited by5
Results whose statement or proof uses this declaration.
- compl_eq_botproof · cited by 4
- LinearMap.IsPerfectCompl.left_top_iffproof · cited by 1
- LinearMap.iSup_range_singleproof · cited by 1
- isComplemented_topproof · cited by 1
- LieAlgebra.IsKilling.isCompl_ker_weight_span_corootproof · cited by 0