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

Theorem eqfnfv2f 5681
Description: Equality of functions is determined by their values. Special case of Exercise 4 of [TakeutiZaring] p. 28 (with domain equality omitted). This version of eqfnfv 5677 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 29-Jan-2004.)
Hypotheses
Ref Expression
eqfnfv2f.1  |-  F/_ x F
eqfnfv2f.2  |-  F/_ x G
Assertion
Ref Expression
eqfnfv2f  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
Distinct variable group:    x, A
Allowed substitution hints:    F( x)    G( x)

Proof of Theorem eqfnfv2f
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 eqfnfv 5677 . 2  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  A. z  e.  A  ( F `  z )  =  ( G `  z ) ) )
2 eqfnfv2f.1 . . . . 5  |-  F/_ x F
3 nfcv 2348 . . . . 5  |-  F/_ x
z
42, 3nffv 5586 . . . 4  |-  F/_ x
( F `  z
)
5 eqfnfv2f.2 . . . . 5  |-  F/_ x G
65, 3nffv 5586 . . . 4  |-  F/_ x
( G `  z
)
74, 6nfeq 2356 . . 3  |-  F/ x
( F `  z
)  =  ( G `
 z )
8 nfv 1551 . . 3  |-  F/ z ( F `  x
)  =  ( G `
 x )
9 fveq2 5576 . . . 4  |-  ( z  =  x  ->  ( F `  z )  =  ( F `  x ) )
10 fveq2 5576 . . . 4  |-  ( z  =  x  ->  ( G `  z )  =  ( G `  x ) )
119, 10eqeq12d 2220 . . 3  |-  ( z  =  x  ->  (
( F `  z
)  =  ( G `
 z )  <->  ( F `  x )  =  ( G `  x ) ) )
127, 8, 11cbvral 2734 . 2  |-  ( A. z  e.  A  ( F `  z )  =  ( G `  z )  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) )
131, 12bitrdi 196 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 1373   F/_wnfc 2335   A.wral 2484    Fn wfn 5266   ` cfv 5271
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-iota 5232  df-fun 5273  df-fn 5274  df-fv 5279
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator