Theorem eqfnfv 5806

Description: Equality of functions is determined by their values. Special case of Exercise 4 of [TakeutiZaring] p. 28 (with domain equality omitted). (Contributed by NM, 3-Aug-1994.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)

Assertion

Ref	Expression
eqfnfv	|- ( ( F Fn A /\ G Fn A ) -> ( F = G <-> A. x e. A ( F ` x ) = ( G ` x ) ) )

Distinct variable groups:   x, A   x, F   x, G

Proof of Theorem eqfnfv

Step	Hyp	Ref	Expression
1		dffn5im 5748	. . 3 |- ( F Fn A -> F = ( x e. A |-> ( F ` x ) ) )
2		dffn5im 5748	. . 3 |- ( G Fn A -> G = ( x e. A |-> ( G ` x ) ) )
3	1, 2	eqeqan12d 2254	. 2 |- ( ( F Fn A /\ G Fn A ) -> ( F = G <-> ( x e. A |-> ( F ` x ) ) = ( x e. A |-> ( G ` x ) ) ) )
4		funfvex 5712	. . . . . 6 |- ( ( Fun F /\ x e. dom F ) -> ( F ` x ) e. _V )
5	4	funfni 5483	. . . . 5 |- ( ( F Fn A /\ x e. A ) -> ( F ` x ) e. _V )
6	5	ralrimiva 2623	. . . 4 |- ( F Fn A -> A. x e. A ( F ` x ) e. _V )
7		mpteqb 5796	. . . 4 |- ( A. x e. A ( F ` x ) e. _V -> ( ( x e. A |-> ( F ` x ) ) = ( x e. A |-> ( G ` x ) ) <-> A. x e. A ( F ` x ) = ( G ` x ) ) )
8	6, 7	syl 14	. . 3 |- ( F Fn A -> ( ( x e. A |-> ( F ` x ) ) = ( x e. A |-> ( G ` x ) ) <-> A. x e. A ( F ` x ) = ( G ` x ) ) )
9	8	adantr 276	. 2 |- ( ( F Fn A /\ G Fn A ) -> ( ( x e. A |-> ( F ` x ) ) = ( x e. A |-> ( G ` x ) ) <-> A. x e. A ( F ` x ) = ( G ` x ) ) )
10	3, 9	bitrd 188	1 |- ( ( F Fn A /\ G Fn A ) -> ( F = G <-> A. x e. A ( F ` x ) = ( G ` x ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   _Vcvv 2821   |-> cmpt 4192   Fn wfn 5372   ` cfv 5377

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385

This theorem is used by:  eqfnfv2  5807  eqfnfvd  5809  eqfnfv2f  5810  fvreseq  5812  fnmptfvd  5813  fneqeql  5817  fconst2g  5930  cocan1  5993  cocan2  5994  tfri3  6638  updjud  7422  nninfwlporlemd  7512  ser0f  10971  hashf1lem1  11285  prodf1f  12310  1arithlem4  13145  1arith  13146  isgrpinv  13859  psrbagconf1o  15064  cnmpt11  15384  cnmpt21  15392  nnnninfex  17065  nninfnfiinf  17066