Theorems · Theorem
DFunLike.ext_iff
∀ {F : Sort u_1} {α : Sort u_2} {β : α → Sort u_3} [i : DFunLike F α β] {f g : F}, f = g ↔ ∀ (x : α), f x = g x- Defined in
- Mathlib.Data.FunLike.Basic
- Cited by
- 102 results in Mathlib
- Foundations
- Depth 6 from the axioms, rests on 13 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 · cited by 62,936
- DFunLikestatement and proof · cited by 576
- DFunLike.coe_fn_eqproof · cited by 18
Cited by102
Results whose statement or proof uses this declaration.
- DFunLike.ne_iffproof · cited by 18
- IsGaloisGroup.card_eq_finrankproof · cited by 10
- Polynomial.ext_iffproof · cited by 9
- AddMonoidHom.ext_intproof · cited by 7
- Finsupp.single_eq_single_iffproof · cited by 6
- IsLocalization.lift_compproof · cited by 5
- SubMulAction.ofStabilizer.isMultiplyPretransitiveproof · cited by 5
- iSupIndep_of_dfinsupp_lsum_injectiveproof · cited by 5
- AddMonoidAlgebra.addHom_ext'proof · cited by 4
- IsLocalization.lift_uniqueproof · cited by 3
- MonoidHom.cancel_rightproof · cited by 3
- Polynomial.span_minpoly_eq_annihilatorproof · cited by 3