![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > isumrpcl | Structured version Visualization version GIF version |
Description: The infinite sum of positive reals is positive. (Contributed by Paul Chapman, 9-Feb-2008.) (Revised by Mario Carneiro, 24-Apr-2014.) |
Ref | Expression |
---|---|
isumrpcl.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
isumrpcl.2 | ⊢ 𝑊 = (ℤ≥‘𝑁) |
isumrpcl.3 | ⊢ (𝜑 → 𝑁 ∈ 𝑍) |
isumrpcl.4 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) |
isumrpcl.5 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ+) |
isumrpcl.6 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) |
Ref | Expression |
---|---|
isumrpcl | ⊢ (𝜑 → Σ𝑘 ∈ 𝑊 𝐴 ∈ ℝ+) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isumrpcl.2 | . . 3 ⊢ 𝑊 = (ℤ≥‘𝑁) | |
2 | isumrpcl.3 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ 𝑍) | |
3 | isumrpcl.1 | . . . . 5 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
4 | 2, 3 | eleqtrdi 2848 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
5 | eluzelz 12885 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
6 | 4, 5 | syl 17 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
7 | uzss 12898 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) | |
8 | 4, 7 | syl 17 | . . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
9 | 8, 1, 3 | 3sstr4g 4040 | . . . . 5 ⊢ (𝜑 → 𝑊 ⊆ 𝑍) |
10 | 9 | sselda 3994 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝑘 ∈ 𝑍) |
11 | isumrpcl.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
12 | 10, 11 | syldan 591 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → (𝐹‘𝑘) = 𝐴) |
13 | isumrpcl.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ+) | |
14 | 13 | rpred 13074 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ) |
15 | 10, 14 | syldan 591 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝐴 ∈ ℝ) |
16 | isumrpcl.6 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
17 | 11, 13 | eqeltrd 2838 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ+) |
18 | 17 | rpcnd 13076 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
19 | 3, 2, 18 | iserex 15689 | . . . 4 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ∈ dom ⇝ ↔ seq𝑁( + , 𝐹) ∈ dom ⇝ )) |
20 | 16, 19 | mpbid 232 | . . 3 ⊢ (𝜑 → seq𝑁( + , 𝐹) ∈ dom ⇝ ) |
21 | 1, 6, 12, 15, 20 | isumrecl 15797 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑊 𝐴 ∈ ℝ) |
22 | fveq2 6906 | . . . 4 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
23 | 22 | eleq1d 2823 | . . 3 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ+ ↔ (𝐹‘𝑁) ∈ ℝ+)) |
24 | 17 | ralrimiva 3143 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℝ+) |
25 | 23, 24, 2 | rspcdva 3622 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ+) |
26 | seq1 14051 | . . . 4 ⊢ (𝑁 ∈ ℤ → (seq𝑁( + , 𝐹)‘𝑁) = (𝐹‘𝑁)) | |
27 | 6, 26 | syl 17 | . . 3 ⊢ (𝜑 → (seq𝑁( + , 𝐹)‘𝑁) = (𝐹‘𝑁)) |
28 | uzid 12890 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ (ℤ≥‘𝑁)) | |
29 | 6, 28 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑁)) |
30 | 29, 1 | eleqtrrdi 2849 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑊) |
31 | 15 | recnd 11286 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝐴 ∈ ℂ) |
32 | 1, 6, 12, 31, 20 | isumclim2 15790 | . . . 4 ⊢ (𝜑 → seq𝑁( + , 𝐹) ⇝ Σ𝑘 ∈ 𝑊 𝐴) |
33 | 9 | sseld 3993 | . . . . . . 7 ⊢ (𝜑 → (𝑚 ∈ 𝑊 → 𝑚 ∈ 𝑍)) |
34 | fveq2 6906 | . . . . . . . . 9 ⊢ (𝑘 = 𝑚 → (𝐹‘𝑘) = (𝐹‘𝑚)) | |
35 | 34 | eleq1d 2823 | . . . . . . . 8 ⊢ (𝑘 = 𝑚 → ((𝐹‘𝑘) ∈ ℝ+ ↔ (𝐹‘𝑚) ∈ ℝ+)) |
36 | 35 | rspcv 3617 | . . . . . . 7 ⊢ (𝑚 ∈ 𝑍 → (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℝ+ → (𝐹‘𝑚) ∈ ℝ+)) |
37 | 33, 24, 36 | syl6ci 71 | . . . . . 6 ⊢ (𝜑 → (𝑚 ∈ 𝑊 → (𝐹‘𝑚) ∈ ℝ+)) |
38 | 37 | imp 406 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → (𝐹‘𝑚) ∈ ℝ+) |
39 | 38 | rpred 13074 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → (𝐹‘𝑚) ∈ ℝ) |
40 | 38 | rpge0d 13078 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → 0 ≤ (𝐹‘𝑚)) |
41 | 1, 30, 32, 39, 40 | climserle 15695 | . . 3 ⊢ (𝜑 → (seq𝑁( + , 𝐹)‘𝑁) ≤ Σ𝑘 ∈ 𝑊 𝐴) |
42 | 27, 41 | eqbrtrrd 5171 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ≤ Σ𝑘 ∈ 𝑊 𝐴) |
43 | 21, 25, 42 | rpgecld 13113 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑊 𝐴 ∈ ℝ+) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1536 ∈ wcel 2105 ∀wral 3058 ⊆ wss 3962 dom cdm 5688 ‘cfv 6562 ℝcr 11151 + caddc 11155 ≤ cle 11293 ℤcz 12610 ℤ≥cuz 12875 ℝ+crp 13031 seqcseq 14038 ⇝ cli 15516 Σcsu 15718 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-inf2 9678 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 ax-pre-sup 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-int 4951 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-se 5641 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-isom 6571 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-1o 8504 df-er 8743 df-pm 8867 df-en 8984 df-dom 8985 df-sdom 8986 df-fin 8987 df-sup 9479 df-inf 9480 df-oi 9547 df-card 9976 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-div 11918 df-nn 12264 df-2 12326 df-3 12327 df-n0 12524 df-z 12611 df-uz 12876 df-rp 13032 df-fz 13544 df-fzo 13691 df-fl 13828 df-seq 14039 df-exp 14099 df-hash 14366 df-cj 15134 df-re 15135 df-im 15136 df-sqrt 15270 df-abs 15271 df-clim 15520 df-rlim 15521 df-sum 15719 |
This theorem is referenced by: effsumlt 16143 eirrlem 16236 aaliou3lem3 26400 |
Copyright terms: Public domain | W3C validator |