Mathlib Map

Theorems · Theorem · order theory

LE.le.eq_of_not_ssuperset

∀ {α : Type u_2} [UsesSetNotationForOrder α] [inst : PartialOrder α] {a b : α}, b ⊆ a → ¬b ⊂ a → a = b

Alias of LE.le.eq_of_not_ssubset'. Set notation form of LE.le.eq_of_not_lt'

Defined in
Mathlib.Order.RelClasses
Cited by
3 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
UsesSetNotationForOrderPartialOrder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

CovBy.exists_finset_cons · cited by 2CovBy.exists_finset_consCovBy.exists_set_insert · cited by 1CovBy.exists_set_insertHasSubset.Subset.eq_of_not_ssuperset · cited by 0Subset.eq_of_not_ssupersetPartialOrder · cited by 6410PartialOrderLE.le.eq_of_not_ssubset' · cited by 1le.eq_of_not_ssubset'le.eq_of_not_ssupersetCITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.