Theorems · Theorem
DFunLike.coe_injective
∀ {F : Sort u_1} {α : outParam (Sort u_2)} {β : outParam (α → Sort u_3)} [self : DFunLike F α β],
Function.Injective DFunLike.coeThe coercion to functions must be injective.
- Defined in
- Mathlib.Data.FunLike.Basic
- Cited by
- 161 results in Mathlib
- Foundations
- Depth 3 from the axioms, rests on 5 definitions · uses no axioms
- Assumes
- DFunLike
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.
- DFunLike.coestatement · cited by 62,936
- DFunLikestatement and proof · cited by 576
Cited by162
Results whose statement or proof uses this declaration.
- DFunLike.extproof · cited by 240
- DFunLike.ext'proof · cited by 78
- Finsupp.single_zeroproof · cited by 63
- OrderHom.extproof · cited by 55
- OrderIso.extproof · cited by 23
- DFunLike.coe_fn_eqproof · cited by 18
- CategoryTheory.GrothendieckTopology.extproof · cited by 12
- Function.Exact.linearMap_comp_eq_zeroproof · cited by 9
- ContinuousMap.isUniformEmbedding_toUniformOnFunIsCompactproof · cited by 8
- DFinsupp.single_zeroproof · cited by 8
- MulEquiv.toMonoidHom_injectiveproof · cited by 6
- IncidenceAlgebra.extproof · cited by 6