| 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 12860 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 6 | 4, 5 | syl 18 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 7 | uzss 12873 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) | |
| 8 | 4, 7 | syl 18 | . . . . . 6 ⊢ (𝜑 → (ℤ≥‘𝑁) ⊆ (ℤ≥‘𝑀)) |
| 9 | 8, 1, 3 | 3sstr4g 3992 | . . . . 5 ⊢ (𝜑 → 𝑊 ⊆ 𝑍) |
| 10 | 9 | sselda 3939 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝑘 ∈ 𝑍) |
| 11 | isumrpcl.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) = 𝐴) | |
| 12 | 10, 11 | syldan 602 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → (𝐹‘𝑘) = 𝐴) |
| 13 | isumrpcl.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ+) | |
| 14 | 13 | rpred 13048 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐴 ∈ ℝ) |
| 15 | 10, 14 | syldan 602 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝐴 ∈ ℝ) |
| 16 | isumrpcl.6 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ ) | |
| 17 | 11, 13 | eqeltrd 2865 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ+) |
| 18 | 17 | rpcnd 13050 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
| 19 | 3, 2, 18 | iserex 15696 | . . . 4 ⊢ (𝜑 → (seq𝑀( + , 𝐹) ∈ dom ⇝ ↔ seq𝑁( + , 𝐹) ∈ dom ⇝ )) |
| 20 | 16, 19 | mpbid 235 | . . 3 ⊢ (𝜑 → seq𝑁( + , 𝐹) ∈ dom ⇝ ) |
| 21 | 1, 6, 12, 15, 20 | isumrecl 15804 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ 𝑊 𝐴 ∈ ℝ) |
| 22 | fveq2 6871 | . . . 4 ⊢ (𝑘 = 𝑁 → (𝐹‘𝑘) = (𝐹‘𝑁)) | |
| 23 | 22 | eleq1d 2850 | . . 3 ⊢ (𝑘 = 𝑁 → ((𝐹‘𝑘) ∈ ℝ+ ↔ (𝐹‘𝑁) ∈ ℝ+)) |
| 24 | 17 | ralrimiva 3157 | . . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℝ+) |
| 25 | 23, 24, 2 | rspcdva 3585 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ∈ ℝ+) |
| 26 | seq1 14038 | . . . 4 ⊢ (𝑁 ∈ ℤ → (seq𝑁( + , 𝐹)‘𝑁) = (𝐹‘𝑁)) | |
| 27 | 6, 26 | syl 18 | . . 3 ⊢ (𝜑 → (seq𝑁( + , 𝐹)‘𝑁) = (𝐹‘𝑁)) |
| 28 | uzid 12865 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ (ℤ≥‘𝑁)) | |
| 29 | 6, 28 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘𝑁)) |
| 30 | 29, 1 | eleqtrrdi 2876 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑊) |
| 31 | 15 | recnd 11225 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑊) → 𝐴 ∈ ℂ) |
| 32 | 1, 6, 12, 31, 20 | isumclim2 15797 | . . . 4 ⊢ (𝜑 → seq𝑁( + , 𝐹) ⇝ Σ𝑘 ∈ 𝑊 𝐴) |
| 33 | 9 | sseld 3938 | . . . . . . 7 ⊢ (𝜑 → (𝑚 ∈ 𝑊 → 𝑚 ∈ 𝑍)) |
| 34 | fveq2 6871 | . . . . . . . . 9 ⊢ (𝑘 = 𝑚 → (𝐹‘𝑘) = (𝐹‘𝑚)) | |
| 35 | 34 | eleq1d 2850 | . . . . . . . 8 ⊢ (𝑘 = 𝑚 → ((𝐹‘𝑘) ∈ ℝ+ ↔ (𝐹‘𝑚) ∈ ℝ+)) |
| 36 | 35 | rspcv 3580 | . . . . . . 7 ⊢ (𝑚 ∈ 𝑍 → (∀𝑘 ∈ 𝑍 (𝐹‘𝑘) ∈ ℝ+ → (𝐹‘𝑚) ∈ ℝ+)) |
| 37 | 33, 24, 36 | syl6ci 72 | . . . . . 6 ⊢ (𝜑 → (𝑚 ∈ 𝑊 → (𝐹‘𝑚) ∈ ℝ+)) |
| 38 | 37 | imp 411 | . . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → (𝐹‘𝑚) ∈ ℝ+) |
| 39 | 38 | rpred 13048 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → (𝐹‘𝑚) ∈ ℝ) |
| 40 | 38 | rpge0d 13052 | . . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑊) → 0 ≤ (𝐹‘𝑚)) |
| 41 | 1, 30, 32, 39, 40 | climserle 15702 | . . 3 ⊢ (𝜑 → (seq𝑁( + , 𝐹)‘𝑁) ≤ Σ𝑘 ∈ 𝑊 𝐴) |
| 42 | 27, 41 | eqbrtrrd 5128 | . 2 ⊢ (𝜑 → (𝐹‘𝑁) ≤ Σ𝑘 ∈ 𝑊 𝐴) |
| 43 | 21, 25, 42 | rpgecld 13087 | 1 ⊢ (𝜑 → Σ𝑘 ∈ 𝑊 𝐴 ∈ ℝ+) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∀wral 3079 ⊆ wss 3907 dom cdm 5651 ‘cfv 6525 ℝcr 11087 + caddc 11091 ≤ cle 11232 ℤcz 12579 ℤ≥cuz 12850 ℝ+crp 13004 seqcseq 14025 ⇝ cli 15523 Σcsu 15725 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-inf2 9598 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-er 8682 df-pm 8815 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-inf 9391 df-oi 9460 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12222 df-2 12291 df-3 12292 df-n0 12493 df-z 12580 df-uz 12851 df-rp 13005 df-fz 13524 df-fzo 13671 df-fl 13813 df-seq 14026 df-exp 14086 df-hash 14355 df-cj 15138 df-re 15139 df-im 15140 df-sqrt 15274 df-abs 15275 df-clim 15527 df-rlim 15528 df-sum 15726 |
| This theorem is referenced by: effsumlt 16155 eirrlem 16248 aaliou3lem3 26462 |
| Copyright terms: Public domain | W3C validator |