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

Theorem 2shfti 11596
Description: Composite shift operations. (Contributed by NM, 19-Aug-2005.) (Revised by Mario Carneiro, 5-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1  |-  F  e. 
_V
Assertion
Ref Expression
2shfti  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( F  shift  A )  shift  B )  =  ( F  shift  ( A  +  B ) ) )

Proof of Theorem 2shfti
Dummy variables  x  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 shftfval.1 . . . . . . . . 9  |-  F  e. 
_V
21shftfval 11586 . . . . . . . 8  |-  ( A  e.  CC  ->  ( F  shift  A )  =  { <. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A ) F w ) } )
32breqd 4141 . . . . . . 7  |-  ( A  e.  CC  ->  (
( x  -  B
) ( F  shift  A ) y  <->  ( x  -  B ) { <. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A
) F w ) } y ) )
43ad2antrr 492 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( ( x  -  B ) ( F  shift  A )
y  <->  ( x  -  B ) { <. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A
) F w ) } y ) )
5 simpr 110 . . . . . . . 8  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  x  e.  CC )
6 simplr 533 . . . . . . . 8  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  B  e.  CC )
75, 6subcld 8637 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( x  -  B )  e.  CC )
8 vex 2824 . . . . . . 7  |-  y  e. 
_V
9 eleq1 2301 . . . . . . . . 9  |-  ( z  =  ( x  -  B )  ->  (
z  e.  CC  <->  ( x  -  B )  e.  CC ) )
10 oveq1 6092 . . . . . . . . . 10  |-  ( z  =  ( x  -  B )  ->  (
z  -  A )  =  ( ( x  -  B )  -  A ) )
1110breq1d 4140 . . . . . . . . 9  |-  ( z  =  ( x  -  B )  ->  (
( z  -  A
) F w  <->  ( (
x  -  B )  -  A ) F w ) )
129, 11anbi12d 477 . . . . . . . 8  |-  ( z  =  ( x  -  B )  ->  (
( z  e.  CC  /\  ( z  -  A
) F w )  <-> 
( ( x  -  B )  e.  CC  /\  ( ( x  -  B )  -  A
) F w ) ) )
13 breq2 4134 . . . . . . . . 9  |-  ( w  =  y  ->  (
( ( x  -  B )  -  A
) F w  <->  ( (
x  -  B )  -  A ) F y ) )
1413anbi2d 468 . . . . . . . 8  |-  ( w  =  y  ->  (
( ( x  -  B )  e.  CC  /\  ( ( x  -  B )  -  A
) F w )  <-> 
( ( x  -  B )  e.  CC  /\  ( ( x  -  B )  -  A
) F y ) ) )
15 eqid 2238 . . . . . . . 8  |-  { <. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A
) F w ) }  =  { <. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A
) F w ) }
1612, 14, 15brabg 4411 . . . . . . 7  |-  ( ( ( x  -  B
)  e.  CC  /\  y  e.  _V )  ->  ( ( x  -  B ) { <. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A
) F w ) } y  <->  ( (
x  -  B )  e.  CC  /\  (
( x  -  B
)  -  A ) F y ) ) )
177, 8, 16sylancl 417 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( ( x  -  B ) {
<. z ,  w >.  |  ( z  e.  CC  /\  ( z  -  A
) F w ) } y  <->  ( (
x  -  B )  e.  CC  /\  (
( x  -  B
)  -  A ) F y ) ) )
184, 17bitrd 188 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( ( x  -  B ) ( F  shift  A )
y  <->  ( ( x  -  B )  e.  CC  /\  ( ( x  -  B )  -  A ) F y ) ) )
19 subcl 8525 . . . . . . . 8  |-  ( ( x  e.  CC  /\  B  e.  CC )  ->  ( x  -  B
)  e.  CC )
2019biantrurd 305 . . . . . . 7  |-  ( ( x  e.  CC  /\  B  e.  CC )  ->  ( ( ( x  -  B )  -  A ) F y  <-> 
( ( x  -  B )  e.  CC  /\  ( ( x  -  B )  -  A
) F y ) ) )
2120ancoms 268 . . . . . 6  |-  ( ( B  e.  CC  /\  x  e.  CC )  ->  ( ( ( x  -  B )  -  A ) F y  <-> 
( ( x  -  B )  e.  CC  /\  ( ( x  -  B )  -  A
) F y ) ) )
2221adantll 480 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( ( ( x  -  B )  -  A ) F y  <->  ( ( x  -  B )  e.  CC  /\  ( ( x  -  B )  -  A ) F y ) ) )
23 sub32 8560 . . . . . . . . 9  |-  ( ( x  e.  CC  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( x  -  A
)  -  B )  =  ( ( x  -  B )  -  A ) )
24 subsub4 8559 . . . . . . . . 9  |-  ( ( x  e.  CC  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( x  -  A
)  -  B )  =  ( x  -  ( A  +  B
) ) )
2523, 24eqtr3d 2273 . . . . . . . 8  |-  ( ( x  e.  CC  /\  A  e.  CC  /\  B  e.  CC )  ->  (
( x  -  B
)  -  A )  =  ( x  -  ( A  +  B
) ) )
26253expb 1235 . . . . . . 7  |-  ( ( x  e.  CC  /\  ( A  e.  CC  /\  B  e.  CC ) )  ->  ( (
x  -  B )  -  A )  =  ( x  -  ( A  +  B )
) )
2726ancoms 268 . . . . . 6  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( ( x  -  B )  -  A )  =  ( x  -  ( A  +  B ) ) )
2827breq1d 4140 . . . . 5  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( ( ( x  -  B )  -  A ) F y  <->  ( x  -  ( A  +  B
) ) F y ) )
2918, 22, 283bitr2d 216 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  x  e.  CC )  ->  ( ( x  -  B ) ( F  shift  A )
y  <->  ( x  -  ( A  +  B
) ) F y ) )
3029pm5.32da 456 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( x  e.  CC  /\  ( x  -  B ) ( F  shift  A )
y )  <->  ( x  e.  CC  /\  ( x  -  ( A  +  B ) ) F y ) ) )
3130opabbidv 4197 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  B ) ( F  shift  A )
y ) }  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  ( A  +  B ) ) F y ) } )
32 ovshftex 11584 . . . . 5  |-  ( ( F  e.  _V  /\  A  e.  CC )  ->  ( F  shift  A )  e.  _V )
331, 32mpan 428 . . . 4  |-  ( A  e.  CC  ->  ( F  shift  A )  e. 
_V )
34 shftfvalg 11583 . . . 4  |-  ( ( B  e.  CC  /\  ( F  shift  A )  e.  _V )  -> 
( ( F  shift  A )  shift  B )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  B ) ( F  shift  A )
y ) } )
3533, 34sylan2 286 . . 3  |-  ( ( B  e.  CC  /\  A  e.  CC )  ->  ( ( F  shift  A )  shift  B )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  B ) ( F  shift  A )
y ) } )
3635ancoms 268 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( F  shift  A )  shift  B )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  B ) ( F  shift  A )
y ) } )
37 addcl 8304 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  +  B
)  e.  CC )
381shftfval 11586 . . 3  |-  ( ( A  +  B )  e.  CC  ->  ( F  shift  ( A  +  B ) )  =  { <. x ,  y
>.  |  ( x  e.  CC  /\  ( x  -  ( A  +  B ) ) F y ) } )
3937, 38syl 14 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( F  shift  ( A  +  B ) )  =  { <. x ,  y >.  |  ( x  e.  CC  /\  ( x  -  ( A  +  B )
) F y ) } )
4031, 36, 393eqtr4d 2281 1  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( F  shift  A )  shift  B )  =  ( F  shift  ( A  +  B ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    = wceq 1402    e. wcel 2209   _Vcvv 2821   class class class wbr 4130   {copab 4191  (class class class)co 6085   CCcc 8177    + caddc 8182    - cmin 8497    shift cshi 11579
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-shft 11580
This theorem is used by:  shftcan1  11599
  Copyright terms: Public domain W3C validator