dchrisum - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > dchrisum		Structured version Visualization version GIF version

Theorem dchrisum 25226

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.)

**Hypotheses**
Ref	Expression
rpvmasum.z	⊢ 𝑍 = (ℤ/nℤ‘𝑁)
rpvmasum.l	⊢ 𝐿 = (ℤRHom‘𝑍)
rpvmasum.a	⊢ (𝜑 → 𝑁 ∈ ℕ)
rpvmasum.g	⊢ 𝐺 = (DChr‘𝑁)
rpvmasum.d	⊢ 𝐷 = (Base‘𝐺)
rpvmasum.1	⊢ 1 = (0_g‘𝐺)
dchrisum.b	⊢ (𝜑 → 𝑋 ∈ 𝐷)
dchrisum.n1	⊢ (𝜑 → 𝑋 ≠ 1 )
dchrisum.2	⊢ (𝑛 = 𝑥 → 𝐴 = 𝐵)
dchrisum.3	⊢ (𝜑 → 𝑀 ∈ ℕ)
dchrisum.4	⊢ ((𝜑 ∧ 𝑛 ∈ ℝ⁺) → 𝐴 ∈ ℝ)
dchrisum.5	⊢ ((𝜑 ∧ (𝑛 ∈ ℝ⁺ ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑀 ≤ 𝑛 ∧ 𝑛 ≤ 𝑥)) → 𝐵 ≤ 𝐴)
dchrisum.6	⊢ (𝜑 → (𝑛 ∈ ℝ⁺ ↦ 𝐴) ⇝_𝑟 0)
dchrisum.7	⊢ 𝐹 = (𝑛 ∈ ℕ ↦ ((𝑋‘(𝐿‘𝑛)) · 𝐴))

**Assertion**
Ref	Expression
dchrisum	⊢ (𝜑 → ∃𝑡∃𝑐 ∈ (0[,)+∞)(seq1( + , 𝐹) ⇝ 𝑡 ∧ ∀𝑥 ∈ (𝑀[,)+∞)(abs‘((seq1( + , 𝐹)‘(⌊‘𝑥)) − 𝑡)) ≤ (𝑐 · 𝐵)))

Distinct variable groups: 𝑥,𝑛,𝑐,𝑡, 1 𝐹,𝑐,𝑛,𝑡,𝑥 𝐴,𝑐,𝑡,𝑥 𝑁,𝑐,𝑛,𝑡,𝑥 𝜑,𝑐,𝑛,𝑡,𝑥 𝐵,𝑐,𝑛 𝑛,𝑍,𝑥 𝐷,𝑐,𝑛,𝑡,𝑥 𝐿,𝑐,𝑛,𝑡,𝑥 𝑀,𝑐,𝑛,𝑥 𝑋,𝑐,𝑛,𝑡,𝑥 Allowed substitution hints: 𝐴(𝑛) 𝐵(𝑥,𝑡) 𝐺(𝑥,𝑡,𝑛,𝑐) 𝑀(𝑡) 𝑍(𝑡,𝑐)

Proof of Theorem dchrisum Dummy variables 𝑚 𝑢 𝑖 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fzofi 12813	. . 3 ⊢ (0..^𝑁) ∈ Fin
2		fzofi 12813	. . . . . . 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 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (0..^𝑢)) → 𝑋 ∈ 𝐷)
10		elfzoelz 12509	. . . . . . . 8 ⊢ (𝑚 ∈ (0..^𝑢) → 𝑚 ∈ ℤ)
11	10	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ (0..^𝑢)) → 𝑚 ∈ ℤ)
12	4, 5, 6, 7, 9, 11	dchrzrhcl 25015	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ (0..^𝑢)) → (𝑋‘(𝐿‘𝑚)) ∈ ℂ)
13	3, 12	fsumcl 14508	. . . . 5 ⊢ (𝜑 → Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚)) ∈ ℂ)
14	13	abscld 14219	. . . 4 ⊢ (𝜑 → (abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ∈ ℝ)
15	14	ralrimivw 2996	. . 3 ⊢ (𝜑 → ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ∈ ℝ)
16		fimaxre3 11008	. . 3 ⊢ (((0..^𝑁) ∈ Fin ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ∈ ℝ) → ∃𝑟 ∈ ℝ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)
17	1, 15, 16	sylancr 696	. 2 ⊢ (𝜑 → ∃𝑟 ∈ ℝ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)
18		rpvmasum.a	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ)
19	18	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑁 ∈ ℕ)
20		rpvmasum.1	. . 3 ⊢ 1 = (0_g‘𝐺)
21	8	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑋 ∈ 𝐷)
22		dchrisum.n1	. . . 4 ⊢ (𝜑 → 𝑋 ≠ 1 )
23	22	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑋 ≠ 1 )
24		dchrisum.2	. . 3 ⊢ (𝑛 = 𝑥 → 𝐴 = 𝐵)
25		dchrisum.3	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
26	25	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑀 ∈ ℕ)
27		dchrisum.4	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℝ⁺) → 𝐴 ∈ ℝ)
28	27	adantlr 751	. . 3 ⊢ (((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) ∧ 𝑛 ∈ ℝ⁺) → 𝐴 ∈ ℝ)
29		dchrisum.5	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℝ⁺ ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑀 ≤ 𝑛 ∧ 𝑛 ≤ 𝑥)) → 𝐵 ≤ 𝐴)
30	29	3adant1r 1359	. . 3 ⊢ (((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) ∧ (𝑛 ∈ ℝ⁺ ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑀 ≤ 𝑛 ∧ 𝑛 ≤ 𝑥)) → 𝐵 ≤ 𝐴)
31		dchrisum.6	. . . 4 ⊢ (𝜑 → (𝑛 ∈ ℝ⁺ ↦ 𝐴) ⇝_𝑟 0)
32	31	adantr 480	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → (𝑛 ∈ ℝ⁺ ↦ 𝐴) ⇝_𝑟 0)
33		dchrisum.7	. . 3 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ ((𝑋‘(𝐿‘𝑛)) · 𝐴))
34		simprl 809	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → 𝑟 ∈ ℝ)
35		simprr 811	. . . 4 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)
36		fveq2 6229	. . . . . . . . . 10 ⊢ (𝑚 = 𝑛 → (𝐿‘𝑚) = (𝐿‘𝑛))
37	36	fveq2d 6233	. . . . . . . . 9 ⊢ (𝑚 = 𝑛 → (𝑋‘(𝐿‘𝑚)) = (𝑋‘(𝐿‘𝑛)))
38	37	cbvsumv 14470	. . . . . . . 8 ⊢ Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚)) = Σ𝑛 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑛))
39		oveq2 6698	. . . . . . . . 9 ⊢ (𝑢 = 𝑖 → (0..^𝑢) = (0..^𝑖))
40	39	sumeq1d 14475	. . . . . . . 8 ⊢ (𝑢 = 𝑖 → Σ𝑛 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑛)) = Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛)))
41	38, 40	syl5eq 2697	. . . . . . 7 ⊢ (𝑢 = 𝑖 → Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚)) = Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛)))
42	41	fveq2d 6233	. . . . . 6 ⊢ (𝑢 = 𝑖 → (abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) = (abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))))
43	42	breq1d 4695	. . . . 5 ⊢ (𝑢 = 𝑖 → ((abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟 ↔ (abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) ≤ 𝑟))
44	43	cbvralv 3201	. . . 4 ⊢ (∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟 ↔ ∀𝑖 ∈ (0..^𝑁)(abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) ≤ 𝑟)
45	35, 44	sylib 208	. . 3 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → ∀𝑖 ∈ (0..^𝑁)(abs‘Σ𝑛 ∈ (0..^𝑖)(𝑋‘(𝐿‘𝑛))) ≤ 𝑟)
46	5, 7, 19, 4, 6, 20, 21, 23, 24, 26, 28, 30, 32, 33, 34, 45	dchrisumlem3 25225	. 2 ⊢ ((𝜑 ∧ (𝑟 ∈ ℝ ∧ ∀𝑢 ∈ (0..^𝑁)(abs‘Σ𝑚 ∈ (0..^𝑢)(𝑋‘(𝐿‘𝑚))) ≤ 𝑟)) → ∃𝑡∃𝑐 ∈ (0[,)+∞)(seq1( + , 𝐹) ⇝ 𝑡 ∧ ∀𝑥 ∈ (𝑀[,)+∞)(abs‘((seq1( + , 𝐹)‘(⌊‘𝑥)) − 𝑡)) ≤ (𝑐 · 𝐵)))
47	17, 46	rexlimddv 3064	1 ⊢ (𝜑 → ∃𝑡∃𝑐 ∈ (0[,)+∞)(seq1( + , 𝐹) ⇝ 𝑡 ∧ ∀𝑥 ∈ (𝑀[,)+∞)(abs‘((seq1( + , 𝐹)‘(⌊‘𝑥)) − 𝑡)) ≤ (𝑐 · 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1054 = wceq 1523 ∃wex 1744 ∈ wcel 2030 ≠ wne 2823 ∀wral 2941 ∃wrex 2942 class class class wbr 4685 ↦ cmpt 4762 ‘cfv 5926 (class class class)co 6690 Fincfn 7997 ℝcr 9973 0cc0 9974 1c1 9975 + caddc 9977 · cmul 9979 +∞cpnf 10109 ≤ cle 10113 − cmin 10304 ℕcn 11058 ℤcz 11415 ℝ⁺crp 11870 [,)cico 12215 ..^cfzo 12504 ⌊cfl 12631 seqcseq 12841 abscabs 14018 ⇝ cli 14259 ⇝_𝑟 crli 14260 Σcsu 14460 Basecbs 15904 0_gc0g 16147 ℤRHomczrh 19896 ℤ/nℤczn 19899 DChrcdchr 25002

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-inf2 8576 ax-cnex 10030 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 ax-pre-mulgt0 10051 ax-pre-sup 10052 ax-addf 10053 ax-mulf 10054

This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-fal 1529 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-int 4508 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-se 5103 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-isom 5935 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-of 6939 df-om 7108 df-1st 7210 df-2nd 7211 df-tpos 7397 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-1o 7605 df-oadd 7609 df-er 7787 df-ec 7789 df-qs 7793 df-map 7901 df-pm 7902 df-en 7998 df-dom 7999 df-sdom 8000 df-fin 8001 df-sup 8389 df-inf 8390 df-oi 8456 df-card 8803 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-div 10723 df-nn 11059 df-2 11117 df-3 11118 df-4 11119 df-5 11120 df-6 11121 df-7 11122 df-8 11123 df-9 11124 df-n0 11331 df-xnn0 11402 df-z 11416 df-dec 11532 df-uz 11726 df-rp 11871 df-ico 12219 df-fz 12365 df-fzo 12505 df-fl 12633 df-mod 12709 df-seq 12842 df-exp 12901 df-hash 13158 df-cj 13883 df-re 13884 df-im 13885 df-sqrt 14019 df-abs 14020 df-limsup 14246 df-clim 14263 df-rlim 14264 df-sum 14461 df-dvds 15028 df-gcd 15264 df-phi 15518 df-struct 15906 df-ndx 15907 df-slot 15908 df-base 15910 df-sets 15911 df-ress 15912 df-plusg 16001 df-mulr 16002 df-starv 16003 df-sca 16004 df-vsca 16005 df-ip 16006 df-tset 16007 df-ple 16008 df-ds 16011 df-unif 16012 df-0g 16149 df-imas 16215 df-qus 16216 df-mgm 17289 df-sgrp 17331 df-mnd 17342 df-mhm 17382 df-grp 17472 df-minusg 17473 df-sbg 17474 df-mulg 17588 df-subg 17638 df-nsg 17639 df-eqg 17640 df-ghm 17705 df-cmn 18241 df-abl 18242 df-mgp 18536 df-ur 18548 df-ring 18595 df-cring 18596 df-oppr 18669 df-dvdsr 18687 df-unit 18688 df-invr 18718 df-rnghom 18763 df-subrg 18826 df-lmod 18913 df-lss 18981 df-lsp 19020 df-sra 19220 df-rgmod 19221 df-lidl 19222 df-rsp 19223 df-2idl 19280 df-cnfld 19795 df-zring 19867 df-zrh 19900 df-zn 19903 df-dchr 25003

This theorem is referenced by: dchrmusumlema 25227 dchrvmasumlema 25234 dchrisum0lema 25248

W3C validator