Theorems · Theorem · order theory
LE.le.eq_of_not_ssubset
∀ {α : Type u_2} [UsesSetNotationForOrder α] [inst : PartialOrder α] {a b : α}, a ⊆ b → ¬a ⊂ b → a = bSet notation form of LE.le.eq_of_not_lt
- Defined in
- Mathlib.Order.RelClasses
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- PartialOrderstatement and proof · cited by 6,410
- LE.le.eq_of_not_ltproof · cited by 25
Cited by2
Results whose statement or proof uses this declaration.
- CovBy.exists_set_sdiff_singletonproof · cited by 2
- HasSubset.Subset.eq_of_not_ssubsetproof · cited by 0