Theorems · Theorem · order theory
SetLike.mem_coe
∀ {A : Type u_1} {B : Type u_2} [i : SetLike A B] {p : A} {x : B}, x ∈ ↑p ↔ x ∈ p- Defined in
- Mathlib.Data.SetLike.Basic
- Cited by
- 302 results in Mathlib
- Foundations
- Depth 5 from the axioms, rests on 10 definitions · uses no axioms
- Assumes
- SetLike
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- SetLike.coestatement · cited by 8,199
- SetLikestatement and proof · cited by 1,084
Cited by302
Results whose statement or proof uses this declaration.
- Finsupp.range_linearCombinationproof · cited by 24
- Submodule.span_singleton_le_iff_memproof · cited by 21
- LieSubalgebra.subset_lieSpanproof · cited by 19
- Subgroup.le_normalizerproof · cited by 19
- TopologicalSpace.Opens.mem_iSupproof · cited by 17
- LieSubmodule.subset_lieSpanproof · cited by 14
- Submodule.mem_iInfproof · cited by 12
- Finset.sum_of_injOnproof · cited by 8
- lowerClosure_singletonproof · cited by 8
- AddSubgroup.zmultiples_leproof · cited by 7
- Submodule.mem_iSup_of_directedproof · cited by 7
- vectorSpan_eq_span_vsub_set_rightproof · cited by 7
Showing the 200 most cited of 302.