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

Theorem fsum3cvg2 12139
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 2392 . . . 4  |-  F/_ m if ( k  e.  A ,  B ,  0 )
2 nfv 1581 . . . . 5  |-  F/ k  m  e.  A
3 nfcsb1v 3180 . . . . 5  |-  F/_ k [_ m  /  k ]_ B
4 nfcv 2392 . . . . 5  |-  F/_ k
0
52, 3, 4nfif 3666 . . . 4  |-  F/_ k if ( m  e.  A ,  [_ m  /  k ]_ B ,  0 )
6 eleq1w 2299 . . . . 5  |-  ( k  =  m  ->  (
k  e.  A  <->  m  e.  A ) )
7 csbeq1a 3156 . . . . 5  |-  ( k  =  m  ->  B  =  [_ m  /  k ]_ B )
86, 7ifbieq1d 3660 . . . 4  |-  ( k  =  m  ->  if ( k  e.  A ,  B ,  0 )  =  if ( m  e.  A ,  [_ m  /  k ]_ B ,  0 ) )
91, 5, 8cbvmpt 4221 . . 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 2623 . . . 4  |-  ( ph  ->  A. k  e.  A  B  e.  CC )
123nfel1 2403 . . . . 5  |-  F/ k
[_ m  /  k ]_ B  e.  CC
137eleq1d 2307 . . . . 5  |-  ( k  =  m  ->  ( B  e.  CC  <->  [_ m  / 
k ]_ B  e.  CC ) )
1412, 13rspc 2923 . . . 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 850 . . . 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 2623 . . . . 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 2934 . . 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 12123 . 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 9905 . . . 4  |-  ( N  e.  ( ZZ>= `  M
)  ->  M  e.  ZZ )
2622, 25syl 14 . . 3  |-  ( ph  ->  M  e.  ZZ )
27 fveq2 5690 . . . . 5  |-  ( k  =  x  ->  ( F `  k )  =  ( F `  x ) )
2827eleq1d 2307 . . . 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 481 . . . . . . . 8  |-  ( ( ( ph  /\  k  e.  ( ZZ>= `  M )
)  /\  k  e.  A )  ->  B  e.  CC )
31 0cnd 8309 . . . . . . . 8  |-  ( ( ( ph  /\  k  e.  ( ZZ>= `  M )
)  /\  -.  k  e.  A )  ->  0  e.  CC )
3230, 31, 17ifcldadc 3667 . . . . . . 7  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  if (
k  e.  A ,  B ,  0 )  e.  CC )
3329, 32eqeltrd 2315 . . . . . 6  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  e.  CC )
3433ralrimiva 2623 . . . . 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 2934 . . 3  |-  ( (
ph  /\  x  e.  ( ZZ>= `  M )
)  ->  ( F `  x )  e.  CC )
38 eluzelz 9910 . . . . . . 7  |-  ( k  e.  ( ZZ>= `  M
)  ->  k  e.  ZZ )
39 eqid 2238 . . . . . . . 8  |-  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) )  =  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) )
4039fvmpt2 5783 . . . . . . 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 602 . . . . . 6  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( (
k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k )  =  if ( k  e.  A ,  B ,  0 ) )
4229, 41eqtr4d 2274 . . . . 5  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k ) )
4342ralrimiva 2623 . . . 4  |-  ( ph  ->  A. k  e.  (
ZZ>= `  M ) ( F `  k )  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  k ) )
44 nffvmpt1 5701 . . . . . 6  |-  F/_ k
( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `
 n )
4544nfeq2 2404 . . . . 5  |-  F/ k ( F `  n
)  =  ( ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) `  n )
46 fveq2 5690 . . . . . 6  |-  ( k  =  n  ->  ( F `  k )  =  ( F `  n ) )
47 fveq2 5690 . . . . . 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 2253 . . . . 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 2923 . . . 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 8294 . . . 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 10895 . 2  |-  ( ph  ->  seq M (  +  ,  F )  =  seq M (  +  ,  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) ) )
5453fveq1d 5692 . 2  |-  ( ph  ->  (  seq M (  +  ,  F ) `
 N )  =  (  seq M (  +  ,  ( k  e.  ZZ  |->  if ( k  e.  A ,  B ,  0 ) ) ) `  N
) )
5524, 53, 543brtr4d 4157 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 846    = wceq 1402    e. wcel 2209   A.wral 2528   [_csb 3147    C_ wss 3220   ifcif 3635   class class class wbr 4125    |-> cmpt 4187   ` cfv 5372  (class class class)co 6075   CCcc 8167   0cc0 8169    + caddc 8172   ZZcz 9623   ZZ>=cuz 9900   ...cfz 10390    seqcseq 10862    ~~> cli 12022
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-apti 8284  ax-pre-ltadd 8285  ax-pre-mulgt0 8286  ax-pre-mulext 8287
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-ilim 4509  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-frec 6652  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-reap 8893  df-ap 8900  df-div 8993  df-inn 9284  df-2 9342  df-n0 9543  df-z 9624  df-uz 9901  df-rp 10034  df-fz 10391  df-seqfrec 10863  df-exp 10954  df-cj 11585  df-rsqrt 11742  df-abs 11743  df-clim 12023
This theorem is referenced by:  fsumsersdc  12140  fsum3cvg3  12141  ef0lem  12405
  Copyright terms: Public domain W3C validator