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

Theorem fsum3cvg2 12105
Description: The sequence of partial sums of a finite sum converges to the whole sum. (Contributed by Mario Carneiro, 20-Apr-2014.) (Revised by Jim Kingdon, 2-Dec-2022.)
Hypotheses
Ref Expression
fsumsers.1  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  =  if ( k  e.  A ,  B ,  0 ) )
fsumsers.2  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
fsumsers.3  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
fsumsers.dc  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
fsumsers.4  |-  ( ph  ->  A  C_  ( M ... N ) )
Assertion
Ref Expression
fsum3cvg2  |-  ( ph  ->  seq M (  +  ,  F )  ~~>  (  seq M (  +  ,  F ) `  N
) )
Distinct variable groups:    A, k    k, F    k, M    k, N    ph, k
Allowed substitution hint:    B( k)

Proof of Theorem fsum3cvg2
Dummy variables  m  n  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfcv 2386 . . . 4  |-  F/_ m if ( k  e.  A ,  B ,  0 )
2 nfv 1577 . . . . 5  |-  F/ k  m  e.  A
3 nfcsb1v 3174 . . . . 5  |-  F/_ k [_ m  /  k ]_ B
4 nfcv 2386 . . . . 5  |-  F/_ k
0
52, 3, 4nfif 3655 . . . 4  |-  F/_ k if ( m  e.  A ,  [_ m  /  k ]_ B ,  0 )
6 eleq1w 2295 . . . . 5  |-  ( k  =  m  ->  (
k  e.  A  <->  m  e.  A ) )
7 csbeq1a 3150 . . . . 5  |-  ( k  =  m  ->  B  =  [_ m  /  k ]_ B )
86, 7ifbieq1d 3649 . . . 4  |-  ( k  =  m  ->  if ( k  e.  A ,  B ,  0 )  =  if ( m  e.  A ,  [_ m  /  k ]_ B ,  0 ) )
91, 5, 8cbvmpt 4210 . . 3  |-  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) )  =  ( m  e.  ZZ  |->  if ( m  e.  A ,  [_ m  /  k ]_ B ,  0 ) )
10 fsumsers.3 . . . . 5  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
1110ralrimiva 2617 . . . 4  |-  ( ph  ->  A. k  e.  A  B  e.  CC )
123nfel1 2397 . . . . 5  |-  F/ k
[_ m  /  k ]_ B  e.  CC
137eleq1d 2303 . . . . 5  |-  ( k  =  m  ->  ( B  e.  CC  <->  [_ m  / 
k ]_ B  e.  CC ) )
1412, 13rspc 2917 . . . 4  |-  ( m  e.  A  ->  ( A. k  e.  A  B  e.  CC  ->  [_ m  /  k ]_ B  e.  CC )
)
1511, 14mpan9 281 . . 3  |-  ( (
ph  /\  m  e.  A )  ->  [_ m  /  k ]_ B  e.  CC )
166dcbid 846 . . . 4  |-  ( k  =  m  ->  (DECID  k  e.  A  <-> DECID  m  e.  A )
)
17 fsumsers.dc . . . . . 6  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  -> DECID  k  e.  A
)
1817ralrimiva 2617 . . . . 5  |-  ( ph  ->  A. k  e.  (
ZZ>= `  M )DECID  k  e.  A )
1918adantr 276 . . . 4  |-  ( (
ph  /\  m  e.  ( ZZ>= `  M )
)  ->  A. k  e.  ( ZZ>= `  M )DECID  k  e.  A )
20 simpr 110 . . . 4  |-  ( (
ph  /\  m  e.  ( ZZ>= `  M )
)  ->  m  e.  ( ZZ>= `  M )
)
2116, 19, 20rspcdva 2928 . . 3  |-  ( (
ph  /\  m  e.  ( ZZ>= `  M )
)  -> DECID  m  e.  A
)
22 fsumsers.2 . . 3  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
23 fsumsers.4 . . 3  |-  ( ph  ->  A  C_  ( M ... N ) )
249, 15, 21, 22, 23fsum3cvg 12089 . 2  |-  ( ph  ->  seq M (  +  ,  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) )  ~~>  (  seq M
(  +  ,  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) ) `  N
) )
25 eluzel2 9876 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
2622, 25syl 14 . . 3  |-  ( ph  ->  M  e.  ZZ )
27 fveq2 5675 . . . . 5  |-  ( k  =  x  ->  ( F `  k )  =  ( F `  x ) )
2827eleq1d 2303 . . . 4  |-  ( k  =  x  ->  (
( F `  k
)  e.  CC  <->  ( F `  x )  e.  CC ) )
29 fsumsers.1 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  =  if ( k  e.  A ,  B ,  0 ) )
3010adantlr 477 . . . . . . . 8  |-  ( ( ( ph  /\  k  e.  ( ZZ>= `  M )
)  /\  k  e.  A )  ->  B  e.  CC )
31 0cnd 8283 . . . . . . . 8  |-  ( ( ( ph  /\  k  e.  ( ZZ>= `  M )
)  /\  -.  k  e.  A )  ->  0  e.  CC )
3230, 31, 17ifcldadc 3656 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  if (
k  e.  A ,  B ,  0 )  e.  CC )
3329, 32eqeltrd 2311 . . . . . 6  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  e.  CC )
3433ralrimiva 2617 . . . . 5  |-  ( ph  ->  A. k  e.  (
ZZ>= `  M ) ( F `  k )  e.  CC )
3534adantr 276 . . . 4  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  A. k  e.  ( ZZ>= `  M )
( F `  k
)  e.  CC )
36 simpr 110 . . . 4  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  x  e.  ( ZZ>= `  M )
)
3728, 35, 36rspcdva 2928 . . 3  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  CC )
38 eluzelz 9881 . . . . . . 7  |-  ( k  e.  ( ZZ>= `  M
)  ->  k  e.  ZZ )
39 eqid 2234 . . . . . . . 8  |-  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) )  =  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) )
4039fvmpt2 5766 . . . . . . 7  |-  ( ( k  e.  ZZ  /\  if ( k  e.  A ,  B ,  0 )  e.  CC )  -> 
( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `
 k )  =  if ( k  e.  A ,  B , 
0 ) )
4138, 32, 40syl2an2 598 . . . . . 6  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( (
k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k )  =  if ( k  e.  A ,  B ,  0 ) )
4229, 41eqtr4d 2270 . . . . 5  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k ) )
4342ralrimiva 2617 . . . 4  |-  ( ph  ->  A. k  e.  (
ZZ>= `  M ) ( F `  k )  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k ) )
44 nffvmpt1 5686 . . . . . 6  |-  F/_ k
( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `
 n )
4544nfeq2 2398 . . . . 5  |-  F/ k ( F `  n
)  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  n )
46 fveq2 5675 . . . . . 6  |-  ( k  =  n  ->  ( F `  k )  =  ( F `  n ) )
47 fveq2 5675 . . . . . 6  |-  ( k  =  n  ->  (
( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k )  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  n ) )
4846, 47eqeq12d 2249 . . . . 5  |-  ( k  =  n  ->  (
( F `  k
)  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k )  <-> 
( F `  n
)  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  n ) ) )
4945, 48rspc 2917 . . . 4  |-  ( n  e.  ( ZZ>= `  M
)  ->  ( A. k  e.  ( ZZ>= `  M ) ( F `
 k )  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `
 k )  -> 
( F `  n
)  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  n ) ) )
5043, 49mpan9 281 . . 3  |-  ( (
ph  /\  n  e.  ( ZZ>= `  M )
)  ->  ( F `  n )  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  n ) )
51 addcl 8268 . . . 4  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( x  +  y )  e.  CC )
5251adantl 277 . . 3  |-  ( (
ph  /\  ( x  e.  CC  /\  y  e.  CC ) )  -> 
( x  +  y )  e.  CC )
5326, 37, 50, 52seq3feq 10866 . 2  |-  ( ph  ->  seq M (  +  ,  F )  =  seq M (  +  ,  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) ) )
5453fveq1d 5677 . 2  |-  ( ph  ->  (  seq M (  +  ,  F ) `
 N )  =  (  seq M (  +  ,  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) ) `  N
) )
5524, 53, 543brtr4d 4146 1  |-  ( ph  ->  seq M (  +  ,  F )  ~~>  (  seq M (  +  ,  F ) `  N
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104  DECID wdc 842    = wceq 1398    e. wcel 2205   A.wral 2522   [_csb 3141    C_ wss 3214   ifcif 3624   class class class wbr 4114    |-> cmpt 4176   ` cfv 5357  (class class class)co 6058   CCcc 8141   0cc0 8143    + caddc 8146   ZZcz 9594   ZZ>=cuz 9871   ...cfz 10361    seqcseq 10833    ~~> cli 11988
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-n0 9514  df-z 9595  df-uz 9872  df-rp 10005  df-fz 10362  df-seqfrec 10834  df-exp 10925  df-cj 11552  df-rsqrt 11708  df-abs 11709  df-clim 11989
This theorem is referenced by:  fsumsersdc  12106  fsum3cvg3  12107  ef0lem  12371
  Copyright terms: Public domain W3C validator