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

Theorem iser3shft 11628
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 9498 . . . . 5  |-  ( ph  ->  ( M  +  N
)  e.  ZZ )
52zcnd 9495 . . . . . . . . . 10  |-  ( ph  ->  M  e.  CC )
63zcnd 9495 . . . . . . . . . 10  |-  ( ph  ->  N  e.  CC )
75, 6pncand 8383 . . . . . . . . 9  |-  ( ph  ->  ( ( M  +  N )  -  N
)  =  M )
87fveq2d 5579 . . . . . . . 8  |-  ( ph  ->  ( ZZ>= `  ( ( M  +  N )  -  N ) )  =  ( ZZ>= `  M )
)
98eleq2d 2274 . . . . . . 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 11120 . . . 4  |-  ( ph  ->  seq ( M  +  N ) (  .+  ,  ( F  shift  N ) )  =  (  seq ( ( M  +  N )  -  N ) (  .+  ,  F )  shift  N ) )
157seqeq1d 10596 . . . . 5  |-  ( ph  ->  seq ( ( M  +  N )  -  N ) (  .+  ,  F )  =  seq M (  .+  ,  F ) )
1615oveq1d 5958 . . . 4  |-  ( ph  ->  (  seq ( ( M  +  N )  -  N ) ( 
.+  ,  F ) 
shift  N )  =  (  seq M (  .+  ,  F )  shift  N ) )
1714, 16eqtrd 2237 . . 3  |-  ( ph  ->  seq ( M  +  N ) (  .+  ,  ( F  shift  N ) )  =  (  seq M (  .+  ,  F )  shift  N ) )
1817breq1d 4053 . 2  |-  ( ph  ->  (  seq ( M  +  N ) ( 
.+  ,  ( F 
shift  N ) )  ~~>  A  <->  (  seq M (  .+  ,  F )  shift  N )  ~~>  A ) )
19 seqex 10592 . . 3  |-  seq M
(  .+  ,  F
)  e.  _V
20 climshft 11586 . . 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 2175   _Vcvv 2771   class class class wbr 4043   ` cfv 5270  (class class class)co 5943    + caddc 7927    - cmin 8242   ZZcz 9371   ZZ>=cuz 9647    seqcseq 10590    shift cshi 11096    ~~> cli 11560
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-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-iinf 4635  ax-cnex 8015  ax-resscn 8016  ax-1cn 8017  ax-1re 8018  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-0lt1 8030  ax-0id 8032  ax-rnegex 8033  ax-cnre 8035  ax-pre-ltirr 8036  ax-pre-ltwlin 8037  ax-pre-lttrn 8038  ax-pre-apti 8039  ax-pre-ltadd 8040
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  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-nel 2471  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-nul 3460  df-if 3571  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-tr 4142  df-id 4339  df-iord 4412  df-on 4414  df-ilim 4415  df-suc 4417  df-iom 4638  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-1st 6225  df-2nd 6226  df-recs 6390  df-frec 6476  df-pnf 8108  df-mnf 8109  df-xr 8110  df-ltxr 8111  df-le 8112  df-sub 8244  df-neg 8245  df-inn 9036  df-n0 9295  df-z 9372  df-uz 9648  df-fz 10130  df-seqfrec 10591  df-shft 11097  df-clim 11561
This theorem is referenced by:  isumshft  11772
  Copyright terms: Public domain W3C validator