Theorems · Theorem · order theory
Eq.subset
∀ {α : Type u_1} [UsesSetNotationForOrder α] [inst : Preorder α] {a b : α}, a = b → a ⊆ bSet notation form of Eq.le
- Defined in
- Mathlib.Order.RelClasses
- Cited by
- 124 results in Mathlib
- Foundations
- Depth 7 from the axioms, rests on 9 definitions · 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 by124
Results whose statement or proof uses this declaration.
- Matroid.closure_closureproof · cited by 14
- Matroid.isBasis_ground_iffproof · cited by 10
- Graph.Compatible.extproof · cited by 9
- isClopen_iff_frontier_eq_emptyproof · cited by 6
- Finset.subset_iff_eq_of_card_leproof · cited by 5
- MonovaryOn.sum_smul_comp_perm_eq_sum_smul_iffproof · cited by 5
- Topology.IsInducing.locallyCompactSpaceproof · cited by 4
- Matroid.Indep.eq_of_isBasisproof · cited by 4
- Set.Subset.antisymm_iffproof · cited by 4
- MonovaryOn.sum_comp_perm_smul_eq_sum_smul_iffproof · cited by 4
- mulTSupport_binop_subsetproof · cited by 3
- Matroid.indep_iff_forall_notMem_closure_sdiffproof · cited by 3