| 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 6849 | . . . . 5 ⊢ 𝑍 ∈ V |
| 5 | 4 | mptex 7171 | . . . 4 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V) |
| 7 | iserabs.6 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
| 8 | 1, 2, 7 | serf 13957 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 9 | 8 | ffvelcdmda 7031 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ) |
| 10 | 2fveq3 6840 | . . . . 5 ⊢ (𝑚 = 𝑛 → (abs‘(seq𝑀( + , 𝐹)‘𝑚)) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) | |
| 11 | eqid 2737 | . . . . 5 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) | |
| 12 | fvex 6848 | . . . . 5 ⊢ (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ V | |
| 13 | 10, 11, 12 | fvmpt 6942 | . . . 4 ⊢ (𝑛 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 14 | 13 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 15 | 1, 3, 6, 2, 9, 14 | climabs 15531 | . 2 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ⇝ (abs‘𝐴)) |
| 16 | iserabs.3 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ 𝐵) | |
| 17 | 9 | abscld 15366 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ ℝ) |
| 18 | 14, 17 | eqeltrd 2837 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ∈ ℝ) |
| 19 | iserabs.7 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) | |
| 20 | 7 | abscld 15366 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (abs‘(𝐹‘𝑘)) ∈ ℝ) |
| 21 | 19, 20 | eqeltrd 2837 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℝ) |
| 22 | 1, 2, 21 | serfre 13958 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℝ) |
| 23 | 22 | ffvelcdmda 7031 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ) |
| 24 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍) | |
| 25 | 24, 1 | eleqtrdi 2847 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ (ℤ≥‘𝑀)) |
| 26 | elfzuz 13440 | . . . . . . 7 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ≥‘𝑀)) | |
| 27 | 26, 1 | eleqtrrdi 2848 | . . . . . 6 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍) |
| 28 | 27, 7 | sylan2 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ) |
| 29 | 28 | adantlr 716 | . . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ) |
| 30 | 27, 19 | sylan2 594 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) |
| 31 | 30 | adantlr 716 | . . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ 𝑍) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) |
| 32 | 25, 29, 31 | seqabs 15741 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 33 | 14, 32 | eqbrtrd 5121 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 34 | 1, 2, 15, 16, 18, 23, 33 | climle 15567 | 1 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3441 class class class wbr 5099 ↦ cmpt 5180 ‘cfv 6493 (class class class)co 7360 ℂcc 11028 ℝcr 11029 + caddc 11033 ≤ cle 11171 ℤcz 12492 ℤ≥cuz 12755 ...cfz 13427 seqcseq 13928 abscabs 15161 ⇝ cli 15411 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-inf2 9554 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107 ax-pre-sup 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-oi 9419 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12150 df-2 12212 df-3 12213 df-n0 12406 df-z 12493 df-uz 12756 df-rp 12910 df-fz 13428 df-fzo 13575 df-fl 13716 df-seq 13929 df-exp 13989 df-hash 14258 df-cj 15026 df-re 15027 df-im 15028 df-sqrt 15162 df-abs 15163 df-clim 15415 df-rlim 15416 df-sum 15614 |
| This theorem is referenced by: eftlub 16038 abelthlem7 26408 |
| Copyright terms: Public domain | W3C validator |