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

Theorem fvreseq 5759
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 5452 . . . 4  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( F  |`  B )  Fn  B )
2 fnssres 5452 . . . 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 597 . 2  |-  ( ( ( F  Fn  A  /\  G  Fn  A
)  /\  B  C_  A
)  ->  ( ( F  |`  B )  Fn  B  /\  ( G  |`  B )  Fn  B
) )
5 eqfnfv 5753 . . 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 5672 . . . . 5  |-  ( x  e.  B  ->  (
( F  |`  B ) `
 x )  =  ( F `  x
) )
7 fvres 5672 . . . . 5  |-  ( x  e.  B  ->  (
( G  |`  B ) `
 x )  =  ( G `  x
) )
86, 7eqeq12d 2246 . . . 4  |-  ( x  e.  B  ->  (
( ( F  |`  B ) `  x
)  =  ( ( G  |`  B ) `  x )  <->  ( F `  x )  =  ( G `  x ) ) )
98ralbiia 2547 . . 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 1398    e. wcel 2202   A.wral 2511    C_ wss 3201    |` cres 4733    Fn wfn 5328   ` cfv 5333
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 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341
This theorem is referenced by:  tfri3  6576
  Copyright terms: Public domain W3C validator