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

Theorem shftval2 11252
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 8306 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  -  B
)  e.  CC )
213adant3 1020 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  -  B )  e.  CC )
3 addcl 8085 . . . 4  |-  ( ( A  e.  CC  /\  C  e.  CC )  ->  ( A  +  C
)  e.  CC )
433adant2 1019 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( A  +  C )  e.  CC )
5 shftfval.1 . . . 4  |-  F  e. 
_V
65shftval 11251 . . 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 8348 . . . . 5  |-  ( ( A  e.  CC  /\  C  e.  CC  /\  B  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( C  +  B ) )
983com23 1212 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( C  +  B ) )
10 addcom 8244 . . . . 5  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( B  +  C
)  =  ( C  +  B ) )
11103adant1 1018 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( B  +  C )  =  ( C  +  B ) )
129, 11eqtr4d 2243 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  (
( A  +  C
)  -  ( A  -  B ) )  =  ( B  +  C ) )
1312fveq2d 5603 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC  /\  C  e.  CC )  ->  ( F `  ( ( A  +  C )  -  ( A  -  B ) ) )  =  ( F `  ( B  +  C
) ) )
147, 13eqtrd 2240 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 981    = wceq 1373    e. wcel 2178   _Vcvv 2776   ` cfv 5290  (class class class)co 5967   CCcc 7958    + caddc 7963    - cmin 8278    shift cshi 11240
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-resscn 8052  ax-1cn 8053  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-distr 8064  ax-i2m1 8065  ax-0id 8068  ax-rnegex 8069  ax-cnre 8071
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-sub 8280  df-shft 11241
This theorem is referenced by:  shftval3  11253
  Copyright terms: Public domain W3C validator