Theorems · Theorem
DFunLike.ext
∀ {F : Sort u_1} {α : Sort u_2} {β : α → Sort u_3} [i : DFunLike F α β] (f g : F), (∀ (x : α), f x = g x) → f = g- Defined in
- Mathlib.Data.FunLike.Basic
- Cited by
- 240 results in Mathlib
- Foundations
- Depth 5 from the axioms, rests on 8 definitions · uses Quot.sound
- 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 by240
Results whose statement or proof uses this declaration.
- LinearMap.extproof · cited by 844
- Finsupp.extproof · cited by 399
- RingHom.extproof · cited by 331
- ContinuousLinearMap.extproof · cited by 320
- AlgHom.extproof · cited by 170
- AddMonoidHom.extproof · cited by 149
- ProbabilityTheory.Kernel.extproof · cited by 116
- MonoidHom.extproof · cited by 109
- Equiv.extproof · cited by 102
- ContinuousMap.extproof · cited by 92
- DFinsupp.extproof · cited by 78
- LinearEquiv.extproof · cited by 72
Showing the 200 most cited of 240.