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

Theorem sumrbdc 11389
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 276 . . . 4  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  N  e.  ZZ )
3 seqex 10449 . . . 4  |-  seq M
(  +  ,  F
)  e.  _V
4 climres 11313 . . . 4  |-  ( ( N  e.  ZZ  /\  seq M (  +  ,  F )  e.  _V )  ->  ( (  seq M (  +  ,  F )  |`  ( ZZ>=
`  N ) )  ~~>  C  <->  seq M (  +  ,  F )  ~~>  C ) )
52, 3, 4sylancl 413 . . 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 477 . . . . . 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 477 . . . . . 6  |-  ( ( ( ph  /\  N  e.  ( ZZ>= `  M )
)  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
12 simpr 110 . . . . . 6  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  N  e.  ( ZZ>= `  M )
)
137, 9, 11, 12sumrbdclem 11387 . . . . 5  |-  ( ( ( ph  /\  N  e.  ( ZZ>= `  M )
)  /\  A  C_  ( ZZ>=
`  N ) )  ->  (  seq M
(  +  ,  F
)  |`  ( ZZ>= `  N
) )  =  seq N (  +  ,  F ) )
146, 13mpidan 423 . . . 4  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  (  seq M (  +  ,  F )  |`  ( ZZ>=
`  N ) )  =  seq N (  +  ,  F ) )
1514breq1d 4015 . . 3  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  ( (  seq M (  +  ,  F )  |`  ( ZZ>=
`  N ) )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
165, 15bitr3d 190 . 2  |-  ( (
ph  /\  N  e.  ( ZZ>= `  M )
)  ->  (  seq M (  +  ,  F )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
17 isumrb.6 . . . . 5  |-  ( ph  ->  A  C_  ( ZZ>= `  M ) )
188adantlr 477 . . . . . 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 477 . . . . . 6  |-  ( ( ( ph  /\  M  e.  ( ZZ>= `  N )
)  /\  k  e.  ( ZZ>= `  N )
)  -> DECID  k  e.  A
)
21 simpr 110 . . . . . 6  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  M  e.  ( ZZ>= `  N )
)
227, 18, 20, 21sumrbdclem 11387 . . . . 5  |-  ( ( ( ph  /\  M  e.  ( ZZ>= `  N )
)  /\  A  C_  ( ZZ>=
`  M ) )  ->  (  seq N
(  +  ,  F
)  |`  ( ZZ>= `  M
) )  =  seq M (  +  ,  F ) )
2317, 22mpidan 423 . . . 4  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  (  seq N (  +  ,  F )  |`  ( ZZ>=
`  M ) )  =  seq M (  +  ,  F ) )
2423breq1d 4015 . . 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 276 . . . 4  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  M  e.  ZZ )
27 seqex 10449 . . . 4  |-  seq N
(  +  ,  F
)  e.  _V
28 climres 11313 . . . 4  |-  ( ( M  e.  ZZ  /\  seq N (  +  ,  F )  e.  _V )  ->  ( (  seq N (  +  ,  F )  |`  ( ZZ>=
`  M ) )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
2926, 27, 28sylancl 413 . . 3  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  ( (  seq N (  +  ,  F )  |`  ( ZZ>=
`  M ) )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
3024, 29bitr3d 190 . 2  |-  ( (
ph  /\  M  e.  ( ZZ>= `  N )
)  ->  (  seq M (  +  ,  F )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
31 uztric 9551 . . 3  |-  ( ( M  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  e.  (
ZZ>= `  M )  \/  M  e.  ( ZZ>= `  N ) ) )
3225, 1, 31syl2anc 411 . 2  |-  ( ph  ->  ( N  e.  (
ZZ>= `  M )  \/  M  e.  ( ZZ>= `  N ) ) )
3316, 30, 32mpjaodan 798 1  |-  ( ph  ->  (  seq M (  +  ,  F )  ~~>  C  <->  seq N (  +  ,  F )  ~~>  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708  DECID wdc 834    = wceq 1353    e. wcel 2148   _Vcvv 2739    C_ wss 3131   ifcif 3536   class class class wbr 4005    |-> cmpt 4066    |` cres 4630   ` cfv 5218   CCcc 7811   0cc0 7813    + caddc 7816   ZZcz 9255   ZZ>=cuz 9530    seqcseq 10447    ~~> cli 11288
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-if 3537  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-ilim 4371  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-recs 6308  df-frec 6394  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-inn 8922  df-n0 9179  df-z 9256  df-uz 9531  df-fz 10011  df-fzo 10145  df-seqfrec 10448  df-clim 11289
This theorem is referenced by:  summodc  11393  zsumdc  11394
  Copyright terms: Public domain W3C validator