Theorems · Theorem · order theory
SetLike.coe_eq_coe
∀ {A : Type u_1} {B : Type u_2} [i : SetLike A B] {p : A} {x y : ↥p}, ↑x = ↑y ↔ x = y- Defined in
- Mathlib.Data.SetLike.Basic
- Cited by
- 21 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
- Assumes
- SetLike
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SetLikestatement and proof · cited by 1,084
Cited by21
Results whose statement or proof uses this declaration.
- Submodule.coe_eq_zeroproof · cited by 9
- AddSubmonoid.mk_eq_zeroproof · cited by 6
- SubMulAction.ofStabilizer.conjMap_bijectiveproof · cited by 2
- Equiv.Perm.isPretransitive_of_isCycle_memproof · cited by 2
- SubAddAction.ofStabilizer.addConjMap_bijectiveproof · cited by 2
- IsLocalization.integerMultiple_injectiveproof · cited by 2
- InfiniteGalois.restrictNormalHom_continuousproof · cited by 1
- Valuation.ideal_isPrincipalproof · cited by 1
- SubAddAction.addConjMap_ofFixingAddSubgroup_bijectiveproof · cited by 1
- SubMulAction.ofFixingSubgroup_of_inclusion_injectiveproof · cited by 1
- MulAction.IsMultiplyPreprimitive.of_bijective_mapproof · cited by 1
- SubAddAction.map_ofFixingAddSubgroupUnion_bijectiveproof · cited by 1