MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  shftfval Structured version   Visualization version   Unicode version

Theorem shftfval 13126
Description: The value of the sequence shifter operation is a function on 
CC.  A is ordinarily an integer. (Contributed by NM, 20-Jul-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1  |-  F  e. 
_V
Assertion
Ref Expression
shftfval  |-  ( A  e.  CC  ->  ( F  shift  A )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
Distinct variable groups:    x, y, A    x, F, y

Proof of Theorem shftfval
Dummy variables  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ovex 6316 . . . . . . . . . 10  |-  ( x  -  A )  e. 
_V
2 vex 3047 . . . . . . . . . 10  |-  y  e. 
_V
31, 2breldm 5038 . . . . . . . . 9  |-  ( ( x  -  A ) F y  ->  (
x  -  A )  e.  dom  F )
4 npcan 9881 . . . . . . . . . . 11  |-  ( ( x  e.  CC  /\  A  e.  CC )  ->  ( ( x  -  A )  +  A
)  =  x )
54eqcomd 2456 . . . . . . . . . 10  |-  ( ( x  e.  CC  /\  A  e.  CC )  ->  x  =  ( ( x  -  A )  +  A ) )
65ancoms 455 . . . . . . . . 9  |-  ( ( A  e.  CC  /\  x  e.  CC )  ->  x  =  ( ( x  -  A )  +  A ) )
7 oveq1 6295 . . . . . . . . . . 11  |-  ( w  =  ( x  -  A )  ->  (
w  +  A )  =  ( ( x  -  A )  +  A ) )
87eqeq2d 2460 . . . . . . . . . 10  |-  ( w  =  ( x  -  A )  ->  (
x  =  ( w  +  A )  <->  x  =  ( ( x  -  A )  +  A
) ) )
98rspcev 3149 . . . . . . . . 9  |-  ( ( ( x  -  A
)  e.  dom  F  /\  x  =  (
( x  -  A
)  +  A ) )  ->  E. w  e.  dom  F  x  =  ( w  +  A
) )
103, 6, 9syl2anr 481 . . . . . . . 8  |-  ( ( ( A  e.  CC  /\  x  e.  CC )  /\  ( x  -  A ) F y )  ->  E. w  e.  dom  F  x  =  ( w  +  A
) )
11 vex 3047 . . . . . . . . 9  |-  x  e. 
_V
12 eqeq1 2454 . . . . . . . . . 10  |-  ( z  =  x  ->  (
z  =  ( w  +  A )  <->  x  =  ( w  +  A
) ) )
1312rexbidv 2900 . . . . . . . . 9  |-  ( z  =  x  ->  ( E. w  e.  dom  F  z  =  ( w  +  A )  <->  E. w  e.  dom  F  x  =  ( w  +  A
) ) )
1411, 13elab 3184 . . . . . . . 8  |-  ( x  e.  { z  |  E. w  e.  dom  F  z  =  ( w  +  A ) }  <->  E. w  e.  dom  F  x  =  ( w  +  A ) )
1510, 14sylibr 216 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  x  e.  CC )  /\  ( x  -  A ) F y )  ->  x  e.  { z  |  E. w  e.  dom  F  z  =  ( w  +  A
) } )
161, 2brelrn 5064 . . . . . . . 8  |-  ( ( x  -  A ) F y  ->  y  e.  ran  F )
1716adantl 468 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  x  e.  CC )  /\  ( x  -  A ) F y )  ->  y  e.  ran  F )
1815, 17jca 535 . . . . . 6  |-  ( ( ( A  e.  CC  /\  x  e.  CC )  /\  ( x  -  A ) F y )  ->  ( x  e.  { z  |  E. w  e.  dom  F  z  =  ( w  +  A ) }  /\  y  e.  ran  F ) )
1918expl 623 . . . . 5  |-  ( A  e.  CC  ->  (
( x  e.  CC  /\  ( x  -  A
) F y )  ->  ( x  e. 
{ z  |  E. w  e.  dom  F  z  =  ( w  +  A ) }  /\  y  e.  ran  F ) ) )
2019ssopab2dv 4729 . . . 4  |-  ( A  e.  CC  ->  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  C_  { <. x ,  y >.  |  ( x  e.  { z  |  E. w  e. 
dom  F  z  =  ( w  +  A
) }  /\  y  e.  ran  F ) } )
21 df-xp 4839 . . . 4  |-  ( { z  |  E. w  e.  dom  F  z  =  ( w  +  A
) }  X.  ran  F )  =  { <. x ,  y >.  |  ( x  e.  { z  |  E. w  e. 
dom  F  z  =  ( w  +  A
) }  /\  y  e.  ran  F ) }
2220, 21syl6sseqr 3478 . . 3  |-  ( A  e.  CC  ->  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  C_  ( {
z  |  E. w  e.  dom  F  z  =  ( w  +  A
) }  X.  ran  F ) )
23 shftfval.1 . . . . . 6  |-  F  e. 
_V
2423dmex 6723 . . . . 5  |-  dom  F  e.  _V
2524abrexex 6764 . . . 4  |-  { z  |  E. w  e. 
dom  F  z  =  ( w  +  A
) }  e.  _V
2623rnex 6724 . . . 4  |-  ran  F  e.  _V
2725, 26xpex 6592 . . 3  |-  ( { z  |  E. w  e.  dom  F  z  =  ( w  +  A
) }  X.  ran  F )  e.  _V
28 ssexg 4548 . . 3  |-  ( ( { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) }  C_  ( { z  |  E. w  e.  dom  F  z  =  ( w  +  A ) }  X.  ran  F )  /\  ( { z  |  E. w  e.  dom  F  z  =  ( w  +  A ) }  X.  ran  F )  e.  _V )  ->  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  e.  _V )
2922, 27, 28sylancl 667 . 2  |-  ( A  e.  CC  ->  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) }  e.  _V )
30 breq 4403 . . . . . 6  |-  ( z  =  F  ->  (
( x  -  w
) z y  <->  ( x  -  w ) F y ) )
3130anbi2d 709 . . . . 5  |-  ( z  =  F  ->  (
( x  e.  CC  /\  ( x  -  w
) z y )  <-> 
( x  e.  CC  /\  ( x  -  w
) F y ) ) )
3231opabbidv 4465 . . . 4  |-  ( z  =  F  ->  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  w
) z y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  w
) F y ) } )
33 oveq2 6296 . . . . . . 7  |-  ( w  =  A  ->  (
x  -  w )  =  ( x  -  A ) )
3433breq1d 4411 . . . . . 6  |-  ( w  =  A  ->  (
( x  -  w
) F y  <->  ( x  -  A ) F y ) )
3534anbi2d 709 . . . . 5  |-  ( w  =  A  ->  (
( x  e.  CC  /\  ( x  -  w
) F y )  <-> 
( x  e.  CC  /\  ( x  -  A
) F y ) ) )
3635opabbidv 4465 . . . 4  |-  ( w  =  A  ->  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  w
) F y ) }  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A
) F y ) } )
37 df-shft 13123 . . . 4  |-  shift  =  ( z  e.  _V ,  w  e.  CC  |->  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  w
) z y ) } )
3832, 36, 37ovmpt2g 6428 . . 3  |-  ( ( F  e.  _V  /\  A  e.  CC  /\  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) }  e.  _V )  ->  ( F 
shift  A )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
3923, 38mp3an1 1350 . 2  |-  ( ( A  e.  CC  /\  {
<. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) }  e.  _V )  ->  ( F 
shift  A )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
4029, 39mpdan 673 1  |-  ( A  e.  CC  ->  ( F  shift  A )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  A ) F y ) } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 371    = wceq 1443    e. wcel 1886   {cab 2436   E.wrex 2737   _Vcvv 3044    C_ wss 3403   class class class wbr 4401   {copab 4459    X. cxp 4831   dom cdm 4833   ran crn 4834  (class class class)co 6288   CCcc 9534    + caddc 9539    - cmin 9857    shift cshi 13122
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1668  ax-4 1681  ax-5 1757  ax-6 1804  ax-7 1850  ax-8 1888  ax-9 1895  ax-10 1914  ax-11 1919  ax-12 1932  ax-13 2090  ax-ext 2430  ax-rep 4514  ax-sep 4524  ax-nul 4533  ax-pow 4580  ax-pr 4638  ax-un 6580  ax-resscn 9593  ax-1cn 9594  ax-icn 9595  ax-addcl 9596  ax-addrcl 9597  ax-mulcl 9598  ax-mulrcl 9599  ax-mulcom 9600  ax-addass 9601  ax-mulass 9602  ax-distr 9603  ax-i2m1 9604  ax-1ne0 9605  ax-1rid 9606  ax-rnegex 9607  ax-rrecex 9608  ax-cnre 9609  ax-pre-lttri 9610  ax-pre-lttrn 9611  ax-pre-ltadd 9612
This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3or 985  df-3an 986  df-tru 1446  df-ex 1663  df-nf 1667  df-sb 1797  df-eu 2302  df-mo 2303  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2580  df-ne 2623  df-nel 2624  df-ral 2741  df-rex 2742  df-reu 2743  df-rab 2745  df-v 3046  df-sbc 3267  df-csb 3363  df-dif 3406  df-un 3408  df-in 3410  df-ss 3417  df-nul 3731  df-if 3881  df-pw 3952  df-sn 3968  df-pr 3970  df-op 3974  df-uni 4198  df-iun 4279  df-br 4402  df-opab 4461  df-mpt 4462  df-id 4748  df-po 4754  df-so 4755  df-xp 4839  df-rel 4840  df-cnv 4841  df-co 4842  df-dm 4843  df-rn 4844  df-res 4845  df-ima 4846  df-iota 5545  df-fun 5583  df-fn 5584  df-f 5585  df-f1 5586  df-fo 5587  df-f1o 5588  df-fv 5589  df-riota 6250  df-ov 6291  df-oprab 6292  df-mpt2 6293  df-er 7360  df-en 7567  df-dom 7568  df-sdom 7569  df-pnf 9674  df-mnf 9675  df-ltxr 9677  df-sub 9859  df-shft 13123
This theorem is referenced by:  shftdm  13127  shftfib  13128  shftfn  13129  2shfti  13136  shftidt2  13137
  Copyright terms: Public domain W3C validator