| 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 2875 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑀)) |
| 5 | eluzelz 12883 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 6 | 4, 5 | syl 18 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | uzss 12896 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) | |
| 8 | 4, 7 | syl 18 | . . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| 9 | 8, 1, 3 | 3sstr4g 3991 | . . . . 5 ⊢ (𝜑 → 𝑊 ⊆ 𝑍) |
| 10 | 9 | sselda 3938 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝑘 ∈ 𝑍) |
| 11 | isumrpcl.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
| 12 | 10, 11 | syldan 603 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → (𝐹‘𝑘) = 𝐴) |
| 13 | isumrpcl.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ+) | |
| 14 | 13 | rpred 13071 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ) |
| 15 | 10, 14 | syldan 603 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝐴 ∈ ℝ) |
| 16 | isumrpcl.6 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
| 17 | 11, 13 | eqeltrd 2865 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ+) |
| 18 | 17 | rpcnd 13073 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
| 19 | 3, 2, 18 | iserex 15727 | . . . 4 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ∈ dom ⇝ ↔ seq𝑁( + , 𝐹) ∈ dom ⇝ )) |
| 20 | 16, 19 | mpbid 235 | . . 3 ⊢ (𝜑 → seq𝑁( + , 𝐹) ∈ dom ⇝ ) |
| 21 | 1, 6, 12, 15, 20 | isumrecl 15834 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑊 𝐴 ∈ ℝ) |
| 22 | fveq2 6885 | . . . 4 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
| 23 | 22 | eleq1d 2850 | . . 3 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ+ ↔ (𝐹‘𝑁) ∈ ℝ+)) |
| 24 | 17 | ralrimiva 3159 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℝ+) |
| 25 | 23, 24, 2 | rspcdva 3584 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ+) |
| 26 | seq1 14063 | . . . 4 ⊢ (𝑁 ∈ ℤ → (seq𝑁( + , 𝐹)‘𝑁) = (𝐹‘𝑁)) | |
| 27 | 6, 26 | syl 18 | . . 3 ⊢ (𝜑 → (seq𝑁( + , 𝐹)‘𝑁) = (𝐹‘𝑁)) |
| 28 | uzid 12888 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ (ℤ≥‘𝑁)) | |
| 29 | 6, 28 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑁)) |
| 30 | 29, 1 | eleqtrrdi 2876 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑊) |
| 31 | 15 | recnd 11248 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝐴 ∈ ℂ) |
| 32 | 1, 6, 12, 31, 20 | isumclim2 15827 | . . . 4 ⊢ (𝜑 → seq𝑁( + , 𝐹) ⇝ Σ𝑘 ∈ 𝑊 𝐴) |
| 33 | 9 | sseld 3937 | . . . . . . 7 ⊢ (𝜑 → (𝑚 ∈ 𝑊 → 𝑚 ∈ 𝑍)) |
| 34 | fveq2 6885 | . . . . . . . . 9 ⊢ (𝑘 = 𝑚 → (𝐹‘𝑘) = (𝐹‘𝑚)) | |
| 35 | 34 | eleq1d 2850 | . . . . . . . 8 ⊢ (𝑘 = 𝑚 → ((𝐹‘𝑘) ∈ ℝ+ ↔ (𝐹‘𝑚) ∈ ℝ+)) |
| 36 | 35 | rspcv 3579 | . . . . . . 7 ⊢ (𝑚 ∈ 𝑍 → (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℝ+ → (𝐹‘𝑚) ∈ ℝ+)) |
| 37 | 33, 24, 36 | syl6ci 72 | . . . . . 6 ⊢ (𝜑 → (𝑚 ∈ 𝑊 → (𝐹‘𝑚) ∈ ℝ+)) |
| 38 | 37 | imp 412 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → (𝐹‘𝑚) ∈ ℝ+) |
| 39 | 38 | rpred 13071 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → (𝐹‘𝑚) ∈ ℝ) |
| 40 | 38 | rpge0d 13075 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → 0 ≤ (𝐹‘𝑚)) |
| 41 | 1, 30, 32, 39, 40 | climserle 15733 | . . 3 ⊢ (𝜑 → (seq𝑁( + , 𝐹)‘𝑁) ≤ Σ𝑘 ∈ 𝑊 𝐴) |
| 42 | 27, 41 | eqbrtrrd 5137 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ≤ Σ𝑘 ∈ 𝑊 𝐴) |
| 43 | 21, 25, 42 | rpgecld 13110 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑊 𝐴 ∈ ℝ+) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ⊆ wss 3906 dom cdm 5663 ‘cfv 6540 ℝcr 11110 + caddc 11114 ≤ cle 11255 ℤcz 12602 ℤ≥cuz 12873 ℝ+crp 13027 seqcseq 14050 ⇝ cli 15554 Σcsu 15756 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-inf2 9613 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-er 8696 df-pm 8829 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-sup 9405 df-inf 9406 df-oi 9475 df-card 9937 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-n0 12516 df-z 12603 df-uz 12874 df-rp 13028 df-fz 13547 df-fzo 13695 df-fl 13838 df-seq 14051 df-exp 14111 df-hash 14380 df-cj 15169 df-re 15170 df-im 15171 df-sqrt 15305 df-abs 15306 df-clim 15558 df-rlim 15559 df-sum 15757 |
| This theorem is used by: effsumlt 16184 eirrlem 16277 aaliou3lem3 26536 |
| Copyright terms: Public domain | W3C validator |