Theorems · Theorem · order theory
ssubset_of_ne_of_subset
∀ {α : Type u_1} [UsesSetNotationForOrder α] [inst : PartialOrder α] {a b : α}, a ≠ b → a ⊆ b → a ⊂ bSet notation form of lt_of_ne_of_le
- Defined in
- Mathlib.Order.RelClasses
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
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
- lt_of_ne_of_leproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- Set.Finite.induction_toproof · cited by 1
- SimpleGraph.IsMaximumClique.isMaximalCliqueproof · cited by 1
- Matroid.IsCircuit.contractElem_isCircuitproof · cited by 0