Theorems · Theorem
DFunLike.coe_fn_eq
∀ {F : Sort u_1} {α : Sort u_2} {β : α → Sort u_3} [i : DFunLike F α β] {f g : F}, ⇑f = ⇑g ↔ f = g- Defined in
- Mathlib.Data.FunLike.Basic
- Cited by
- 18 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
- Assumes
- DFunLike
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.
- DFunLike.coestatement and proof · cited by 62,936
- DFunLikestatement and proof · cited by 576
- DFunLike.coe_injectiveproof · cited by 161
Cited by18
Results whose statement or proof uses this declaration.
- DFunLike.ext_iffproof · cited by 102
- DFunLike.ext'_iffproof · cited by 21
- Equiv.coe_injproof · cited by 6
- injective_of_isLocalization_isMaximalproof · cited by 2
- Algebra.TensorProduct.includeLeft_bijectiveproof · cited by 2
- surjective_of_isLocalization_isMaximalproof · cited by 2
- BoundedContinuousFunction.toLp_injproof · cited by 1
- Finsupp.coe_eq_zeroproof · cited by 1
- Finset.finsuppAntidiag_zeroproof · cited by 0
- GradedAlgHom.coe_fn_injproof · cited by 0
- ArithmeticFunction.coe_injproof · cited by 0
- MultilinearMap.coe_injproof · cited by 0