Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > isumsup2 | Structured version Visualization version GIF version |
Description: An infinite sum of nonnegative terms is equal to the supremum of the partial sums. (Contributed by Mario Carneiro, 12-Jun-2014.) |
Ref | Expression |
---|---|
isumsup.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
isumsup.2 | ⊢ 𝐺 = seq𝑀( + , 𝐹) |
isumsup.3 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
isumsup.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) |
isumsup.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ) |
isumsup.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ 𝐴) |
isumsup.7 | ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐺‘𝑗) ≤ 𝑥) |
Ref | Expression |
---|---|
isumsup2 | ⊢ (𝜑 → 𝐺 ⇝ sup(ran 𝐺, ℝ, < )) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isumsup.1 | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
2 | isumsup.3 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
3 | isumsup.4 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
4 | isumsup.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ) | |
5 | 3, 4 | eqeltrd 2839 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ) |
6 | 1, 2, 5 | serfre 13680 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℝ) |
7 | isumsup.2 | . . . 4 ⊢ 𝐺 = seq𝑀( + , 𝐹) | |
8 | 7 | feq1i 6575 | . . 3 ⊢ (𝐺:𝑍⟶ℝ ↔ seq𝑀( + , 𝐹):𝑍⟶ℝ) |
9 | 6, 8 | sylibr 233 | . 2 ⊢ (𝜑 → 𝐺:𝑍⟶ℝ) |
10 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑍) | |
11 | 10, 1 | eleqtrdi 2849 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (ℤ≥‘𝑀)) |
12 | eluzelz 12521 | . . . . 5 ⊢ (𝑗 ∈ (ℤ≥‘𝑀) → 𝑗 ∈ ℤ) | |
13 | uzid 12526 | . . . . 5 ⊢ (𝑗 ∈ ℤ → 𝑗 ∈ (ℤ≥‘𝑗)) | |
14 | peano2uz 12570 | . . . . 5 ⊢ (𝑗 ∈ (ℤ≥‘𝑗) → (𝑗 + 1) ∈ (ℤ≥‘𝑗)) | |
15 | 11, 12, 13, 14 | 4syl 19 | . . . 4 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝑗 + 1) ∈ (ℤ≥‘𝑗)) |
16 | simpl 482 | . . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝜑) | |
17 | elfzuz 13181 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...(𝑗 + 1)) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
18 | 17, 1 | eleqtrrdi 2850 | . . . . 5 ⊢ (𝑘 ∈ (𝑀...(𝑗 + 1)) → 𝑘 ∈ 𝑍) |
19 | 16, 18, 5 | syl2an 595 | . . . 4 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...(𝑗 + 1))) → (𝐹‘𝑘) ∈ ℝ) |
20 | 1 | peano2uzs 12571 | . . . . . . 7 ⊢ (𝑗 ∈ 𝑍 → (𝑗 + 1) ∈ 𝑍) |
21 | 20 | adantl 481 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝑗 + 1) ∈ 𝑍) |
22 | elfzuz 13181 | . . . . . 6 ⊢ (𝑘 ∈ ((𝑗 + 1)...(𝑗 + 1)) → 𝑘 ∈ (ℤ≥‘(𝑗 + 1))) | |
23 | 1 | uztrn2 12530 | . . . . . 6 ⊢ (((𝑗 + 1) ∈ 𝑍 ∧ 𝑘 ∈ (ℤ≥‘(𝑗 + 1))) → 𝑘 ∈ 𝑍) |
24 | 21, 22, 23 | syl2an 595 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ ((𝑗 + 1)...(𝑗 + 1))) → 𝑘 ∈ 𝑍) |
25 | isumsup.6 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ 𝐴) | |
26 | 25, 3 | breqtrrd 5098 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ (𝐹‘𝑘)) |
27 | 26 | adantlr 711 | . . . . 5 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ 𝑍) → 0 ≤ (𝐹‘𝑘)) |
28 | 24, 27 | syldan 590 | . . . 4 ⊢ (((𝜑 ∧ 𝑗 ∈ 𝑍) ∧ 𝑘 ∈ ((𝑗 + 1)...(𝑗 + 1))) → 0 ≤ (𝐹‘𝑘)) |
29 | 11, 15, 19, 28 | sermono 13683 | . . 3 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑗) ≤ (seq𝑀( + , 𝐹)‘(𝑗 + 1))) |
30 | 7 | fveq1i 6757 | . . 3 ⊢ (𝐺‘𝑗) = (seq𝑀( + , 𝐹)‘𝑗) |
31 | 7 | fveq1i 6757 | . . 3 ⊢ (𝐺‘(𝑗 + 1)) = (seq𝑀( + , 𝐹)‘(𝑗 + 1)) |
32 | 29, 30, 31 | 3brtr4g 5104 | . 2 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝐺‘𝑗) ≤ (𝐺‘(𝑗 + 1))) |
33 | isumsup.7 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑗 ∈ 𝑍 (𝐺‘𝑗) ≤ 𝑥) | |
34 | 1, 2, 9, 32, 33 | climsup 15309 | 1 ⊢ (𝜑 → 𝐺 ⇝ sup(ran 𝐺, ℝ, < )) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ∃wrex 3064 class class class wbr 5070 ran crn 5581 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 supcsup 9129 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 < clt 10940 ≤ cle 10941 ℤcz 12249 ℤ≥cuz 12511 ...cfz 13168 seqcseq 13649 ⇝ cli 15121 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fz 13169 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-clim 15125 |
This theorem is referenced by: isumsup 15487 ovoliunlem1 24571 ioombl1lem4 24630 uniioombllem2 24652 uniioombllem6 24657 sge0isum 43855 |
Copyright terms: Public domain | W3C validator |