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

Theorem shftval2 11613
Description: Value of a sequence shifted by  A  -  B. (Contributed by NM, 20-Jul-2005.) (Revised by Mario Carneiro, 5-Nov-2013.)
Hypothesis
Ref Expression
shftfval.1  |-  F  e. 
_V
Assertion
Ref Expression
shftval2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( F  shift  ( A  -  B ) ) `
 ( A  +  C ) )  =  ( F `  ( B  +  C )
) )

Proof of Theorem shftval2
StepHypRef Expression
1 subcl 8532 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  -  B
)  e.  CC )
213adant3 1048 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  -  B )  e.  CC )
3 addcl 8310 . . . 4  |-  ( ( A  e.  CC  /\  C  e.  CC )  ->  ( A  +  C
)  e.  CC )
433adant2 1047 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  C )  e.  CC )
5 shftfval.1 . . . 4  |-  F  e. 
_V
65shftval 11612 . . 3  |-  ( ( ( A  -  B
)  e.  CC  /\  ( A  +  C
)  e.  CC )  ->  ( ( F 
shift  ( A  -  B
) ) `  ( A  +  C )
)  =  ( F `
 ( ( A  +  C )  -  ( A  -  B
) ) ) )
72, 4, 6syl2anc 415 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( F  shift  ( A  -  B ) ) `
 ( A  +  C ) )  =  ( F `  (
( A  +  C
)  -  ( A  -  B ) ) ) )
8 pnncan 8574 . . . . 5  |-  ( ( A  e.  CC  /\  C  e.  CC  /\  B  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( C  +  B ) )
983com23 1240 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( C  +  B ) )
10 addcom 8470 . . . . 5  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  +  C
)  =  ( C  +  B ) )
11103adant1 1046 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( B  +  C )  =  ( C  +  B ) )
129, 11eqtr4d 2274 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( B  +  C ) )
1312fveq2d 5702 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( F `  ( ( A  +  C )  -  ( A  -  B ) ) )  =  ( F `  ( B  +  C
) ) )
147, 13eqtrd 2271 1  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( F  shift  ( A  -  B ) ) `
 ( A  +  C ) )  =  ( F `  ( B  +  C )
) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ w3a 1009    = wceq 1402    e. wcel 2209   _Vcvv 2821   ` cfv 5380  (class class class)co 6088   CCcc 8183    + caddc 8188    - cmin 8504    shift cshi 11601
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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-resscn 8277  ax-1cn 8278  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-sub 8506  df-shft 11602
This theorem is used by:  shftval3  11614
  Copyright terms: Public domain W3C validator