Theorems · Theorem · order theory
SetLike.coe_set_eq
∀ {A : Type u_1} {B : Type u_2} [i : SetLike A B] {p q : A}, ↑p = ↑q ↔ p = q- Defined in
- Mathlib.Data.SetLike.Basic
- Cited by
- 27 results in Mathlib
- Foundations
- Depth 5 from the axioms · uses no axioms
- Assumes
- SetLike
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
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
- SetLike.coe_injectiveproof · cited by 374
Cited by27
Results whose statement or proof uses this declaration.
- SetLike.ext'_iffproof · cited by 78
- Finset.coe_injproof · cited by 41
- Ideal.map_includeRight_eqproof · cited by 3
- Sublattice.coe_injproof · cited by 3
- LieSubalgebra.coe_set_eqproof · cited by 2
- LowerSet.sdiff_eq_leftproof · cited by 2
- LieRinehartSubalgebra.coe_set_eqproof · cited by 2
- ArchimedeanClass.addSubgroup_strictAntiOnproof · cited by 1
- Ideal.map_includeLeft_eqproof · cited by 1
- BooleanSubalgebra.coe_injproof · cited by 1
- Submodule.dense_iff_topologicalClosure_eq_topproof · cited by 1
- ArchimedeanClass.subsemigroup_strictAntiproof · cited by 1