MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fsumcvg3 Structured version   Visualization version   Unicode version

Theorem fsumcvg3 13872
Description: A finite sum is convergent. (Contributed by Mario Carneiro, 24-Apr-2014.)
Hypotheses
Ref Expression
fsumcvg3.1  |-  Z  =  ( ZZ>= `  M )
fsumcvg3.2  |-  ( ph  ->  M  e.  ZZ )
fsumcvg3.3  |-  ( ph  ->  A  e.  Fin )
fsumcvg3.4  |-  ( ph  ->  A  C_  Z )
fsumcvg3.5  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  =  if ( k  e.  A ,  B , 
0 ) )
fsumcvg3.6  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
Assertion
Ref Expression
fsumcvg3  |-  ( ph  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
Distinct variable groups:    A, k    k, F    k, M    ph, k
Allowed substitution hints:    B( k)    Z( k)

Proof of Theorem fsumcvg3
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 sseq1 3439 . . . 4  |-  ( A  =  (/)  ->  ( A 
C_  ( M ... n )  <->  (/)  C_  ( M ... n ) ) )
21rexbidv 2892 . . 3  |-  ( A  =  (/)  ->  ( E. n  e.  ( ZZ>= `  M ) A  C_  ( M ... n )  <->  E. n  e.  ( ZZ>=
`  M ) (/)  C_  ( M ... n
) ) )
3 fsumcvg3.4 . . . . . . 7  |-  ( ph  ->  A  C_  Z )
43adantr 472 . . . . . 6  |-  ( (
ph  /\  A  =/=  (/) )  ->  A  C_  Z
)
5 fsumcvg3.1 . . . . . 6  |-  Z  =  ( ZZ>= `  M )
64, 5syl6sseq 3464 . . . . 5  |-  ( (
ph  /\  A  =/=  (/) )  ->  A  C_  ( ZZ>=
`  M ) )
7 ltso 9732 . . . . . 6  |-  <  Or  RR
8 fsumcvg3.3 . . . . . . . 8  |-  ( ph  ->  A  e.  Fin )
98adantr 472 . . . . . . 7  |-  ( (
ph  /\  A  =/=  (/) )  ->  A  e.  Fin )
10 simpr 468 . . . . . . 7  |-  ( (
ph  /\  A  =/=  (/) )  ->  A  =/=  (/) )
11 uzssz 11202 . . . . . . . . . 10  |-  ( ZZ>= `  M )  C_  ZZ
12 zssre 10968 . . . . . . . . . 10  |-  ZZ  C_  RR
1311, 12sstri 3427 . . . . . . . . 9  |-  ( ZZ>= `  M )  C_  RR
145, 13eqsstri 3448 . . . . . . . 8  |-  Z  C_  RR
154, 14syl6ss 3430 . . . . . . 7  |-  ( (
ph  /\  A  =/=  (/) )  ->  A  C_  RR )
169, 10, 153jca 1210 . . . . . 6  |-  ( (
ph  /\  A  =/=  (/) )  ->  ( A  e.  Fin  /\  A  =/=  (/)  /\  A  C_  RR ) )
17 fisupcl 8003 . . . . . 6  |-  ( (  <  Or  RR  /\  ( A  e.  Fin  /\  A  =/=  (/)  /\  A  C_  RR ) )  ->  sup ( A ,  RR ,  <  )  e.  A
)
187, 16, 17sylancr 676 . . . . 5  |-  ( (
ph  /\  A  =/=  (/) )  ->  sup ( A ,  RR ,  <  )  e.  A )
196, 18sseldd 3419 . . . 4  |-  ( (
ph  /\  A  =/=  (/) )  ->  sup ( A ,  RR ,  <  )  e.  ( ZZ>= `  M ) )
20 fimaxre2 10574 . . . . . . . . . 10  |-  ( ( A  C_  RR  /\  A  e.  Fin )  ->  E. k  e.  RR  A. n  e.  A  n  <_  k
)
2115, 9, 20syl2anc 673 . . . . . . . . 9  |-  ( (
ph  /\  A  =/=  (/) )  ->  E. k  e.  RR  A. n  e.  A  n  <_  k
)
2215, 10, 213jca 1210 . . . . . . . 8  |-  ( (
ph  /\  A  =/=  (/) )  ->  ( A  C_  RR  /\  A  =/=  (/)  /\  E. k  e.  RR  A. n  e.  A  n  <_  k
) )
23 suprub 10592 . . . . . . . 8  |-  ( ( ( A  C_  RR  /\  A  =/=  (/)  /\  E. k  e.  RR  A. n  e.  A  n  <_  k )  /\  k  e.  A )  ->  k  <_  sup ( A ,  RR ,  <  ) )
2422, 23sylan 479 . . . . . . 7  |-  ( ( ( ph  /\  A  =/=  (/) )  /\  k  e.  A )  ->  k  <_  sup ( A ,  RR ,  <  ) )
256sselda 3418 . . . . . . . 8  |-  ( ( ( ph  /\  A  =/=  (/) )  /\  k  e.  A )  ->  k  e.  ( ZZ>= `  M )
)
2611, 19sseldi 3416 . . . . . . . . 9  |-  ( (
ph  /\  A  =/=  (/) )  ->  sup ( A ,  RR ,  <  )  e.  ZZ )
2726adantr 472 . . . . . . . 8  |-  ( ( ( ph  /\  A  =/=  (/) )  /\  k  e.  A )  ->  sup ( A ,  RR ,  <  )  e.  ZZ )
28 elfz5 11818 . . . . . . . 8  |-  ( ( k  e.  ( ZZ>= `  M )  /\  sup ( A ,  RR ,  <  )  e.  ZZ )  ->  ( k  e.  ( M ... sup ( A ,  RR ,  <  ) )  <->  k  <_  sup ( A ,  RR ,  <  ) ) )
2925, 27, 28syl2anc 673 . . . . . . 7  |-  ( ( ( ph  /\  A  =/=  (/) )  /\  k  e.  A )  ->  (
k  e.  ( M ... sup ( A ,  RR ,  <  ) )  <->  k  <_  sup ( A ,  RR ,  <  ) ) )
3024, 29mpbird 240 . . . . . 6  |-  ( ( ( ph  /\  A  =/=  (/) )  /\  k  e.  A )  ->  k  e.  ( M ... sup ( A ,  RR ,  <  ) ) )
3130ex 441 . . . . 5  |-  ( (
ph  /\  A  =/=  (/) )  ->  ( k  e.  A  ->  k  e.  ( M ... sup ( A ,  RR ,  <  ) ) ) )
3231ssrdv 3424 . . . 4  |-  ( (
ph  /\  A  =/=  (/) )  ->  A  C_  ( M ... sup ( A ,  RR ,  <  ) ) )
33 oveq2 6316 . . . . . 6  |-  ( n  =  sup ( A ,  RR ,  <  )  ->  ( M ... n )  =  ( M ... sup ( A ,  RR ,  <  ) ) )
3433sseq2d 3446 . . . . 5  |-  ( n  =  sup ( A ,  RR ,  <  )  ->  ( A  C_  ( M ... n )  <-> 
A  C_  ( M ... sup ( A ,  RR ,  <  ) ) ) )
3534rspcev 3136 . . . 4  |-  ( ( sup ( A ,  RR ,  <  )  e.  ( ZZ>= `  M )  /\  A  C_  ( M ... sup ( A ,  RR ,  <  ) ) )  ->  E. n  e.  ( ZZ>= `  M ) A  C_  ( M ... n ) )
3619, 32, 35syl2anc 673 . . 3  |-  ( (
ph  /\  A  =/=  (/) )  ->  E. n  e.  ( ZZ>= `  M ) A  C_  ( M ... n ) )
37 fsumcvg3.2 . . . . 5  |-  ( ph  ->  M  e.  ZZ )
38 uzid 11197 . . . . 5  |-  ( M  e.  ZZ  ->  M  e.  ( ZZ>= `  M )
)
3937, 38syl 17 . . . 4  |-  ( ph  ->  M  e.  ( ZZ>= `  M ) )
40 0ss 3766 . . . 4  |-  (/)  C_  ( M ... M )
41 oveq2 6316 . . . . . 6  |-  ( n  =  M  ->  ( M ... n )  =  ( M ... M
) )
4241sseq2d 3446 . . . . 5  |-  ( n  =  M  ->  ( (/)  C_  ( M ... n
)  <->  (/)  C_  ( M ... M ) ) )
4342rspcev 3136 . . . 4  |-  ( ( M  e.  ( ZZ>= `  M )  /\  (/)  C_  ( M ... M ) )  ->  E. n  e.  (
ZZ>= `  M ) (/)  C_  ( M ... n
) )
4439, 40, 43sylancl 675 . . 3  |-  ( ph  ->  E. n  e.  (
ZZ>= `  M ) (/)  C_  ( M ... n
) )
452, 36, 44pm2.61ne 2728 . 2  |-  ( ph  ->  E. n  e.  (
ZZ>= `  M ) A 
C_  ( M ... n ) )
465eleq2i 2541 . . . . . 6  |-  ( k  e.  Z  <->  k  e.  ( ZZ>= `  M )
)
47 fsumcvg3.5 . . . . . 6  |-  ( (
ph  /\  k  e.  Z )  ->  ( F `  k )  =  if ( k  e.  A ,  B , 
0 ) )
4846, 47sylan2br 484 . . . . 5  |-  ( (
ph  /\  k  e.  ( ZZ>= `  M )
)  ->  ( F `  k )  =  if ( k  e.  A ,  B ,  0 ) )
4948adantlr 729 . . . 4  |-  ( ( ( ph  /\  (
n  e.  ( ZZ>= `  M )  /\  A  C_  ( M ... n
) ) )  /\  k  e.  ( ZZ>= `  M ) )  -> 
( F `  k
)  =  if ( k  e.  A ,  B ,  0 ) )
50 simprl 772 . . . 4  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  A  C_  ( M ... n ) ) )  ->  n  e.  ( ZZ>= `  M )
)
51 fsumcvg3.6 . . . . 5  |-  ( (
ph  /\  k  e.  A )  ->  B  e.  CC )
5251adantlr 729 . . . 4  |-  ( ( ( ph  /\  (
n  e.  ( ZZ>= `  M )  /\  A  C_  ( M ... n
) ) )  /\  k  e.  A )  ->  B  e.  CC )
53 simprr 774 . . . 4  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  A  C_  ( M ... n ) ) )  ->  A  C_  ( M ... n ) )
5449, 50, 52, 53fsumcvg2 13870 . . 3  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  A  C_  ( M ... n ) ) )  ->  seq M (  +  ,  F )  ~~>  (  seq M (  +  ,  F ) `
 n ) )
55 climrel 13633 . . . 4  |-  Rel  ~~>
5655releldmi 5077 . . 3  |-  (  seq M (  +  ,  F )  ~~>  (  seq M (  +  ,  F ) `  n
)  ->  seq M (  +  ,  F )  e.  dom  ~~>  )
5754, 56syl 17 . 2  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  A  C_  ( M ... n ) ) )  ->  seq M (  +  ,  F )  e.  dom  ~~>  )
5845, 57rexlimddv 2875 1  |-  ( ph  ->  seq M (  +  ,  F )  e. 
dom 
~~>  )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 189    /\ wa 376    /\ w3a 1007    = wceq 1452    e. wcel 1904    =/= wne 2641   A.wral 2756   E.wrex 2757    C_ wss 3390   (/)c0 3722   ifcif 3872   class class class wbr 4395    Or wor 4759   dom cdm 4839   ` cfv 5589  (class class class)co 6308   Fincfn 7587   supcsup 7972   CCcc 9555   RRcr 9556   0cc0 9557    + caddc 9560    < clt 9693    <_ cle 9694   ZZcz 10961   ZZ>=cuz 11182   ...cfz 11810    seqcseq 12251    ~~> cli 13625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-8 1906  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-rep 4508  ax-sep 4518  ax-nul 4527  ax-pow 4579  ax-pr 4639  ax-un 6602  ax-inf2 8164  ax-cnex 9613  ax-resscn 9614  ax-1cn 9615  ax-icn 9616  ax-addcl 9617  ax-addrcl 9618  ax-mulcl 9619  ax-mulrcl 9620  ax-mulcom 9621  ax-addass 9622  ax-mulass 9623  ax-distr 9624  ax-i2m1 9625  ax-1ne0 9626  ax-1rid 9627  ax-rnegex 9628  ax-rrecex 9629  ax-cnre 9630  ax-pre-lttri 9631  ax-pre-lttrn 9632  ax-pre-ltadd 9633  ax-pre-mulgt0 9634  ax-pre-sup 9635
This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3or 1008  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-nel 2644  df-ral 2761  df-rex 2762  df-reu 2763  df-rmo 2764  df-rab 2765  df-v 3033  df-sbc 3256  df-csb 3350  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-pss 3406  df-nul 3723  df-if 3873  df-pw 3944  df-sn 3960  df-pr 3962  df-tp 3964  df-op 3966  df-uni 4191  df-iun 4271  df-br 4396  df-opab 4455  df-mpt 4456  df-tr 4491  df-eprel 4750  df-id 4754  df-po 4760  df-so 4761  df-fr 4798  df-we 4800  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-pred 5387  df-ord 5433  df-on 5434  df-lim 5435  df-suc 5436  df-iota 5553  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596  df-fv 5597  df-riota 6270  df-ov 6311  df-oprab 6312  df-mpt2 6313  df-om 6712  df-1st 6812  df-2nd 6813  df-wrecs 7046  df-recs 7108  df-rdg 7146  df-1o 7200  df-er 7381  df-en 7588  df-dom 7589  df-sdom 7590  df-fin 7591  df-sup 7974  df-pnf 9695  df-mnf 9696  df-xr 9697  df-ltxr 9698  df-le 9699  df-sub 9882  df-neg 9883  df-div 10292  df-nn 10632  df-2 10690  df-n0 10894  df-z 10962  df-uz 11183  df-rp 11326  df-fz 11811  df-seq 12252  df-exp 12311  df-cj 13239  df-re 13240  df-im 13241  df-sqrt 13375  df-abs 13376  df-clim 13629
This theorem is referenced by:  isumless  13980  radcnv0  23450  fsumcvg4  28830
  Copyright terms: Public domain W3C validator