| 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 6855 | . . . . 5 ⊢ 𝑍 ∈ V |
| 5 | 4 | mptex 7178 | . . . 4 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V |
| 6 | 5 | a1i 11 | . . 3 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ∈ V) |
| 7 | iserabs.6 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ) | |
| 8 | 1, 2, 7 | serf 13992 | . . . 4 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℂ) |
| 9 | 8 | ffvelcdmda 7037 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ) |
| 10 | 2fveq3 6846 | . . . . 5 ⊢ (𝑚 = 𝑛 → (abs‘(seq𝑀( + , 𝐹)‘𝑚)) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) | |
| 11 | eqid 2737 | . . . . 5 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) | |
| 12 | fvex 6854 | . . . . 5 ⊢ (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ V | |
| 13 | 10, 11, 12 | fvmpt 6948 | . . . 4 ⊢ (𝑛 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 14 | 13 | adantl 481 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) = (abs‘(seq𝑀( + , 𝐹)‘𝑛))) |
| 15 | 1, 3, 6, 2, 9, 14 | climabs 15566 | . 2 ⊢ (𝜑 → (𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚))) ⇝ (abs‘𝐴)) |
| 16 | iserabs.3 | . 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ⇝ 𝐵) | |
| 17 | 9 | abscld 15401 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ∈ ℝ) |
| 18 | 14, 17 | eqeltrd 2837 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ∈ ℝ) |
| 19 | iserabs.7 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) = (abs‘(𝐹‘𝑘))) | |
| 20 | 7 | abscld 15401 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (abs‘(𝐹‘𝑘)) ∈ ℝ) |
| 21 | 19, 20 | eqeltrd 2837 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℝ) |
| 22 | 1, 2, 21 | serfre 13993 | . . 3 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℝ) |
| 23 | 22 | ffvelcdmda 7037 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ) |
| 24 | simpr 484 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ 𝑍) | |
| 25 | 24, 1 | eleqtrdi 2847 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → 𝑛 ∈ (ℤ≥‘𝑀)) |
| 26 | elfzuz 13474 | . . . . . . 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 15777 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (abs‘(seq𝑀( + , 𝐹)‘𝑛)) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 33 | 14, 32 | eqbrtrd 5108 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(seq𝑀( + , 𝐹)‘𝑚)))‘𝑛) ≤ (seq𝑀( + , 𝐺)‘𝑛)) |
| 34 | 1, 2, 15, 16, 18, 23, 33 | climle 15602 | 1 ⊢ (𝜑 → (abs‘𝐴) ≤ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3430 class class class wbr 5086 ↦ cmpt 5167 ‘cfv 6499 (class class class)co 7367 ℂcc 11036 ℝcr 11037 + caddc 11041 ≤ cle 11180 ℤcz 12524 ℤ≥cuz 12788 ...cfz 13461 seqcseq 13963 abscabs 15196 ⇝ cli 15446 |
| 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 5213 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| 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 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-inf 9356 df-oi 9425 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-fz 13462 df-fzo 13609 df-fl 13751 df-seq 13964 df-exp 14024 df-hash 14293 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-clim 15450 df-rlim 15451 df-sum 15649 |
| This theorem is referenced by: eftlub 16076 abelthlem7 26403 |
| Copyright terms: Public domain | W3C validator |