fourierdlem85 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > fourierdlem85		Structured version Visualization version GIF version

Theorem fourierdlem85 46200

Description: Limit of the function 𝐺 at the lower bounds of the partition intervals. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem85.p	⊢ 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = (-π + 𝑋) ∧ (𝑝‘𝑚) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
fourierdlem85.f	⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
fourierdlem85.x	⊢ (𝜑 → 𝑋 ∈ ran 𝑉)
fourierdlem85.y	⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
fourierdlem85.w	⊢ (𝜑 → 𝑊 ∈ ℝ)
fourierdlem85.h	⊢ 𝐻 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)))
fourierdlem85.k	⊢ 𝐾 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 1, (𝑠 / (2 · (sin‘(𝑠 / 2))))))
fourierdlem85.u	⊢ 𝑈 = (𝑠 ∈ (-π[,]π) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠)))
fourierdlem85.n	⊢ (𝜑 → 𝑁 ∈ ℝ)
fourierdlem85.s	⊢ 𝑆 = (𝑠 ∈ (-π[,]π) ↦ (sin‘((𝑁 + (1 / 2)) · 𝑠)))
fourierdlem85.g	⊢ 𝐺 = (𝑠 ∈ (-π[,]π) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠)))
fourierdlem85.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
fourierdlem85.v	⊢ (𝜑 → 𝑉 ∈ (𝑃‘𝑀))
fourierdlem85.r	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘𝑖)))
fourierdlem85.q	⊢ 𝑄 = (𝑖 ∈ (0...𝑀) ↦ ((𝑉‘𝑖) − 𝑋))
fourierdlem85.o	⊢ 𝑂 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = -π ∧ (𝑝‘𝑚) = π) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
fourierdlem85.i	⊢ 𝐼 = (ℝ D 𝐹)
fourierdlem85.ifn	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐼 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))):((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))⟶ℂ)
fourierdlem85.e	⊢ (𝜑 → 𝐸 ∈ ((𝐼 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
fourierdlem85.a	⊢ 𝐴 = ((if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) · (𝐾‘(𝑄‘𝑖))) · (𝑆‘(𝑄‘𝑖)))

**Assertion**
Ref	Expression
fourierdlem85	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐴 ∈ ((𝐺 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)))

Distinct variable groups: 𝐸,𝑠 𝐹,𝑠 𝐻,𝑠 𝐾,𝑠 𝑖,𝑀,𝑚,𝑝 𝑀,𝑠,𝑖 𝑁,𝑠 𝑄,𝑖,𝑝 𝑄,𝑠 𝑅,𝑠 𝑆,𝑠 𝑖,𝑉,𝑝 𝑉,𝑠 𝑊,𝑠 𝑖,𝑋,𝑚,𝑝 𝑋,𝑠 𝑌,𝑠 𝜑,𝑖,𝑠 Allowed substitution hints: 𝜑(𝑚,𝑝) 𝐴(𝑖,𝑚,𝑠,𝑝) 𝑃(𝑖,𝑚,𝑠,𝑝) 𝑄(𝑚) 𝑅(𝑖,𝑚,𝑝) 𝑆(𝑖,𝑚,𝑝) 𝑈(𝑖,𝑚,𝑠,𝑝) 𝐸(𝑖,𝑚,𝑝) 𝐹(𝑖,𝑚,𝑝) 𝐺(𝑖,𝑚,𝑠,𝑝) 𝐻(𝑖,𝑚,𝑝) 𝐼(𝑖,𝑚,𝑠,𝑝) 𝐾(𝑖,𝑚,𝑝) 𝑁(𝑖,𝑚,𝑝) 𝑂(𝑖,𝑚,𝑠,𝑝) 𝑉(𝑚) 𝑊(𝑖,𝑚,𝑝) 𝑌(𝑖,𝑚,𝑝)

**Proof of Theorem fourierdlem85**
Step	Hyp	Ref	Expression
1		fourierdlem85.a	. . 3 ⊢ 𝐴 = ((if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) · (𝐾‘(𝑄‘𝑖))) · (𝑆‘(𝑄‘𝑖)))
2		eqid 2736	. . . 4 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑈‘𝑠)) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑈‘𝑠))
3		eqid 2736	. . . 4 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑆‘𝑠)) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑆‘𝑠))
4		eqid 2736	. . . 4 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠)))
5		pire 26423	. . . . . . . . . . 11 ⊢ π ∈ ℝ
6	5	renegcli 11549	. . . . . . . . . 10 ⊢ -π ∈ ℝ
7	6	rexri 11298	. . . . . . . . 9 ⊢ -π ∈ ℝ^*
8	7	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → -π ∈ ℝ^*)
9	5	rexri 11298	. . . . . . . . 9 ⊢ π ∈ ℝ^*
10	9	a1i 11	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → π ∈ ℝ^*)
11		fourierdlem85.o	. . . . . . . . . . 11 ⊢ 𝑂 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = -π ∧ (𝑝‘𝑚) = π) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
12		fourierdlem85.m	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℕ)
13	5	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → π ∈ ℝ)
14	13	renegcld 11669	. . . . . . . . . . . 12 ⊢ (𝜑 → -π ∈ ℝ)
15		fourierdlem85.v	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑉 ∈ (𝑃‘𝑀))
16		fourierdlem85.p	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = (-π + 𝑋) ∧ (𝑝‘𝑚) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
17	16	fourierdlem2 46118	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℕ → (𝑉 ∈ (𝑃‘𝑀) ↔ (𝑉 ∈ (ℝ ↑_m (0...𝑀)) ∧ (((𝑉‘0) = (-π + 𝑋) ∧ (𝑉‘𝑀) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑉‘𝑖) < (𝑉‘(𝑖 + 1))))))
18	12, 17	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑉 ∈ (𝑃‘𝑀) ↔ (𝑉 ∈ (ℝ ↑_m (0...𝑀)) ∧ (((𝑉‘0) = (-π + 𝑋) ∧ (𝑉‘𝑀) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑉‘𝑖) < (𝑉‘(𝑖 + 1))))))
19	15, 18	mpbid 232	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑉 ∈ (ℝ ↑_m (0...𝑀)) ∧ (((𝑉‘0) = (-π + 𝑋) ∧ (𝑉‘𝑀) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑀)(𝑉‘𝑖) < (𝑉‘(𝑖 + 1)))))
20	19	simpld 494	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑉 ∈ (ℝ ↑_m (0...𝑀)))
21		elmapi 8868	. . . . . . . . . . . . . 14 ⊢ (𝑉 ∈ (ℝ ↑_m (0...𝑀)) → 𝑉:(0...𝑀)⟶ℝ)
22		frn 6718	. . . . . . . . . . . . . 14 ⊢ (𝑉:(0...𝑀)⟶ℝ → ran 𝑉 ⊆ ℝ)
23	20, 21, 22	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝑉 ⊆ ℝ)
24		fourierdlem85.x	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ∈ ran 𝑉)
25	23, 24	sseldd 3964	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ∈ ℝ)
26		fourierdlem85.q	. . . . . . . . . . . 12 ⊢ 𝑄 = (𝑖 ∈ (0...𝑀) ↦ ((𝑉‘𝑖) − 𝑋))
27	14, 13, 25, 16, 11, 12, 15, 26	fourierdlem14 46130	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑄 ∈ (𝑂‘𝑀))
28	11, 12, 27	fourierdlem15 46131	. . . . . . . . . 10 ⊢ (𝜑 → 𝑄:(0...𝑀)⟶(-π[,]π))
29	28	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑄:(0...𝑀)⟶(-π[,]π))
30	29	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑄:(0...𝑀)⟶(-π[,]π))
31		simplr 768	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑖 ∈ (0..^𝑀))
32	8, 10, 30, 31	fourierdlem8 46124	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))) ⊆ (-π[,]π))
33		ioossicc 13455	. . . . . . . . 9 ⊢ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1)))
34	33	sseli 3959	. . . . . . . 8 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) → 𝑠 ∈ ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))))
35	34	adantl 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑠 ∈ ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))))
36	32, 35	sseldd 3964	. . . . . 6 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑠 ∈ (-π[,]π))
37		fourierdlem85.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
38		ioossre 13429	. . . . . . . . . . . . . 14 ⊢ (𝑋(,)+∞) ⊆ ℝ
39	38	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋(,)+∞) ⊆ ℝ)
40	37, 39	fssresd 6750	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 ↾ (𝑋(,)+∞)):(𝑋(,)+∞)⟶ℝ)
41		ax-resscn 11191	. . . . . . . . . . . . 13 ⊢ ℝ ⊆ ℂ
42	39, 41	sstrdi 3976	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑋(,)+∞) ⊆ ℂ)
43		eqid 2736	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
44		pnfxr 11294	. . . . . . . . . . . . . 14 ⊢ +∞ ∈ ℝ^*
45	44	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → +∞ ∈ ℝ^*)
46	25	ltpnfd 13142	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 < +∞)
47	43, 45, 25, 46	lptioo1cn 45655	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(𝑋(,)+∞)))
48		fourierdlem85.y	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
49	40, 42, 47, 48	limcrecl 45638	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑌 ∈ ℝ)
50		fourierdlem85.w	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ ℝ)
51		fourierdlem85.h	. . . . . . . . . . 11 ⊢ 𝐻 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)))
52	37, 25, 49, 50, 51	fourierdlem9 46125	. . . . . . . . . 10 ⊢ (𝜑 → 𝐻:(-π[,]π)⟶ℝ)
53	41	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → ℝ ⊆ ℂ)
54	52, 53	fssd 6728	. . . . . . . . 9 ⊢ (𝜑 → 𝐻:(-π[,]π)⟶ℂ)
55	54	ad2antrr 726	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝐻:(-π[,]π)⟶ℂ)
56	55, 36	ffvelcdmd 7080	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (𝐻‘𝑠) ∈ ℂ)
57		fourierdlem85.k	. . . . . . . . . . 11 ⊢ 𝐾 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 1, (𝑠 / (2 · (sin‘(𝑠 / 2))))))
58	57	fourierdlem43 46159	. . . . . . . . . 10 ⊢ 𝐾:(-π[,]π)⟶ℝ
59	58	a1i 11	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝐾:(-π[,]π)⟶ℝ)
60	59, 36	ffvelcdmd 7080	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (𝐾‘𝑠) ∈ ℝ)
61	60	recnd 11268	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (𝐾‘𝑠) ∈ ℂ)
62	56, 61	mulcld 11260	. . . . . 6 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → ((𝐻‘𝑠) · (𝐾‘𝑠)) ∈ ℂ)
63		fourierdlem85.u	. . . . . . 7 ⊢ 𝑈 = (𝑠 ∈ (-π[,]π) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠)))
64	63	fvmpt2 7002	. . . . . 6 ⊢ ((𝑠 ∈ (-π[,]π) ∧ ((𝐻‘𝑠) · (𝐾‘𝑠)) ∈ ℂ) → (𝑈‘𝑠) = ((𝐻‘𝑠) · (𝐾‘𝑠)))
65	36, 62, 64	syl2anc 584	. . . . 5 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (𝑈‘𝑠) = ((𝐻‘𝑠) · (𝐾‘𝑠)))
66	65, 62	eqeltrd 2835	. . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (𝑈‘𝑠) ∈ ℂ)
67		fourierdlem85.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℝ)
68		fourierdlem85.s	. . . . . . . . . 10 ⊢ 𝑆 = (𝑠 ∈ (-π[,]π) ↦ (sin‘((𝑁 + (1 / 2)) · 𝑠)))
69	67, 68	fourierdlem18 46134	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ ((-π[,]π)–cn→ℝ))
70		cncff 24842	. . . . . . . . 9 ⊢ (𝑆 ∈ ((-π[,]π)–cn→ℝ) → 𝑆:(-π[,]π)⟶ℝ)
71	69, 70	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑆:(-π[,]π)⟶ℝ)
72	71	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑆:(-π[,]π)⟶ℝ)
73	72	adantr 480	. . . . . 6 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → 𝑆:(-π[,]π)⟶ℝ)
74	73, 36	ffvelcdmd 7080	. . . . 5 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (𝑆‘𝑠) ∈ ℝ)
75	74	recnd 11268	. . . 4 ⊢ (((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) ∧ 𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) → (𝑆‘𝑠) ∈ ℂ)
76		eqid 2736	. . . . . 6 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐻‘𝑠)) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐻‘𝑠))
77		eqid 2736	. . . . . 6 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐾‘𝑠)) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐾‘𝑠))
78		eqid 2736	. . . . . 6 ⊢ (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠))) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠)))
79		fourierdlem85.r	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘𝑖)))
80		fourierdlem85.i	. . . . . . . 8 ⊢ 𝐼 = (ℝ D 𝐹)
81		fourierdlem85.ifn	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐼 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))):((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))⟶ℂ)
82		fourierdlem85.e	. . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ ((𝐼 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
83		eqid 2736	. . . . . . . 8 ⊢ if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) = if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖)))
84	25, 16, 37, 24, 48, 50, 51, 12, 15, 79, 26, 11, 80, 81, 82, 83	fourierdlem75 46190	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) ∈ ((𝐻 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)))
85	52	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐻:(-π[,]π)⟶ℝ)
86	7	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → -π ∈ ℝ^*)
87	9	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → π ∈ ℝ^*)
88		simpr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0..^𝑀))
89	86, 87, 29, 88	fourierdlem8 46124	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)[,](𝑄‘(𝑖 + 1))) ⊆ (-π[,]π))
90	33, 89	sstrid 3975	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ⊆ (-π[,]π))
91	85, 90	feqresmpt 6953	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐻 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐻‘𝑠)))
92	91	oveq1d 7425	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝐻 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)) = ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐻‘𝑠)) lim_ℂ (𝑄‘𝑖)))
93	84, 92	eleqtrd 2837	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) ∈ ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐻‘𝑠)) lim_ℂ (𝑄‘𝑖)))
94		limcresi 25843	. . . . . . . 8 ⊢ (𝐾 lim_ℂ (𝑄‘𝑖)) ⊆ ((𝐾 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖))
95		ssid 3986	. . . . . . . . . . . 12 ⊢ ℂ ⊆ ℂ
96		cncfss 24848	. . . . . . . . . . . 12 ⊢ ((ℝ ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((-π[,]π)–cn→ℝ) ⊆ ((-π[,]π)–cn→ℂ))
97	41, 95, 96	mp2an 692	. . . . . . . . . . 11 ⊢ ((-π[,]π)–cn→ℝ) ⊆ ((-π[,]π)–cn→ℂ)
98	57	fourierdlem62 46177	. . . . . . . . . . 11 ⊢ 𝐾 ∈ ((-π[,]π)–cn→ℝ)
99	97, 98	sselii 3960	. . . . . . . . . 10 ⊢ 𝐾 ∈ ((-π[,]π)–cn→ℂ)
100	99	a1i 11	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐾 ∈ ((-π[,]π)–cn→ℂ))
101		elfzofz 13697	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (0..^𝑀) → 𝑖 ∈ (0...𝑀))
102	101	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑖 ∈ (0...𝑀))
103	29, 102	ffvelcdmd 7080	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑄‘𝑖) ∈ (-π[,]π))
104	100, 103	cnlimci 25847	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐾‘(𝑄‘𝑖)) ∈ (𝐾 lim_ℂ (𝑄‘𝑖)))
105	94, 104	sselid 3961	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐾‘(𝑄‘𝑖)) ∈ ((𝐾 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)))
106		cncff 24842	. . . . . . . . . 10 ⊢ (𝐾 ∈ ((-π[,]π)–cn→ℂ) → 𝐾:(-π[,]π)⟶ℂ)
107	99, 106	mp1i 13	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐾:(-π[,]π)⟶ℂ)
108	107, 90	feqresmpt 6953	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐾 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐾‘𝑠)))
109	108	oveq1d 7425	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝐾 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)) = ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐾‘𝑠)) lim_ℂ (𝑄‘𝑖)))
110	105, 109	eleqtrd 2837	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐾‘(𝑄‘𝑖)) ∈ ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝐾‘𝑠)) lim_ℂ (𝑄‘𝑖)))
111	76, 77, 78, 56, 61, 93, 110	mullimc 45625	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) · (𝐾‘(𝑄‘𝑖))) ∈ ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠))) lim_ℂ (𝑄‘𝑖)))
112	65	mpteq2dva 5219	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑈‘𝑠)) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠))))
113	112	oveq1d 7425	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑈‘𝑠)) lim_ℂ (𝑄‘𝑖)) = ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠))) lim_ℂ (𝑄‘𝑖)))
114	111, 113	eleqtrrd 2838	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) · (𝐾‘(𝑄‘𝑖))) ∈ ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑈‘𝑠)) lim_ℂ (𝑄‘𝑖)))
115		limcresi 25843	. . . . . 6 ⊢ (𝑆 lim_ℂ (𝑄‘𝑖)) ⊆ ((𝑆 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖))
116	69	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑆 ∈ ((-π[,]π)–cn→ℝ))
117	116, 103	cnlimci 25847	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑆‘(𝑄‘𝑖)) ∈ (𝑆 lim_ℂ (𝑄‘𝑖)))
118	115, 117	sselid 3961	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑆‘(𝑄‘𝑖)) ∈ ((𝑆 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)))
119	72, 90	feqresmpt 6953	. . . . . 6 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑆 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑆‘𝑠)))
120	119	oveq1d 7425	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑆 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)) = ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑆‘𝑠)) lim_ℂ (𝑄‘𝑖)))
121	118, 120	eleqtrd 2837	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑆‘(𝑄‘𝑖)) ∈ ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ (𝑆‘𝑠)) lim_ℂ (𝑄‘𝑖)))
122	2, 3, 4, 66, 75, 114, 121	mullimc 45625	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((if((𝑉‘𝑖) = 𝑋, 𝐸, ((𝑅 − if((𝑉‘𝑖) < 𝑋, 𝑊, 𝑌)) / (𝑄‘𝑖))) · (𝐾‘(𝑄‘𝑖))) · (𝑆‘(𝑄‘𝑖))) ∈ ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))) lim_ℂ (𝑄‘𝑖)))
123	1, 122	eqeltrid 2839	. 2 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐴 ∈ ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))) lim_ℂ (𝑄‘𝑖)))
124		fourierdlem85.g	. . . . 5 ⊢ 𝐺 = (𝑠 ∈ (-π[,]π) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠)))
125	124	reseq1i 5967	. . . 4 ⊢ (𝐺 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) = ((𝑠 ∈ (-π[,]π) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))) ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))))
126	90	resmptd 6032	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑠 ∈ (-π[,]π) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))) ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) = (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))))
127	125, 126	eqtr2id 2784	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))) = (𝐺 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))))
128	127	oveq1d 7425	. 2 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → ((𝑠 ∈ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1))) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠))) lim_ℂ (𝑄‘𝑖)) = ((𝐺 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)))
129	123, 128	eleqtrd 2837	1 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐴 ∈ ((𝐺 ↾ ((𝑄‘𝑖)(,)(𝑄‘(𝑖 + 1)))) lim_ℂ (𝑄‘𝑖)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3052 {crab 3420 ⊆ wss 3931 ifcif 4505 class class class wbr 5124 ↦ cmpt 5206 ran crn 5660 ↾ cres 5661 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ↑_m cmap 8845 ℂcc 11132 ℝcr 11133 0cc0 11134 1c1 11135 + caddc 11137 · cmul 11139 +∞cpnf 11271 ℝ^*cxr 11273 < clt 11274 − cmin 11471 -cneg 11472 / cdiv 11899 ℕcn 12245 2c2 12300 (,)cioo 13367 [,]cicc 13370 ...cfz 13529 ..^cfzo 13676 sincsin 16084 πcpi 16087 TopOpenctopn 17440 ℂ_fldccnfld 21320 –cn→ccncf 24825 lim_ℂ climc 25820 D cdv 25821

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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-inf2 9660 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-pre-sup 11212 ax-addf 11213

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 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-iin 4975 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-of 7676 df-om 7867 df-1st 7993 df-2nd 7994 df-supp 8165 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-2o 8486 df-er 8724 df-map 8847 df-pm 8848 df-ixp 8917 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-fsupp 9379 df-fi 9428 df-sup 9459 df-inf 9460 df-oi 9529 df-card 9958 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-div 11900 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-7 12313 df-8 12314 df-9 12315 df-n0 12507 df-z 12594 df-dec 12714 df-uz 12858 df-q 12970 df-rp 13014 df-xneg 13133 df-xadd 13134 df-xmul 13135 df-ioo 13371 df-ioc 13372 df-ico 13373 df-icc 13374 df-fz 13530 df-fzo 13677 df-fl 13814 df-mod 13892 df-seq 14025 df-exp 14085 df-fac 14297 df-bc 14326 df-hash 14354 df-shft 15091 df-cj 15123 df-re 15124 df-im 15125 df-sqrt 15259 df-abs 15260 df-limsup 15492 df-clim 15509 df-rlim 15510 df-sum 15708 df-ef 16088 df-sin 16090 df-cos 16091 df-pi 16093 df-struct 17171 df-sets 17188 df-slot 17206 df-ndx 17218 df-base 17234 df-ress 17257 df-plusg 17289 df-mulr 17290 df-starv 17291 df-sca 17292 df-vsca 17293 df-ip 17294 df-tset 17295 df-ple 17296 df-ds 17298 df-unif 17299 df-hom 17300 df-cco 17301 df-rest 17441 df-topn 17442 df-0g 17460 df-gsum 17461 df-topgen 17462 df-pt 17463 df-prds 17466 df-xrs 17521 df-qtop 17526 df-imas 17527 df-xps 17529 df-mre 17603 df-mrc 17604 df-acs 17606 df-mgm 18623 df-sgrp 18702 df-mnd 18718 df-submnd 18767 df-mulg 19056 df-cntz 19305 df-cmn 19768 df-psmet 21312 df-xmet 21313 df-met 21314 df-bl 21315 df-mopn 21316 df-fbas 21317 df-fg 21318 df-cnfld 21321 df-top 22837 df-topon 22854 df-topsp 22876 df-bases 22889 df-cld 22962 df-ntr 22963 df-cls 22964 df-nei 23041 df-lp 23079 df-perf 23080 df-cn 23170 df-cnp 23171 df-t1 23257 df-haus 23258 df-cmp 23330 df-tx 23505 df-hmeo 23698 df-fil 23789 df-fm 23881 df-flim 23882 df-flf 23883 df-xms 24264 df-ms 24265 df-tms 24266 df-cncf 24827 df-limc 25824 df-dv 25825

This theorem is referenced by: (None)

W3C validator