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

Theorem fvreseq 5517
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 5231 . . . 4  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( F  |`  B )  Fn  B )
2 fnssres 5231 . . . 4  |-  ( ( G  Fn  A  /\  B  C_  A )  -> 
( G  |`  B )  Fn  B )
31, 2anim12i 336 . . 3  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  ( G  Fn  A  /\  B  C_  A
) )  ->  (
( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B ) )
43anandirs 582 . 2  |-  ( ( ( F  Fn  A  /\  G  Fn  A
)  /\  B  C_  A
)  ->  ( ( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B
) )
5 eqfnfv 5511 . . 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 5438 . . . . 5  |-  ( x  e.  B  ->  (
( F  |`  B ) `
 x )  =  ( F `  x
) )
7 fvres 5438 . . . . 5  |-  ( x  e.  B  ->  (
( G  |`  B ) `
 x )  =  ( G `  x
) )
86, 7eqeq12d 2152 . . . 4  |-  ( x  e.  B  ->  (
( ( F  |`  B ) `  x
)  =  ( ( G  |`  B ) `  x )  <->  ( F `  x )  =  ( G `  x ) ) )
98ralbiia 2447 . . 3  |-  ( A. x  e.  B  (
( F  |`  B ) `
 x )  =  ( ( G  |`  B ) `  x
)  <->  A. x  e.  B  ( F `  x )  =  ( G `  x ) )
105, 9syl6bb 195 . 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 103    <-> wb 104    = wceq 1331    e. wcel 1480   A.wral 2414    C_ wss 3066    |` cres 4536    Fn wfn 5113   ` cfv 5118
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-csb 2999  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-res 4546  df-iota 5083  df-fun 5120  df-fn 5121  df-fv 5126
This theorem is referenced by:  tfri3  6257
  Copyright terms: Public domain W3C validator