Theorems · Theorem · order theory
subsingleton_iff_bot_eq_top
∀ {α : Type u} [inst : PartialOrder α] [inst_1 : BoundedOrder α], ⊥ = ⊤ ↔ Subsingleton α- Defined in
- Mathlib.Order.BoundedOrder.Basic
- Cited by
- 16 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
- Assumes
- PartialOrderBoundedOrder
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.
- Top.topstatement and proof · cited by 9,680
- PartialOrderstatement and proof · cited by 6,410
- Bot.botstatement and proof · cited by 4,720
- BoundedOrderstatement and proof · cited by 270
- subsingleton_of_bot_eq_topproof · cited by 8
Cited by16
Results whose statement or proof uses this declaration.
- Submodule.subsingleton_iffproof · cited by 7
- IsSemisimpleModule.eq_bot_or_exists_simple_leproof · cited by 4
- IsLocalRing.subsingleton_tensorProductproof · cited by 4
- LieSubmodule.subsingleton_iffproof · cited by 4
- AddGroup.nilpotencyClass_zero_iff_subsingletonproof · cited by 2
- Group.nilpotencyClass_zero_iff_subsingletonproof · cited by 2
- IsCyclotomicExtension.iff_union_singleton_oneproof · cited by 2
- AddGroup.rank_eq_zero_iffproof · cited by 2
- IsCyclotomicExtension.finiteproof · cited by 1
- Fin.zero_eq_topproof · cited by 1
- ConvexCone.isGenerating_bot_iffproof · cited by 1
- LieModule.nilpotencyLength_eq_zero_iffproof · cited by 1