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

Theorem sumrbdc 11561
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 10558 . . . 4  |-  seq M
(  +  ,  F
)  e.  _V
4 climres 11485 . . . 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 11559 . . . . 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 4044 . . 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 11559 . . . . 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 4044 . . 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 10558 . . . 4  |-  seq N
(  +  ,  F
)  e.  _V
28 climres 11485 . . . 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 9640 . . 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 799 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 709  DECID wdc 835    = wceq 1364    e. wcel 2167   _Vcvv 2763    C_ wss 3157   ifcif 3562   class class class wbr 4034    |-> cmpt 4095    |` cres 4666   ` cfv 5259   CCcc 7894   0cc0 7896    + caddc 7899   ZZcz 9343   ZZ>=cuz 9618    seqcseq 10556    ~~> cli 11460
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-apti 8011  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101  df-fzo 10235  df-seqfrec 10557  df-clim 11461
This theorem is referenced by:  summodc  11565  zsumdc  11566
  Copyright terms: Public domain W3C validator