| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iserabs | Structured version Visualization version GIF version | ||
| Description: Generalized triangle inequality: the absolute value of an infinite sum is less than or equal to the sum of absolute values. (Contributed by Paul Chapman, 10-Sep-2007.) (Revised by Mario Carneiro, 27-May-2014.) |
| Ref | Expression |
|---|---|
| iserabs.1 | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| iserabs.2 | ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) |
| iserabs.3 | ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ 𝐵) |
| iserabs.5 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| iserabs.6 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) |
| iserabs.7 | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) |
| Ref | Expression |
|---|---|
| iserabs | ⊢ (𝜑 → (abs‘𝐴) ≤ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iserabs.1 | . 2 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 2 | iserabs.5 | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 3 | iserabs.2 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ 𝐴) | |
| 4 | 1 | fvexi 6881 | . . . . 5 ⊢ 𝑍 ∈ V |
| 5 | 4 | mptex 7207 | . . . 4 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V) |
| 7 | iserabs.6 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
| 8 | 1, 2, 7 | serf 14053 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 9 | 8 | ffvelcdmda 7065 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ) |
| 10 | 2fveq3 6872 | . . . . 5 ⊢ (𝑚 = 𝑛 → (abs‘(seq𝑀( + , 𝐹)‘𝑚)) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) | |
| 11 | eqid 2763 | . . . . 5 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) | |
| 12 | fvex 6880 | . . . . 5 ⊢ (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ V | |
| 13 | 10, 11, 12 | fvmpt 6975 | . . . 4 ⊢ (𝑛 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 14 | 13 | adantl 485 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 15 | 1, 3, 6, 2, 9, 14 | climabs 15641 | . 2 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ⇝ (abs‘𝐴)) |
| 16 | iserabs.3 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ 𝐵) | |
| 17 | 9 | abscld 15476 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ ℝ) |
| 18 | 14, 17 | eqeltrd 2863 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ∈ ℝ) |
| 19 | iserabs.7 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) | |
| 20 | 7 | abscld 15476 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (abs‘(𝐹‘𝑘)) ∈ ℝ) |
| 21 | 19, 20 | eqeltrd 2863 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℝ) |
| 22 | 1, 2, 21 | serfre 14054 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℝ) |
| 23 | 22 | ffvelcdmda 7065 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ) |
| 24 | simpr 488 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍) | |
| 25 | 24, 1 | eleqtrdi 2873 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ (ℤ≥‘𝑀)) |
| 26 | elfzuz 13535 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 27 | 26, 1 | eleqtrrdi 2874 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍) |
| 28 | 27, 7 | sylan2 602 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ) |
| 29 | 28 | adantlr 725 | . . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ) |
| 30 | 27, 19 | sylan2 602 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) |
| 31 | 30 | adantlr 725 | . . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) |
| 32 | 25, 29, 31 | seqabs 15852 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 33 | 14, 32 | eqbrtrd 5123 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 34 | 1, 2, 15, 16, 18, 23, 33 | climle 15677 | 1 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1561 ∈ wcel 2143 Vcvv 3455 class class class wbr 5101 ↦ cmpt 5182 ‘cfv 6521 (class class class)co 7396 ℂcc 11082 ℝcr 11083 + caddc 11087 ≤ cle 11228 ℤcz 12578 ℤ≥cuz 12849 ...cfz 13522 seqcseq 14024 abscabs 15271 ⇝ cli 15521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-inf2 9594 ax-cnex 11140 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-addrcl 11145 ax-mulcl 11146 ax-mulrcl 11147 ax-mulcom 11148 ax-addass 11149 ax-mulass 11150 ax-distr 11151 ax-i2m1 11152 ax-1ne0 11153 ax-1rid 11154 ax-rnegex 11155 ax-rrecex 11156 ax-cnre 11157 ax-pre-lttri 11158 ax-pre-lttrn 11159 ax-pre-ltadd 11160 ax-pre-mulgt0 11161 ax-pre-sup 11162 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-se 5602 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-isom 6530 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-pm 8811 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-sup 9386 df-inf 9387 df-oi 9456 df-card 9909 df-pnf 11229 df-mnf 11230 df-xr 11231 df-ltxr 11232 df-le 11233 df-sub 11427 df-neg 11428 df-div 11856 df-nn 12221 df-2 12290 df-3 12291 df-n0 12492 df-z 12579 df-uz 12850 df-rp 13004 df-fz 13523 df-fzo 13670 df-fl 13812 df-seq 14025 df-exp 14085 df-hash 14354 df-cj 15136 df-re 15137 df-im 15138 df-sqrt 15272 df-abs 15273 df-clim 15525 df-rlim 15526 df-sum 15724 |
| This theorem is referenced by: eftlub 16151 abelthlem7 26508 |
| Copyright terms: Public domain | W3C validator |