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

Theorem sumrbdc 11320
Description: Rebase the starting point of a sum. (Contributed by Mario Carneiro, 14-Jul-2013.) (Revised by Jim Kingdon, 9-Apr-2023.)
Hypotheses
Ref Expression
isummo.1  |-  F  =  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) )
isummo.2  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
isumrb.4  |-  ( ph  ->  M  e.  ZZ )
isumrb.5  |-  ( ph  ->  N  e.  ZZ )
isumrb.6  |-  ( ph  ->  A  C_  ( ZZ>= `  M ) )
isumrb.7  |-  ( ph  ->  A  C_  ( ZZ>= `  N ) )
isumrb.mdc  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
isumrb.ndc  |-  ( (
ph  /\  k  e.  ( ZZ>= `  N )
)  -> DECID  k  e.  A
)
Assertion
Ref Expression
sumrbdc  |-  ( ph  ->  (  seq M (  +  ,  F )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
Distinct variable groups:    A, k    k, N    ph, k    k, M
Allowed substitution hints:    B( k)    C( k)    F( k)

Proof of Theorem sumrbdc
StepHypRef Expression
1 isumrb.5 . . . . 5  |-  ( ph  ->  N  e.  ZZ )
21adantr 274 . . . 4  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  N  e.  ZZ )
3 seqex 10382 . . . 4  |-  seq M
(  +  ,  F
)  e.  _V
4 climres 11244 . . . 4  |-  ( ( N  e.  ZZ  /\  seq M (  +  ,  F )  e.  _V )  ->  ( (  seq M (  +  ,  F )  |`  ( ZZ>=
`  N ) )  ~~>  C  <->  seq M (  +  ,  F )  ~~>  C ) )
52, 3, 4sylancl 410 . . 3  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  ( (  seq M (  +  ,  F )  |`  ( ZZ>=
`  N ) )  ~~>  C  <->  seq M (  +  ,  F )  ~~>  C ) )
6 isumrb.7 . . . . 5  |-  ( ph  ->  A  C_  ( ZZ>= `  N ) )
7 isummo.1 . . . . . 6  |-  F  =  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) )
8 isummo.2 . . . . . . 7  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
98adantlr 469 . . . . . 6  |-  ( ( ( ph  /\  N  e.  ( ZZ>= `  M )
)  /\  k  e.  A )  ->  B  e.  CC )
10 isumrb.mdc . . . . . . 7  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
1110adantlr 469 . . . . . 6  |-  ( ( ( ph  /\  N  e.  ( ZZ>= `  M )
)  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
12 simpr 109 . . . . . 6  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  N  e.  ( ZZ>= `  M )
)
137, 9, 11, 12sumrbdclem 11318 . . . . 5  |-  ( ( ( ph  /\  N  e.  ( ZZ>= `  M )
)  /\  A  C_  ( ZZ>=
`  N ) )  ->  (  seq M
(  +  ,  F
)  |`  ( ZZ>= `  N
) )  =  seq N (  +  ,  F ) )
146, 13mpidan 420 . . . 4  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  (  seq M (  +  ,  F )  |`  ( ZZ>=
`  N ) )  =  seq N (  +  ,  F ) )
1514breq1d 3992 . . 3  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  ( (  seq M (  +  ,  F )  |`  ( ZZ>=
`  N ) )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
165, 15bitr3d 189 . 2  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  (  seq M (  +  ,  F )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
17 isumrb.6 . . . . 5  |-  ( ph  ->  A  C_  ( ZZ>= `  M ) )
188adantlr 469 . . . . . 6  |-  ( ( ( ph  /\  M  e.  ( ZZ>= `  N )
)  /\  k  e.  A )  ->  B  e.  CC )
19 isumrb.ndc . . . . . . 7  |-  ( (
ph  /\  k  e.  ( ZZ>= `  N )
)  -> DECID  k  e.  A
)
2019adantlr 469 . . . . . 6  |-  ( ( ( ph  /\  M  e.  ( ZZ>= `  N )
)  /\  k  e.  ( ZZ>= `  N )
)  -> DECID  k  e.  A
)
21 simpr 109 . . . . . 6  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  M  e.  ( ZZ>= `  N )
)
227, 18, 20, 21sumrbdclem 11318 . . . . 5  |-  ( ( ( ph  /\  M  e.  ( ZZ>= `  N )
)  /\  A  C_  ( ZZ>=
`  M ) )  ->  (  seq N
(  +  ,  F
)  |`  ( ZZ>= `  M
) )  =  seq M (  +  ,  F ) )
2317, 22mpidan 420 . . . 4  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  (  seq N (  +  ,  F )  |`  ( ZZ>=
`  M ) )  =  seq M (  +  ,  F ) )
2423breq1d 3992 . . 3  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  ( (  seq N (  +  ,  F )  |`  ( ZZ>=
`  M ) )  ~~>  C  <->  seq M (  +  ,  F )  ~~>  C ) )
25 isumrb.4 . . . . 5  |-  ( ph  ->  M  e.  ZZ )
2625adantr 274 . . . 4  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  M  e.  ZZ )
27 seqex 10382 . . . 4  |-  seq N
(  +  ,  F
)  e.  _V
28 climres 11244 . . . 4  |-  ( ( M  e.  ZZ  /\  seq N (  +  ,  F )  e.  _V )  ->  ( (  seq N (  +  ,  F )  |`  ( ZZ>=
`  M ) )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
2926, 27, 28sylancl 410 . . 3  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  ( (  seq N (  +  ,  F )  |`  ( ZZ>=
`  M ) )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
3024, 29bitr3d 189 . 2  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  (  seq M (  +  ,  F )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
31 uztric 9487 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  e.  (
ZZ>= `  M )  \/  M  e.  ( ZZ>= `  N ) ) )
3225, 1, 31syl2anc 409 . 2  |-  ( ph  ->  ( N  e.  (
ZZ>= `  M )  \/  M  e.  ( ZZ>= `  N ) ) )
3316, 30, 32mpjaodan 788 1  |-  ( ph  ->  (  seq M (  +  ,  F )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 698  DECID wdc 824    = wceq 1343    e. wcel 2136   _Vcvv 2726    C_ wss 3116   ifcif 3520   class class class wbr 3982    |-> cmpt 4043    |` cres 4606   ` cfv 5188   CCcc 7751   0cc0 7753    + caddc 7756   ZZcz 9191   ZZ>=cuz 9466    seqcseq 10380    ~~> cli 11219
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565  ax-cnex 7844  ax-resscn 7845  ax-1cn 7846  ax-1re 7847  ax-icn 7848  ax-addcl 7849  ax-addrcl 7850  ax-mulcl 7851  ax-addcom 7853  ax-addass 7855  ax-distr 7857  ax-i2m1 7858  ax-0lt1 7859  ax-0id 7861  ax-rnegex 7862  ax-cnre 7864  ax-pre-ltirr 7865  ax-pre-ltwlin 7866  ax-pre-lttrn 7867  ax-pre-apti 7868  ax-pre-ltadd 7869
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-nel 2432  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-if 3521  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-iord 4344  df-on 4346  df-ilim 4347  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-riota 5798  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-frec 6359  df-pnf 7935  df-mnf 7936  df-xr 7937  df-ltxr 7938  df-le 7939  df-sub 8071  df-neg 8072  df-inn 8858  df-n0 9115  df-z 9192  df-uz 9467  df-fz 9945  df-fzo 10078  df-seqfrec 10381  df-clim 11220
This theorem is referenced by:  summodc  11324  zsumdc  11325
  Copyright terms: Public domain W3C validator