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

Theorem fvreseq 5292
Description: Equality of restricted functions is determined by their values. (Contributed by NM, 3-Aug-1994.)
Assertion
Ref Expression
fvreseq  |-  ( ( ( F  Fn  A  /\  G  Fn  A
)  /\  B  C_  A
)  ->  ( ( F  |`  B )  =  ( G  |`  B )  <->  A. x  e.  B  ( F `  x )  =  ( G `  x ) ) )
Distinct variable groups:    x, B    x, F    x, G
Allowed substitution hint:    A( x)

Proof of Theorem fvreseq
StepHypRef Expression
1 fnssres 5032 . . . 4  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( F  |`  B )  Fn  B )
2 fnssres 5032 . . . 4  |-  ( ( G  Fn  A  /\  B  C_  A )  -> 
( G  |`  B )  Fn  B )
31, 2anim12i 331 . . 3  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  ( G  Fn  A  /\  B  C_  A
) )  ->  (
( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B ) )
43anandirs 557 . 2  |-  ( ( ( F  Fn  A  /\  G  Fn  A
)  /\  B  C_  A
)  ->  ( ( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B
) )
5 eqfnfv 5286 . . 3  |-  ( ( ( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B )  ->  (
( F  |`  B )  =  ( G  |`  B )  <->  A. x  e.  B  ( ( F  |`  B ) `  x )  =  ( ( G  |`  B ) `
 x ) ) )
6 fvres 5219 . . . . 5  |-  ( x  e.  B  ->  (
( F  |`  B ) `
 x )  =  ( F `  x
) )
7 fvres 5219 . . . . 5  |-  ( x  e.  B  ->  (
( G  |`  B ) `
 x )  =  ( G `  x
) )
86, 7eqeq12d 2095 . . . 4  |-  ( x  e.  B  ->  (
( ( F  |`  B ) `  x
)  =  ( ( G  |`  B ) `  x )  <->  ( F `  x )  =  ( G `  x ) ) )
98ralbiia 2380 . . 3  |-  ( A. x  e.  B  (
( F  |`  B ) `
 x )  =  ( ( G  |`  B ) `  x
)  <->  A. x  e.  B  ( F `  x )  =  ( G `  x ) )
105, 9syl6bb 194 . 2  |-  ( ( ( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B )  ->  (
( F  |`  B )  =  ( G  |`  B )  <->  A. x  e.  B  ( F `  x )  =  ( G `  x ) ) )
114, 10syl 14 1  |-  ( ( ( F  Fn  A  /\  G  Fn  A
)  /\  B  C_  A
)  ->  ( ( F  |`  B )  =  ( G  |`  B )  <->  A. x  e.  B  ( F `  x )  =  ( G `  x ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284    e. wcel 1433   A.wral 2348    C_ wss 2973    |` cres 4365    Fn wfn 4917   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-sbc 2816  df-csb 2909  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-res 4375  df-iota 4887  df-fun 4924  df-fn 4925  df-fv 4930
This theorem is referenced by:  tfri3  5976
  Copyright terms: Public domain W3C validator