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

Theorem shftval2 11108
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 8270 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  -  B
)  e.  CC )
213adant3 1019 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  -  B )  e.  CC )
3 addcl 8049 . . . 4  |-  ( ( A  e.  CC  /\  C  e.  CC )  ->  ( A  +  C
)  e.  CC )
433adant2 1018 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  C )  e.  CC )
5 shftfval.1 . . . 4  |-  F  e. 
_V
65shftval 11107 . . 3  |-  ( ( ( A  -  B
)  e.  CC  /\  ( A  +  C
)  e.  CC )  ->  ( ( F 
shift  ( A  -  B
) ) `  ( A  +  C )
)  =  ( F `
 ( ( A  +  C )  -  ( A  -  B
) ) ) )
72, 4, 6syl2anc 411 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( F  shift  ( A  -  B ) ) `
 ( A  +  C ) )  =  ( F `  (
( A  +  C
)  -  ( A  -  B ) ) ) )
8 pnncan 8312 . . . . 5  |-  ( ( A  e.  CC  /\  C  e.  CC  /\  B  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( C  +  B ) )
983com23 1211 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( C  +  B ) )
10 addcom 8208 . . . . 5  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  +  C
)  =  ( C  +  B ) )
11103adant1 1017 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( B  +  C )  =  ( C  +  B ) )
129, 11eqtr4d 2240 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( B  +  C ) )
1312fveq2d 5579 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( F `  ( ( A  +  C )  -  ( A  -  B ) ) )  =  ( F `  ( B  +  C
) ) )
147, 13eqtrd 2237 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
Syntax hints:    -> wi 4    /\ w3a 980    = wceq 1372    e. wcel 2175   _Vcvv 2771   ` cfv 5270  (class class class)co 5943   CCcc 7922    + caddc 7927    - cmin 8242    shift cshi 11096
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-in1 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-resscn 8016  ax-1cn 8017  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-addcom 8024  ax-addass 8026  ax-distr 8028  ax-i2m1 8029  ax-0id 8032  ax-rnegex 8033  ax-cnre 8035
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-sub 8244  df-shft 11097
This theorem is referenced by:  shftval3  11109
  Copyright terms: Public domain W3C validator