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

Theorem eqfnfv2 5781
Description: Equality of functions is determined by their values. Exercise 4 of [TakeutiZaring] p. 28. (Contributed by NM, 3-Aug-1994.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
eqfnfv2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
Distinct variable groups:    x, A    x, F    x, G
Allowed substitution hint:    B( x)

Proof of Theorem eqfnfv2
StepHypRef Expression
1 dmeq 4961 . . . 4  |-  ( F  =  G  ->  dom  F  =  dom  G )
2 fndm 5460 . . . . 5  |-  ( F  Fn  A  ->  dom  F  =  A )
3 fndm 5460 . . . . 5  |-  ( G  Fn  B  ->  dom  G  =  B )
42, 3eqeqan12d 2250 . . . 4  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( dom  F  =  dom  G  <->  A  =  B ) )
51, 4imbitrid 154 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  ->  A  =  B ) )
65pm4.71rd 394 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( A  =  B  /\  F  =  G ) ) )
7 fneq2 5450 . . . . . 6  |-  ( A  =  B  ->  ( G  Fn  A  <->  G  Fn  B ) )
87biimparc 299 . . . . 5  |-  ( ( G  Fn  B  /\  A  =  B )  ->  G  Fn  A )
9 eqfnfv 5780 . . . . 5  |-  ( ( F  Fn  A  /\  G  Fn  A )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
108, 9sylan2 286 . . . 4  |-  ( ( F  Fn  A  /\  ( G  Fn  B  /\  A  =  B
) )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
1110anassrs 400 . . 3  |-  ( ( ( F  Fn  A  /\  G  Fn  B
)  /\  A  =  B )  ->  ( F  =  G  <->  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) )
1211pm5.32da 452 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( A  =  B  /\  F  =  G )  <->  ( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
136, 12bitrd 188 1  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( F  =  G  <-> 
( A  =  B  /\  A. x  e.  A  ( F `  x )  =  ( G `  x ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398   A.wral 2522   dom cdm 4754    Fn wfn 5352   ` cfv 5357
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365
This theorem is referenced by:  eqfnfv3  5782  eqfunfv  5785  eqfnov  6168  2ffzeq  10497  eqwrd  11290
  Copyright terms: Public domain W3C validator