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

Theorem iser3shft 11897
Description: Index shift of the limit of an infinite series. (Contributed by Mario Carneiro, 6-Sep-2013.) (Revised by Jim Kingdon, 17-Oct-2022.)
Hypotheses
Ref Expression
iser3shft.ex  |-  ( ph  ->  F  e.  V )
iser3shft.m  |-  ( ph  ->  M  e.  ZZ )
iser3shft.n  |-  ( ph  ->  N  e.  ZZ )
iser3shft.fm  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
iser3shft.pl  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
Assertion
Ref Expression
iser3shft  |-  ( ph  ->  (  seq M ( 
.+  ,  F )  ~~>  A  <->  seq ( M  +  N ) (  .+  ,  ( F  shift  N ) )  ~~>  A ) )
Distinct variable groups:    x,  .+ , y    x, F, y    x, M, y    x, N, y   
x, S, y    ph, x, y
Allowed substitution hints:    A( x, y)    V( x, y)

Proof of Theorem iser3shft
StepHypRef Expression
1 iser3shft.ex . . . . 5  |-  ( ph  ->  F  e.  V )
2 iser3shft.m . . . . . 6  |-  ( ph  ->  M  e.  ZZ )
3 iser3shft.n . . . . . 6  |-  ( ph  ->  N  e.  ZZ )
42, 3zaddcld 9596 . . . . 5  |-  ( ph  ->  ( M  +  N
)  e.  ZZ )
52zcnd 9593 . . . . . . . . . 10  |-  ( ph  ->  M  e.  CC )
63zcnd 9593 . . . . . . . . . 10  |-  ( ph  ->  N  e.  CC )
75, 6pncand 8481 . . . . . . . . 9  |-  ( ph  ->  ( ( M  +  N )  -  N
)  =  M )
87fveq2d 5639 . . . . . . . 8  |-  ( ph  ->  ( ZZ>= `  ( ( M  +  N )  -  N ) )  =  ( ZZ>= `  M )
)
98eleq2d 2299 . . . . . . 7  |-  ( ph  ->  ( x  e.  (
ZZ>= `  ( ( M  +  N )  -  N ) )  <->  x  e.  ( ZZ>= `  M )
) )
109pm5.32i 454 . . . . . 6  |-  ( (
ph  /\  x  e.  ( ZZ>= `  ( ( M  +  N )  -  N ) ) )  <-> 
( ph  /\  x  e.  ( ZZ>= `  M )
) )
11 iser3shft.fm . . . . . 6  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  S
)
1210, 11sylbi 121 . . . . 5  |-  ( (
ph  /\  x  e.  ( ZZ>= `  ( ( M  +  N )  -  N ) ) )  ->  ( F `  x )  e.  S
)
13 iser3shft.pl . . . . 5  |-  ( (
ph  /\  ( x  e.  S  /\  y  e.  S ) )  -> 
( x  .+  y
)  e.  S )
141, 4, 3, 12, 13seq3shft 11389 . . . 4  |-  ( ph  ->  seq ( M  +  N ) (  .+  ,  ( F  shift  N ) )  =  (  seq ( ( M  +  N )  -  N ) (  .+  ,  F )  shift  N ) )
157seqeq1d 10705 . . . . 5  |-  ( ph  ->  seq ( ( M  +  N )  -  N ) (  .+  ,  F )  =  seq M (  .+  ,  F ) )
1615oveq1d 6028 . . . 4  |-  ( ph  ->  (  seq ( ( M  +  N )  -  N ) ( 
.+  ,  F ) 
shift  N )  =  (  seq M (  .+  ,  F )  shift  N ) )
1714, 16eqtrd 2262 . . 3  |-  ( ph  ->  seq ( M  +  N ) (  .+  ,  ( F  shift  N ) )  =  (  seq M (  .+  ,  F )  shift  N ) )
1817breq1d 4096 . 2  |-  ( ph  ->  (  seq ( M  +  N ) ( 
.+  ,  ( F 
shift  N ) )  ~~>  A  <->  (  seq M (  .+  ,  F )  shift  N )  ~~>  A ) )
19 seqex 10701 . . 3  |-  seq M
(  .+  ,  F
)  e.  _V
20 climshft 11855 . . 3  |-  ( ( N  e.  ZZ  /\  seq M (  .+  ,  F )  e.  _V )  ->  ( (  seq M (  .+  ,  F )  shift  N )  ~~>  A  <->  seq M (  .+  ,  F )  ~~>  A ) )
213, 19, 20sylancl 413 . 2  |-  ( ph  ->  ( (  seq M
(  .+  ,  F
)  shift  N )  ~~>  A  <->  seq M ( 
.+  ,  F )  ~~>  A ) )
2218, 21bitr2d 189 1  |-  ( ph  ->  (  seq M ( 
.+  ,  F )  ~~>  A  <->  seq ( M  +  N ) (  .+  ,  ( F  shift  N ) )  ~~>  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2200   _Vcvv 2800   class class class wbr 4086   ` cfv 5324  (class class class)co 6013    + caddc 8025    - cmin 8340   ZZcz 9469   ZZ>=cuz 9745    seqcseq 10699    shift cshi 11365    ~~> cli 11829
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4202  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-iinf 4684  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-ilim 4464  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-recs 6466  df-frec 6552  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470  df-uz 9746  df-fz 10234  df-seqfrec 10700  df-shft 11366  df-clim 11830
This theorem is referenced by:  isumshft  12041
  Copyright terms: Public domain W3C validator