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

Theorem fvreseq 5803
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 5491 . . . 4  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( F  |`  B )  Fn  B )
2 fnssres 5491 . . . 4  |-  ( ( G  Fn  A  /\  B  C_  A )  -> 
( G  |`  B )  Fn  B )
31, 2anim12i 338 . . 3  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  ( G  Fn  A  /\  B  C_  A
) )  ->  (
( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B ) )
43anandirs 601 . 2  |-  ( ( ( F  Fn  A  /\  G  Fn  A
)  /\  B  C_  A
)  ->  ( ( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B
) )
5 eqfnfv 5797 . . 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 5714 . . . . 5  |-  ( x  e.  B  ->  (
( F  |`  B ) `
 x )  =  ( F `  x
) )
7 fvres 5714 . . . . 5  |-  ( x  e.  B  ->  (
( G  |`  B ) `
 x )  =  ( G `  x
) )
86, 7eqeq12d 2253 . . . 4  |-  ( x  e.  B  ->  (
( ( F  |`  B ) `  x
)  =  ( ( G  |`  B ) `  x )  <->  ( F `  x )  =  ( G `  x ) ) )
98ralbiia 2564 . . 3  |-  ( A. x  e.  B  (
( F  |`  B ) `
 x )  =  ( ( G  |`  B ) `  x
)  <->  A. x  e.  B  ( F `  x )  =  ( G `  x ) )
105, 9bitrdi 196 . 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 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528    C_ wss 3220    |` cres 4771    Fn wfn 5367   ` cfv 5372
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 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 4244  ax-pow 4306  ax-pr 4341
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380
This theorem is referenced by:  tfri3  6628
  Copyright terms: Public domain W3C validator