Theorems · Theorem · order theory
LT.lt.subset
∀ {α : Type u_1} [UsesSetNotationForOrder α] [inst : Preorder α] {a b : α}, a ⊂ b → a ⊆ bSet notation form of LT.lt.le
- Defined in
- Mathlib.Order.RelClasses
- Cited by
- 20 results in Mathlib
- Foundations
- Depth 6 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.
Cited by20
Results whose statement or proof uses this declaration.
- Set.ncard_lt_ncardproof · cited by 5
- Matroid.IsCircuit.ssubset_indepproof · cited by 4
- Matroid.IsCircuit.contract_isCircuitproof · cited by 4
- Set.Finite.encard_lt_encardproof · cited by 4
- Cardinal.card_lt_card_of_right_finiteproof · cited by 3
- Matroid.Indep.closure_ssubset_closureproof · cited by 3
- Set.Finite.ecard_lt_ecardproof · cited by 2
- Matroid.restrict_isStrictRestrictionproof · cited by 1
- Matroid.IsBase.not_isBase_of_ssubsetproof · cited by 1
- Matroid.IsBase.dep_of_ssubsetproof · cited by 1
- Matroid.IsBasis.dep_of_ssubsetproof · cited by 1
- Matroid.IsBase.exists_insert_of_ssubsetproof · cited by 0