Theorems · Theorem · order theory
Codisjoint.eq_iff
∀ {α : Type u_1} [inst : PartialOrder α] [inst_1 : OrderTop α] {a b : α}, Codisjoint a b → (a = b ↔ a = ⊤ ∧ b = ⊤)- Defined in
- Mathlib.Order.Disjoint
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 16 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- PartialOrderOrderTop
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Top.topstatement · cited by 9,680
- PartialOrderstatement and proof · cited by 6,410
- OrderTopstatement and proof · cited by 493
- Codisjointstatement and proof · cited by 197
Cited by1
Results whose statement or proof uses this declaration.
- himp_eq_leftproof · cited by 1