| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dchrisum | Structured version Visualization version GIF version | ||
| Description: If 𝑛 ∈ [𝑀, +∞) ↦ 𝐴(𝑛) is a positive decreasing function approaching zero, then the infinite sum Σ𝑛, 𝑋(𝑛)𝐴(𝑛) is convergent, with the partial sum Σ𝑛 ≤ 𝑥, 𝑋(𝑛)𝐴(𝑛) within 𝑂(𝐴(𝑀)) of the limit 𝑇. Lemma 9.4.1 of [Shapiro], p. 377. (Contributed by Mario Carneiro, 2-May-2016.) |
| Ref | Expression |
|---|---|
| rpvmasum.z | ⊢ 𝑍 = (ℤ/nℤ‘𝑁) |
| rpvmasum.l | ⊢ 𝐿 = (ℤRHom‘𝑍) |
| rpvmasum.a | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| rpvmasum.g | ⊢ 𝐺 = (DChr‘𝑁) |
| rpvmasum.d | ⊢ 𝐷 = (Base‘𝐺) |
| rpvmasum.1 | ⊢ 1 = (0g‘𝐺) |
| dchrisum.b | ⊢ (𝜑 → 𝑋 ∈ 𝐷) |
| dchrisum.n1 | ⊢ (𝜑 → 𝑋 ≠ 1 ) |
| dchrisum.2 | ⊢ (𝑛 = 𝑥 → 𝐴 = 𝐵) |
| dchrisum.3 | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| dchrisum.4 | ⊢ ((𝜑 ∧ 𝑛 ∈ ℝ+) → 𝐴 ∈ ℝ) |
| dchrisum.5 | ⊢ ((𝜑 ∧ (𝑛 ∈ ℝ+ ∧ 𝑥 ∈ ℝ+) ∧ (𝑀 ≤ 𝑛 ∧ 𝑛 ≤ 𝑥)) → 𝐵 ≤ 𝐴) |
| dchrisum.6 | ⊢ (𝜑 → (𝑛 ∈ ℝ+ ↦ 𝐴) ⇝𝑟 0) |
| dchrisum.7 | ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ ((𝑋‘(𝐿‘𝑛)) · 𝐴)) |
| Ref | Expression |
|---|---|
| dchrisum | ⊢ (𝜑 → ∃𝑡∃𝑐 ∈ (0[,)+∞)(seq1( + , 𝐹) ⇝ 𝑡 ∧ ∀𝑥 ∈ (𝑀[,)+∞)(abs‘((seq1( + , 𝐹)‘(⌊‘𝑥)) − 𝑡)) ≤ (𝑐 · 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fzofi 14157 | . . 3 ⊢ (0..^𝑁) ∈ Fin | |
| 2 | fzofi 14157 | . . . . . . 7 ⊢ (0..^𝑢) ∈ Fin | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝜑 → (0..^𝑢) ∈ Fin) |
| 4 | rpvmasum.g | . . . . . . 7 ⊢ 𝐺 = (DChr‘𝑁) | |
| 5 | rpvmasum.z | . . . . . . 7 ⊢ 𝑍 = (ℤ/nℤ‘𝑁) | |
| 6 | rpvmasum.d | . . . . . . 7 ⊢ 𝐷 = (Base‘𝐺) | |
| 7 | rpvmasum.l | . . . . . . 7 ⊢ 𝐿 = (ℤRHom‘𝑍) | |
| 8 | dchrisum.b | . . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝐷) | |
| 9 | 8 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (0..^𝑢)) → 𝑋 ∈ 𝐷) |
| 10 | elfzoelz 13833 | . . . . . . . 8 ⊢ (𝑚 ∈ (0..^𝑢) → 𝑚 ∈ ℤ) | |
| 11 | 10 | adantl 487 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (0..^𝑢)) → 𝑚 ∈ ℤ) |
| 12 | 4, 5, 6, 7, 9, 11 | dchrzrhcl 27629 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (0..^𝑢)) → (𝑋‘(𝐿‘𝑚)) ∈ ℂ) |
| 13 | 3, 12 | fsumcl 15943 | . . . . 5 ⊢ (𝜑 → Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚)) ∈ ℂ) |
| 14 | 13 | abscld 15650 | . . . 4 ⊢ (𝜑 → (abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ∈ ℝ) |
| 15 | 14 | ralrimivw 3162 | . . 3 ⊢ (𝜑 → ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ∈ ℝ) |
| 16 | fimaxre3 12303 | . . 3 ⊢ (((0..^𝑁) ∈ Fin ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ∈ ℝ) → ∃𝑟 ∈ ℝ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟) | |
| 17 | 1, 15, 16 | sylancr 599 | . 2 ⊢ (𝜑 → ∃𝑟 ∈ ℝ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟) |
| 18 | rpvmasum.a | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 19 | 18 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑁 ∈ ℕ) |
| 20 | rpvmasum.1 | . . 3 ⊢ 1 = (0g‘𝐺) | |
| 21 | 8 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑋 ∈ 𝐷) |
| 22 | dchrisum.n1 | . . . 4 ⊢ (𝜑 → 𝑋 ≠ 1 ) | |
| 23 | 22 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑋 ≠ 1 ) |
| 24 | dchrisum.2 | . . 3 ⊢ (𝑛 = 𝑥 → 𝐴 = 𝐵) | |
| 25 | dchrisum.3 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
| 26 | 25 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑀 ∈ ℕ) |
| 27 | dchrisum.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℝ+) → 𝐴 ∈ ℝ) | |
| 28 | 27 | adantlr 728 | . . 3 ⊢ (((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) ∧ 𝑛 ∈ ℝ+) → 𝐴 ∈ ℝ) |
| 29 | dchrisum.5 | . . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℝ+ ∧ 𝑥 ∈ ℝ+) ∧ (𝑀 ≤ 𝑛 ∧ 𝑛 ≤ 𝑥)) → 𝐵 ≤ 𝐴) | |
| 30 | 29 | 3adant1r 1196 | . . 3 ⊢ (((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) ∧ (𝑛 ∈ ℝ+ ∧ 𝑥 ∈ ℝ+) ∧ (𝑀 ≤ 𝑛 ∧ 𝑛 ≤ 𝑥)) → 𝐵 ≤ 𝐴) |
| 31 | dchrisum.6 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ ℝ+ ↦ 𝐴) ⇝𝑟 0) | |
| 32 | 31 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → (𝑛 ∈ ℝ+ ↦ 𝐴) ⇝𝑟 0) |
| 33 | dchrisum.7 | . . 3 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ ((𝑋‘(𝐿‘𝑛)) · 𝐴)) | |
| 34 | simprl 783 | . . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑟 ∈ ℝ) | |
| 35 | simprr 785 | . . . 4 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟) | |
| 36 | 2fveq3 6921 | . . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (𝑋‘(𝐿‘𝑚)) = (𝑋‘(𝐿‘𝑛))) | |
| 37 | 36 | cbvsumv 15907 | . . . . . . . 8 ⊢ Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚)) = Σ𝑛 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑛)) |
| 38 | oveq2 7459 | . . . . . . . . 9 ⊢ (𝑢 = 𝑖 → (0..^𝑢) = (0..^𝑖)) | |
| 39 | 38 | sumeq1d 15911 | . . . . . . . 8 ⊢ (𝑢 = 𝑖 → Σ𝑛 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑛)) = Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) |
| 40 | 37, 39 | eqtrid 2810 | . . . . . . 7 ⊢ (𝑢 = 𝑖 → Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚)) = Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) |
| 41 | 40 | fveq2d 6920 | . . . . . 6 ⊢ (𝑢 = 𝑖 → (abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) = (abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛)))) |
| 42 | 41 | breq1d 5118 | . . . . 5 ⊢ (𝑢 = 𝑖 → ((abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟 ↔ (abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) ≤ 𝑟)) |
| 43 | 42 | cbvralvw 3244 | . . . 4 ⊢ (∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟 ↔ ∀𝑖 ∈ (0..^𝑁)(abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) ≤ 𝑟) |
| 44 | 35, 43 | sylib 221 | . . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → ∀𝑖 ∈ (0..^𝑁)(abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) ≤ 𝑟) |
| 45 | 5, 7, 19, 4, 6, 20, 21, 23, 24, 26, 28, 30, 32, 33, 34, 44 | dchrisumlem3 27875 | . 2 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → ∃𝑡∃𝑐 ∈ (0[,)+∞)(seq1( + , 𝐹) ⇝ 𝑡 ∧ ∀𝑥 ∈ (𝑀[,)+∞)(abs‘((seq1( + , 𝐹)‘(⌊‘𝑥)) − 𝑡)) ≤ (𝑐 · 𝐵))) |
| 46 | 17, 45 | rexlimddv 3173 | 1 ⊢ (𝜑 → ∃𝑡∃𝑐 ∈ (0[,)+∞)(seq1( + , 𝐹) ⇝ 𝑡 ∧ ∀𝑥 ∈ (𝑀[,)+∞)(abs‘((seq1( + , 𝐹)‘(⌊‘𝑥)) − 𝑡)) ≤ (𝑐 · 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 class class class wbr 5108 ↦ cmpt 5192 ‘cfv 6566 (class class class)co 7451 Fincfn 9011 ℝcr 11238 0cc0 11239 1c1 11240 + caddc 11242 · cmul 11244 +∞cpnf 11379 ≤ cle 11383 − cmin 11580 ℕcn 12375 ℤcz 12733 ℝ+crp 13160 [,)cico 13518 ..^cfzo 13828 ⌊cfl 13970 seqcseq 14184 abscabs 15444 ⇝ cli 15695 ⇝𝑟 crli 15696 Σcsu 15897 Basecbs 17431 0gc0g 17660 ℤRHomczrh 21860 ℤ/nℤczn 21863 DChrcdchr 27616 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 ax-addf 11318 ax-mulf 11319 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 df-om 7912 df-1st 8035 df-2nd 8036 df-tpos 8281 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-ec 8757 df-qs 8761 df-map 8887 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-oi 9541 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-xnn0 12720 df-z 12734 df-dec 12855 df-uz 13006 df-rp 13161 df-ico 13522 df-fz 13680 df-fzo 13829 df-fl 13972 df-mod 14050 df-seq 14185 df-exp 14245 df-hash 14516 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-limsup 15682 df-clim 15699 df-rlim 15700 df-sum 15898 df-dvds 16467 df-gcd 16709 df-phi 16987 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-starv 17488 df-sca 17489 df-vsca 17490 df-ip 17491 df-tset 17492 df-ple 17493 df-ds 17495 df-unif 17496 df-euf 17499 df-0g 17662 df-imas 17730 df-qus 17731 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-mhm 19028 df-grp 19197 df-minusg 19198 df-sbg 19199 df-mulg 19328 df-subg 19383 df-nsg 19384 df-eqg 19385 df-ghm 19478 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-cring 20513 df-oppr 20618 df-dvdsr 20638 df-unit 20639 df-invr 20669 df-rhm 20753 df-subrng 20849 df-subrg 20873 df-lmod 21188 df-lss 21258 df-lsp 21298 df-sra 21499 df-rgmod 21500 df-lidl 21537 df-rsp 21538 df-2idl 21594 df-cnfld 21730 df-zring 21807 df-zrh 21864 df-zn 21867 df-dchr 27617 |
| This theorem is used by: dchrmusumlema 27877 dchrvmasumlema 27884 dchrisum0lema 27898 |
| Copyright terms: Public domain | W3C validator |