| 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 6890 | . . . . 5 ⊢ 𝑍 ∈ V |
| 5 | 4 | mptex 7215 | . . . 4 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V) |
| 7 | iserabs.6 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
| 8 | 1, 2, 7 | serf 14048 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 9 | 8 | ffvelcdmda 7074 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ) |
| 10 | 2fveq3 6881 | . . . . 5 ⊢ (𝑚 = 𝑛 → (abs‘(seq𝑀( + , 𝐹)‘𝑚)) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) | |
| 11 | eqid 2735 | . . . . 5 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) | |
| 12 | fvex 6889 | . . . . 5 ⊢ (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ V | |
| 13 | 10, 11, 12 | fvmpt 6986 | . . . 4 ⊢ (𝑛 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 14 | 13 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 15 | 1, 3, 6, 2, 9, 14 | climabs 15620 | . 2 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ⇝ (abs‘𝐴)) |
| 16 | iserabs.3 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ 𝐵) | |
| 17 | 9 | abscld 15455 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ ℝ) |
| 18 | 14, 17 | eqeltrd 2834 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ∈ ℝ) |
| 19 | iserabs.7 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) | |
| 20 | 7 | abscld 15455 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (abs‘(𝐹‘𝑘)) ∈ ℝ) |
| 21 | 19, 20 | eqeltrd 2834 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℝ) |
| 22 | 1, 2, 21 | serfre 14049 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℝ) |
| 23 | 22 | ffvelcdmda 7074 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ) |
| 24 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍) | |
| 25 | 24, 1 | eleqtrdi 2844 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ (ℤ≥‘𝑀)) |
| 26 | elfzuz 13537 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 27 | 26, 1 | eleqtrrdi 2845 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍) |
| 28 | 27, 7 | sylan2 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ) |
| 29 | 28 | adantlr 715 | . . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ) |
| 30 | 27, 19 | sylan2 593 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) |
| 31 | 30 | adantlr 715 | . . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) |
| 32 | 25, 29, 31 | seqabs 15830 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 33 | 14, 32 | eqbrtrd 5141 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 34 | 1, 2, 15, 16, 18, 23, 33 | climle 15656 | 1 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 Vcvv 3459 class class class wbr 5119 ↦ cmpt 5201 ‘cfv 6531 (class class class)co 7405 ℂcc 11127 ℝcr 11128 + caddc 11132 ≤ cle 11270 ℤcz 12588 ℤ≥cuz 12852 ...cfz 13524 seqcseq 14019 abscabs 15253 ⇝ cli 15500 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-inf2 9655 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8719 df-pm 8843 df-en 8960 df-dom 8961 df-sdom 8962 df-fin 8963 df-sup 9454 df-inf 9455 df-oi 9524 df-card 9953 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-3 12304 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009 df-fz 13525 df-fzo 13672 df-fl 13809 df-seq 14020 df-exp 14080 df-hash 14349 df-cj 15118 df-re 15119 df-im 15120 df-sqrt 15254 df-abs 15255 df-clim 15504 df-rlim 15505 df-sum 15703 |
| This theorem is referenced by: eftlub 16127 abelthlem7 26400 |
| Copyright terms: Public domain | W3C validator |