ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqfnfv Unicode version

Theorem eqfnfv 5662
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
StepHypRef Expression
1 dffn5im 5609 . . 3  |-  ( F  Fn  A  ->  F  =  ( x  e.  A  |->  ( F `  x ) ) )
2 dffn5im 5609 . . 3  |-  ( G  Fn  A  ->  G  =  ( x  e.  A  |->  ( G `  x ) ) )
31, 2eqeqan12d 2212 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <-> 
( x  e.  A  |->  ( F `  x
) )  =  ( x  e.  A  |->  ( G `  x ) ) ) )
4 funfvex 5578 . . . . . 6  |-  ( ( Fun  F  /\  x  e.  dom  F )  -> 
( F `  x
)  e.  _V )
54funfni 5361 . . . . 5  |-  ( ( F  Fn  A  /\  x  e.  A )  ->  ( F `  x
)  e.  _V )
65ralrimiva 2570 . . . 4  |-  ( F  Fn  A  ->  A. x  e.  A  ( F `  x )  e.  _V )
7 mpteqb 5655 . . . 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 ) ) )
86, 7syl 14 . . 3  |-  ( F  Fn  A  ->  (
( x  e.  A  |->  ( F `  x
) )  =  ( x  e.  A  |->  ( G `  x ) )  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
98adantr 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 ) ) )
103, 9bitrd 188 1  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364    e. wcel 2167   A.wral 2475   _Vcvv 2763    |-> cmpt 4095    Fn wfn 5254   ` cfv 5259
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267
This theorem is referenced by:  eqfnfv2  5663  eqfnfvd  5665  eqfnfv2f  5666  fvreseq  5668  fnmptfvd  5669  fneqeql  5673  fconst2g  5780  cocan1  5837  cocan2  5838  tfri3  6434  updjud  7157  nninfwlporlemd  7247  ser0f  10643  prodf1f  11725  1arithlem4  12560  1arith  12561  isgrpinv  13256  cnmpt11  14603  cnmpt21  14611
  Copyright terms: Public domain W3C validator