fourierdlem95 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem95 47029

Description: Algebraic manipulation of integrals, used by other lemmas. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem95.f	⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
fourierdlem95.xre	⊢ (𝜑 → 𝑋 ∈ ℝ)
fourierdlem95.p	⊢ 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = (-π + 𝑋) ∧ (𝑝‘𝑚) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
fourierdlem95.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
fourierdlem95.v	⊢ (𝜑 → 𝑉 ∈ (𝑃‘𝑀))
fourierdlem95.x	⊢ (𝜑 → 𝑋 ∈ ran 𝑉)
fourierdlem95.fcn	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) ∈ (((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))–cn→ℂ))
fourierdlem95.r	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘𝑖)))
fourierdlem95.l	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘(𝑖 + 1))))
fourierdlem95.h	⊢ 𝐻 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)))
fourierdlem95.k	⊢ 𝐾 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 1, (𝑠 / (2 · (sin‘(𝑠 / 2))))))
fourierdlem95.u	⊢ 𝑈 = (𝑠 ∈ (-π[,]π) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠)))
fourierdlem95.s	⊢ 𝑆 = (𝑠 ∈ (-π[,]π) ↦ (sin‘((𝑛 + (1 / 2)) · 𝑠)))
fourierdlem95.g	⊢ 𝐺 = (𝑠 ∈ (-π[,]π) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠)))
fourierdlem95.i	⊢ 𝐼 = (ℝ D 𝐹)
fourierdlem95.ifn	⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐼 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))):((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))⟶ℝ)
fourierdlem95.b	⊢ (𝜑 → 𝐵 ∈ ((𝐼 ↾ (-∞(,)𝑋)) lim_ℂ 𝑋))
fourierdlem95.c	⊢ (𝜑 → 𝐶 ∈ ((𝐼 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
fourierdlem95.y	⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
fourierdlem95.w	⊢ (𝜑 → 𝑊 ∈ ((𝐹 ↾ (-∞(,)𝑋)) lim_ℂ 𝑋))
fourierdlem95.admvol	⊢ (𝜑 → 𝐴 ∈ dom vol)
fourierdlem95.ass	⊢ (𝜑 → 𝐴 ⊆ ((-π[,]π) ∖ {0}))
fourierlemenplusacver2eqitgdirker.e	⊢ 𝐸 = (𝑛 ∈ ℕ ↦ (∫𝐴(𝐺‘𝑠) d𝑠 / π))
fourierdlem95.d	⊢ 𝐷 = (𝑛 ∈ ℕ ↦ (𝑠 ∈ ℝ ↦ if((𝑠 mod (2 · π)) = 0, (((2 · 𝑛) + 1) / (2 · π)), ((sin‘((𝑛 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2)))))))
fourierdlem95.o	⊢ (𝜑 → 𝑂 ∈ ℝ)
fourierdlem95.ifeqo	⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → if(0 < 𝑠, 𝑌, 𝑊) = 𝑂)
fourierdlem95.itgdirker	⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠 = (1 / 2))

**Assertion**
Ref	Expression
fourierdlem95	⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐸‘𝑛) + (𝑂 / 2)) = ∫𝐴((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) d𝑠)

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

Proof of Theorem fourierdlem95 Dummy variable 𝑗 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 490	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
2		fourierdlem95.ass	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ ((-π[,]π) ∖ {0}))
3	2	difss2d 4086	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ⊆ (-π[,]π))
4	3	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ⊆ (-π[,]π))
5	4	sselda 3931	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → 𝑠 ∈ (-π[,]π))
6		fourierdlem95.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
7	6	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐹:ℝ⟶ℝ)
8		fourierdlem95.xre	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ℝ)
9	8	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑋 ∈ ℝ)
10		ioossre 13460	. . . . . . . . . . . . 13 ⊢ (𝑋(,)+∞) ⊆ ℝ
11	10	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑋(,)+∞) ⊆ ℝ)
12	6, 11	fssresd 6742	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ↾ (𝑋(,)+∞)):(𝑋(,)+∞)⟶ℝ)
13		ioosscn 13461	. . . . . . . . . . . 12 ⊢ (𝑋(,)+∞) ⊆ ℂ
14	13	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑋(,)+∞) ⊆ ℂ)
15		eqid 2760	. . . . . . . . . . . 12 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
16		pnfxr 11287	. . . . . . . . . . . . 13 ⊢ +∞ ∈ ℝ^*
17	16	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → +∞ ∈ ℝ^*)
18	8	ltpnfd 13172	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 < +∞)
19	15, 17, 8, 18	lptioo1cn 46474	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(𝑋(,)+∞)))
20		fourierdlem95.y	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
21	12, 14, 19, 20	limcrecl 46459	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ ℝ)
22	21	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑌 ∈ ℝ)
23		ioossre 13460	. . . . . . . . . . . . 13 ⊢ (-∞(,)𝑋) ⊆ ℝ
24	23	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (-∞(,)𝑋) ⊆ ℝ)
25	6, 24	fssresd 6742	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ↾ (-∞(,)𝑋)):(-∞(,)𝑋)⟶ℝ)
26		ioosscn 13461	. . . . . . . . . . . 12 ⊢ (-∞(,)𝑋) ⊆ ℂ
27	26	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (-∞(,)𝑋) ⊆ ℂ)
28		mnfxr 11290	. . . . . . . . . . . . 13 ⊢ -∞ ∈ ℝ^*
29	28	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → -∞ ∈ ℝ^*)
30	8	mnfltd 13175	. . . . . . . . . . . 12 ⊢ (𝜑 → -∞ < 𝑋)
31	15, 29, 8, 30	lptioo2cn 46473	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(-∞(,)𝑋)))
32		fourierdlem95.w	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑊 ∈ ((𝐹 ↾ (-∞(,)𝑋)) lim_ℂ 𝑋))
33	25, 27, 31, 32	limcrecl 46459	. . . . . . . . . 10 ⊢ (𝜑 → 𝑊 ∈ ℝ)
34	33	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑊 ∈ ℝ)
35		fourierdlem95.h	. . . . . . . . 9 ⊢ 𝐻 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 0, (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) / 𝑠)))
36		fourierdlem95.k	. . . . . . . . 9 ⊢ 𝐾 = (𝑠 ∈ (-π[,]π) ↦ if(𝑠 = 0, 1, (𝑠 / (2 · (sin‘(𝑠 / 2))))))
37		fourierdlem95.u	. . . . . . . . 9 ⊢ 𝑈 = (𝑠 ∈ (-π[,]π) ↦ ((𝐻‘𝑠) · (𝐾‘𝑠)))
38	1	nnred 12272	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℝ)
39		fourierdlem95.s	. . . . . . . . 9 ⊢ 𝑆 = (𝑠 ∈ (-π[,]π) ↦ (sin‘((𝑛 + (1 / 2)) · 𝑠)))
40		fourierdlem95.g	. . . . . . . . 9 ⊢ 𝐺 = (𝑠 ∈ (-π[,]π) ↦ ((𝑈‘𝑠) · (𝑆‘𝑠)))
41	7, 9, 22, 34, 35, 36, 37, 38, 39, 40	fourierdlem67 47001	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐺:(-π[,]π)⟶ℝ)
42	41	ffvelcdmda 7077	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ (-π[,]π)) → (𝐺‘𝑠) ∈ ℝ)
43	5, 42	syldan 603	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (𝐺‘𝑠) ∈ ℝ)
44		fourierdlem95.admvol	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ dom vol)
45	44	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ dom vol)
46	41	feqmptd 6946	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐺 = (𝑠 ∈ (-π[,]π) ↦ (𝐺‘𝑠)))
47		fourierdlem95.p	. . . . . . . . 9 ⊢ 𝑃 = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = (-π + 𝑋) ∧ (𝑝‘𝑚) = (π + 𝑋)) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
48		fourierdlem95.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ran 𝑉)
49	48	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑋 ∈ ran 𝑉)
50	20	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑌 ∈ ((𝐹 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
51	32	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑊 ∈ ((𝐹 ↾ (-∞(,)𝑋)) lim_ℂ 𝑋))
52		fourierdlem95.m	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ)
53	52	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑀 ∈ ℕ)
54		fourierdlem95.v	. . . . . . . . . 10 ⊢ (𝜑 → 𝑉 ∈ (𝑃‘𝑀))
55	54	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑉 ∈ (𝑃‘𝑀))
56		fourierdlem95.fcn	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) ∈ (((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))–cn→ℂ))
57	56	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → (𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) ∈ (((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))–cn→ℂ))
58		fourierdlem95.r	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘𝑖)))
59	58	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → 𝑅 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘𝑖)))
60		fourierdlem95.l	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘(𝑖 + 1))))
61	60	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → 𝐿 ∈ ((𝐹 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))) lim_ℂ (𝑉‘(𝑖 + 1))))
62		fveq2 6878	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑖 → (𝑉‘𝑗) = (𝑉‘𝑖))
63	62	oveq1d 7428	. . . . . . . . . 10 ⊢ (𝑗 = 𝑖 → ((𝑉‘𝑗) − 𝑋) = ((𝑉‘𝑖) − 𝑋))
64	63	cbvmptv 5209	. . . . . . . . 9 ⊢ (𝑗 ∈ (0...𝑀) ↦ ((𝑉‘𝑗) − 𝑋)) = (𝑖 ∈ (0...𝑀) ↦ ((𝑉‘𝑖) − 𝑋))
65		eqid 2760	. . . . . . . . 9 ⊢ (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = -π ∧ (𝑝‘𝑚) = π) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))}) = (𝑚 ∈ ℕ ↦ {𝑝 ∈ (ℝ ↑_m (0...𝑚)) ∣ (((𝑝‘0) = -π ∧ (𝑝‘𝑚) = π) ∧ ∀𝑖 ∈ (0..^𝑚)(𝑝‘𝑖) < (𝑝‘(𝑖 + 1)))})
66		fourierdlem95.i	. . . . . . . . 9 ⊢ 𝐼 = (ℝ D 𝐹)
67		fourierdlem95.ifn	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (0..^𝑀)) → (𝐼 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))):((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))⟶ℝ)
68	67	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ (0..^𝑀)) → (𝐼 ↾ ((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))):((𝑉‘𝑖)(,)(𝑉‘(𝑖 + 1)))⟶ℝ)
69		fourierdlem95.b	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ((𝐼 ↾ (-∞(,)𝑋)) lim_ℂ 𝑋))
70	69	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐵 ∈ ((𝐼 ↾ (-∞(,)𝑋)) lim_ℂ 𝑋))
71		fourierdlem95.c	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ((𝐼 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
72	71	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐶 ∈ ((𝐼 ↾ (𝑋(,)+∞)) lim_ℂ 𝑋))
73	47, 7, 49, 50, 51, 35, 36, 37, 38, 39, 40, 53, 55, 57, 59, 61, 64, 65, 66, 68, 70, 72	fourierdlem88 47022	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐺 ∈ 𝐿¹)
74	46, 73	eqeltrrd 2861	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ (-π[,]π) ↦ (𝐺‘𝑠)) ∈ 𝐿¹)
75	4, 45, 42, 74	iblss 26032	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ 𝐴 ↦ (𝐺‘𝑠)) ∈ 𝐿¹)
76	43, 75	itgrecl 26025	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴(𝐺‘𝑠) d𝑠 ∈ ℝ)
77		pire 26692	. . . . . 6 ⊢ π ∈ ℝ
78	77	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → π ∈ ℝ)
79		pipos 26696	. . . . . . 7 ⊢ 0 < π
80	77, 79	gt0ne0ii 11774	. . . . . 6 ⊢ π ≠ 0
81	80	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → π ≠ 0)
82	76, 78, 81	redivcld 12067	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫𝐴(𝐺‘𝑠) d𝑠 / π) ∈ ℝ)
83		fourierlemenplusacver2eqitgdirker.e	. . . . 5 ⊢ 𝐸 = (𝑛 ∈ ℕ ↦ (∫𝐴(𝐺‘𝑠) d𝑠 / π))
84	83	fvmpt2 6998	. . . 4 ⊢ ((𝑛 ∈ ℕ ∧ (∫𝐴(𝐺‘𝑠) d𝑠 / π) ∈ ℝ) → (𝐸‘𝑛) = (∫𝐴(𝐺‘𝑠) d𝑠 / π))
85	1, 82, 84	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐸‘𝑛) = (∫𝐴(𝐺‘𝑠) d𝑠 / π))
86		fourierdlem95.o	. . . . . . 7 ⊢ (𝜑 → 𝑂 ∈ ℝ)
87	86	recnd 11261	. . . . . 6 ⊢ (𝜑 → 𝑂 ∈ ℂ)
88		2cnd 12343	. . . . . 6 ⊢ (𝜑 → 2 ∈ ℂ)
89		2ne0 12371	. . . . . . 7 ⊢ 2 ≠ 0
90	89	a1i 11	. . . . . 6 ⊢ (𝜑 → 2 ≠ 0)
91	87, 88, 90	divrecd 12018	. . . . 5 ⊢ (𝜑 → (𝑂 / 2) = (𝑂 · (1 / 2)))
92	91	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑂 / 2) = (𝑂 · (1 / 2)))
93		fourierdlem95.itgdirker	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠 = (1 / 2))
94	93	eqcomd 2766	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / 2) = ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠)
95	94	oveq2d 7429	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑂 · (1 / 2)) = (𝑂 · ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠))
96	92, 95	eqtrd 2795	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑂 / 2) = (𝑂 · ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠))
97	85, 96	oveq12d 7431	. 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐸‘𝑛) + (𝑂 / 2)) = ((∫𝐴(𝐺‘𝑠) d𝑠 / π) + (𝑂 · ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠)))
98	2	sselda 3931	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → 𝑠 ∈ ((-π[,]π) ∖ {0}))
99	98	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → 𝑠 ∈ ((-π[,]π) ∖ {0}))
100		fourierdlem95.d	. . . . . . . 8 ⊢ 𝐷 = (𝑛 ∈ ℕ ↦ (𝑠 ∈ ℝ ↦ if((𝑠 mod (2 · π)) = 0, (((2 · 𝑛) + 1) / (2 · π)), ((sin‘((𝑛 + (1 / 2)) · 𝑠)) / ((2 · π) · (sin‘(𝑠 / 2)))))))
101		eqid 2760	. . . . . . . 8 ⊢ ((-π[,]π) ∖ {0}) = ((-π[,]π) ∖ {0})
102	6, 8, 21, 33, 100, 35, 36, 37, 39, 40, 101	fourierdlem66 47000	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ ((-π[,]π) ∖ {0})) → (𝐺‘𝑠) = (π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))))
103	99, 102	syldan 603	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (𝐺‘𝑠) = (π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))))
104	103	itgeq2dv 26009	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴(𝐺‘𝑠) d𝑠 = ∫𝐴(π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) d𝑠)
105	104	oveq1d 7428	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫𝐴(𝐺‘𝑠) d𝑠 / π) = (∫𝐴(π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) d𝑠 / π))
106	78	recnd 11261	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → π ∈ ℂ)
107	6	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → 𝐹:ℝ⟶ℝ)
108	8	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → 𝑋 ∈ ℝ)
109		difss 4083	. . . . . . . . . . . . . 14 ⊢ ((-π[,]π) ∖ {0}) ⊆ (-π[,]π)
110	77	renegcli 11543	. . . . . . . . . . . . . . 15 ⊢ -π ∈ ℝ
111		iccssre 13482	. . . . . . . . . . . . . . 15 ⊢ ((-π ∈ ℝ ∧ π ∈ ℝ) → (-π[,]π) ⊆ ℝ)
112	110, 77, 111	mp2an 705	. . . . . . . . . . . . . 14 ⊢ (-π[,]π) ⊆ ℝ
113	109, 112	sstri 3940	. . . . . . . . . . . . 13 ⊢ ((-π[,]π) ∖ {0}) ⊆ ℝ
114	113, 98	sselid 3929	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → 𝑠 ∈ ℝ)
115	108, 114	readdcld 11262	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → (𝑋 + 𝑠) ∈ ℝ)
116	107, 115	ffvelcdmd 7078	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → (𝐹‘(𝑋 + 𝑠)) ∈ ℝ)
117	21, 33	ifcld 4529	. . . . . . . . . . 11 ⊢ (𝜑 → if(0 < 𝑠, 𝑌, 𝑊) ∈ ℝ)
118	117	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → if(0 < 𝑠, 𝑌, 𝑊) ∈ ℝ)
119	116, 118	resubcld 11666	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) ∈ ℝ)
120	119	adantlr 728	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) ∈ ℝ)
121	1	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → 𝑛 ∈ ℕ)
122	114	adantlr 728	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → 𝑠 ∈ ℝ)
123	100	dirkerre 46923	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ ∧ 𝑠 ∈ ℝ) → ((𝐷‘𝑛)‘𝑠) ∈ ℝ)
124	121, 122, 123	syl2anc 596	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((𝐷‘𝑛)‘𝑠) ∈ ℝ)
125	120, 124	remulcld 11263	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) ∈ ℝ)
126	103	eqcomd 2766	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) = (𝐺‘𝑠))
127	126	oveq1d 7428	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) / π) = ((𝐺‘𝑠) / π))
128		picn 26694	. . . . . . . . . . . . 13 ⊢ π ∈ ℂ
129	128	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → π ∈ ℂ)
130	125	recnd 11261	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) ∈ ℂ)
131	80	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → π ≠ 0)
132	129, 130, 129, 131	div23d 12052	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) / π) = ((π / π) · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))))
133	43	recnd 11261	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (𝐺‘𝑠) ∈ ℂ)
134	133, 129, 131	divrec2d 12019	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((𝐺‘𝑠) / π) = ((1 / π) · (𝐺‘𝑠)))
135	127, 132, 134	3eqtr3rd 2804	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((1 / π) · (𝐺‘𝑠)) = ((π / π) · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))))
136	128, 80	dividi 11972	. . . . . . . . . . . 12 ⊢ (π / π) = 1
137	136	a1i 11	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (π / π) = 1)
138	137	oveq1d 7428	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((π / π) · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) = (1 · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))))
139	130	mullidd 11251	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (1 · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) = (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)))
140	135, 138, 139	3eqtrrd 2800	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) = ((1 / π) · (𝐺‘𝑠)))
141	140	mpteq2dva 5198	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ 𝐴 ↦ (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) = (𝑠 ∈ 𝐴 ↦ ((1 / π) · (𝐺‘𝑠))))
142	106, 81	reccld 12008	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (1 / π) ∈ ℂ)
143	142, 43, 75	iblmulc2 26058	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ 𝐴 ↦ ((1 / π) · (𝐺‘𝑠))) ∈ 𝐿¹)
144	141, 143	eqeltrd 2860	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ 𝐴 ↦ (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) ∈ 𝐿¹)
145	106, 125, 144	itgmulc2 26061	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (π · ∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠) = ∫𝐴(π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) d𝑠)
146	145	eqcomd 2766	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴(π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) d𝑠 = (π · ∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠))
147	146	oveq1d 7428	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫𝐴(π · (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠))) d𝑠 / π) = ((π · ∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠) / π))
148	125, 144	itgcl 26011	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠 ∈ ℂ)
149	148, 106, 81	divcan3d 12020	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((π · ∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠) / π) = ∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠)
150	105, 147, 149	3eqtrd 2799	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫𝐴(𝐺‘𝑠) d𝑠 / π) = ∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠)
151	87	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝑂 ∈ ℂ)
152	112	sseli 3927	. . . . . . 7 ⊢ (𝑠 ∈ (-π[,]π) → 𝑠 ∈ ℝ)
153	152, 123	sylan2 605	. . . . . 6 ⊢ ((𝑛 ∈ ℕ ∧ 𝑠 ∈ (-π[,]π)) → ((𝐷‘𝑛)‘𝑠) ∈ ℝ)
154	153	adantll 727	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ (-π[,]π)) → ((𝐷‘𝑛)‘𝑠) ∈ ℝ)
155	110	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → -π ∈ ℝ)
156		ax-resscn 11181	. . . . . . . . . 10 ⊢ ℝ ⊆ ℂ
157	156	a1i 11	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → ℝ ⊆ ℂ)
158		ssid 3953	. . . . . . . . 9 ⊢ ℂ ⊆ ℂ
159		cncfss 25127	. . . . . . . . 9 ⊢ ((ℝ ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((-π[,]π)–cn→ℝ) ⊆ ((-π[,]π)–cn→ℂ))
160	157, 158, 159	sylancl 598	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → ((-π[,]π)–cn→ℝ) ⊆ ((-π[,]π)–cn→ℂ))
161		eqid 2760	. . . . . . . . 9 ⊢ (𝑠 ∈ ℝ ↦ ((𝐷‘𝑛)‘𝑠)) = (𝑠 ∈ ℝ ↦ ((𝐷‘𝑛)‘𝑠))
162	100	dirkerf 46925	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℕ → (𝐷‘𝑛):ℝ⟶ℝ)
163	162	feqmptd 6946	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (𝐷‘𝑛) = (𝑠 ∈ ℝ ↦ ((𝐷‘𝑛)‘𝑠)))
164	100	dirkercncf 46935	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ → (𝐷‘𝑛) ∈ (ℝ–cn→ℝ))
165	163, 164	eqeltrrd 2861	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (𝑠 ∈ ℝ ↦ ((𝐷‘𝑛)‘𝑠)) ∈ (ℝ–cn→ℝ))
166	112	a1i 11	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → (-π[,]π) ⊆ ℝ)
167		ssid 3953	. . . . . . . . . 10 ⊢ ℝ ⊆ ℝ
168	167	a1i 11	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ → ℝ ⊆ ℝ)
169	161, 165, 166, 168, 153	cncfmptssg 46699	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ → (𝑠 ∈ (-π[,]π) ↦ ((𝐷‘𝑛)‘𝑠)) ∈ ((-π[,]π)–cn→ℝ))
170	160, 169	sseldd 3932	. . . . . . 7 ⊢ (𝑛 ∈ ℕ → (𝑠 ∈ (-π[,]π) ↦ ((𝐷‘𝑛)‘𝑠)) ∈ ((-π[,]π)–cn→ℂ))
171	170	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ (-π[,]π) ↦ ((𝐷‘𝑛)‘𝑠)) ∈ ((-π[,]π)–cn→ℂ))
172		cniccibl 26068	. . . . . 6 ⊢ ((-π ∈ ℝ ∧ π ∈ ℝ ∧ (𝑠 ∈ (-π[,]π) ↦ ((𝐷‘𝑛)‘𝑠)) ∈ ((-π[,]π)–cn→ℂ)) → (𝑠 ∈ (-π[,]π) ↦ ((𝐷‘𝑛)‘𝑠)) ∈ 𝐿¹)
173	155, 78, 171, 172	syl3anc 1398	. . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ (-π[,]π) ↦ ((𝐷‘𝑛)‘𝑠)) ∈ 𝐿¹)
174	4, 45, 154, 173	iblss 26032	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ 𝐴 ↦ ((𝐷‘𝑛)‘𝑠)) ∈ 𝐿¹)
175	151, 124, 174	itgmulc2 26061	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑂 · ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠) = ∫𝐴(𝑂 · ((𝐷‘𝑛)‘𝑠)) d𝑠)
176	150, 175	oveq12d 7431	. 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((∫𝐴(𝐺‘𝑠) d𝑠 / π) + (𝑂 · ∫𝐴((𝐷‘𝑛)‘𝑠) d𝑠)) = (∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠 + ∫𝐴(𝑂 · ((𝐷‘𝑛)‘𝑠)) d𝑠))
177	86	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → 𝑂 ∈ ℝ)
178	177, 124	remulcld 11263	. . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (𝑂 · ((𝐷‘𝑛)‘𝑠)) ∈ ℝ)
179	151, 124, 174	iblmulc2 26058	. . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝑠 ∈ 𝐴 ↦ (𝑂 · ((𝐷‘𝑛)‘𝑠))) ∈ 𝐿¹)
180	125, 144, 178, 179	itgadd 26052	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴((((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) + (𝑂 · ((𝐷‘𝑛)‘𝑠))) d𝑠 = (∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠 + ∫𝐴(𝑂 · ((𝐷‘𝑛)‘𝑠)) d𝑠))
181		fourierdlem95.ifeqo	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → if(0 < 𝑠, 𝑌, 𝑊) = 𝑂)
182	181	eqcomd 2766	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → 𝑂 = if(0 < 𝑠, 𝑌, 𝑊))
183	182	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → 𝑂 = if(0 < 𝑠, 𝑌, 𝑊))
184	183	oveq1d 7428	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (𝑂 · ((𝐷‘𝑛)‘𝑠)) = (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠)))
185	184	oveq2d 7429	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) + (𝑂 · ((𝐷‘𝑛)‘𝑠))) = ((((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) + (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠))))
186	116	recnd 11261	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → (𝐹‘(𝑋 + 𝑠)) ∈ ℂ)
187	186	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (𝐹‘(𝑋 + 𝑠)) ∈ ℂ)
188	118	recnd 11261	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ 𝐴) → if(0 < 𝑠, 𝑌, 𝑊) ∈ ℂ)
189	188	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → if(0 < 𝑠, 𝑌, 𝑊) ∈ ℂ)
190	124	recnd 11261	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((𝐷‘𝑛)‘𝑠) ∈ ℂ)
191	187, 189, 190	subdird 11695	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) = (((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) − (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠))))
192	191	oveq1d 7428	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) + (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠))) = ((((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) − (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠))) + (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠))))
193	187, 190	mulcld 11253	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) ∈ ℂ)
194	189, 190	mulcld 11253	. . . . . 6 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠)) ∈ ℂ)
195	193, 194	npcand 11597	. . . . 5 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) − (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠))) + (if(0 < 𝑠, 𝑌, 𝑊) · ((𝐷‘𝑛)‘𝑠))) = ((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)))
196	185, 192, 195	3eqtrd 2799	. . . 4 ⊢ (((𝜑 ∧ 𝑛 ∈ ℕ) ∧ 𝑠 ∈ 𝐴) → ((((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) + (𝑂 · ((𝐷‘𝑛)‘𝑠))) = ((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)))
197	196	itgeq2dv 26009	. . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ∫𝐴((((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) + (𝑂 · ((𝐷‘𝑛)‘𝑠))) d𝑠 = ∫𝐴((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) d𝑠)
198	180, 197	eqtr3d 2797	. 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫𝐴(((𝐹‘(𝑋 + 𝑠)) − if(0 < 𝑠, 𝑌, 𝑊)) · ((𝐷‘𝑛)‘𝑠)) d𝑠 + ∫𝐴(𝑂 · ((𝐷‘𝑛)‘𝑠)) d𝑠) = ∫𝐴((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) d𝑠)
199	97, 176, 198	3eqtrd 2799	1 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((𝐸‘𝑛) + (𝑂 / 2)) = ∫𝐴((𝐹‘(𝑋 + 𝑠)) · ((𝐷‘𝑛)‘𝑠)) d𝑠)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∀wral 3076 {crab 3412 ∖ cdif 3896 ⊆ wss 3899 ifcif 4482 {csn 4584 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5655 ran crn 5656 ↾ cres 5657 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 ↑_m cmap 8826 ℂcc 11122 ℝcr 11123 0cc0 11124 1c1 11125 + caddc 11127 · cmul 11129 +∞cpnf 11264 -∞cmnf 11265 ℝ^*cxr 11266 < clt 11267 − cmin 11465 -cneg 11466 / cdiv 11895 ℕcn 12257 2c2 12319 (,)cioo 13398 [,]cicc 13401 ...cfz 13561 ..^cfzo 13709 mod cmo 13930 sincsin 16149 πcpi 16152 TopOpenctopn 17506 ℂ_fldccnfld 21585 –cn→ccncf 25104 volcvol 25691 𝐿¹cibl 25845 ∫citg 25846 lim_ℂ climc 26089 D cdv 26090

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-inf2 9620 ax-cc 10437 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 ax-addf 11203

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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-symdif 4199 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-disj 5071 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-of 7678 df-ofr 7679 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8159 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-oadd 8459 df-omul 8460 df-er 8696 df-map 8828 df-pm 8829 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-fsupp 9332 df-fi 9381 df-sup 9412 df-inf 9413 df-oi 9482 df-dju 9906 df-card 9944 df-acn 9947 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-q 12998 df-rp 13043 df-xneg 13163 df-xadd 13164 df-xmul 13165 df-ioo 13402 df-ioc 13403 df-ico 13404 df-icc 13405 df-fz 13562 df-fzo 13710 df-fl 13853 df-mod 13931 df-seq 14066 df-exp 14126 df-fac 14338 df-bc 14367 df-hash 14395 df-shft 15140 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-limsup 15558 df-clim 15575 df-rlim 15576 df-sum 15774 df-ef 16153 df-sin 16155 df-cos 16156 df-pi 16158 df-struct 17239 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-ress 17323 df-plusg 17355 df-mulr 17356 df-starv 17357 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-unif 17365 df-hom 17366 df-cco 17367 df-rest 17507 df-topn 17508 df-0g 17526 df-gsum 17527 df-topgen 17528 df-pt 17529 df-prds 17532 df-xrs 17588 df-qtop 17593 df-imas 17594 df-xps 17596 df-mre 17670 df-mrc 17671 df-acs 17673 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-submnd 18892 df-mulg 19191 df-cntz 19444 df-cmn 19909 df-psmet 21577 df-xmet 21578 df-met 21579 df-bl 21580 df-mopn 21581 df-fbas 21582 df-fg 21583 df-cnfld 21586 df-top 23119 df-topon 23136 df-topsp 23158 df-bases 23171 df-cld 23244 df-ntr 23245 df-cls 23246 df-nei 23323 df-lp 23361 df-perf 23362 df-cn 23452 df-cnp 23453 df-t1 23539 df-haus 23540 df-cmp 23612 df-tx 23788 df-hmeo 23981 df-fil 24072 df-fm 24164 df-flim 24165 df-flf 24166 df-xms 24546 df-ms 24547 df-tms 24548 df-cncf 25106 df-ovol 25692 df-vol 25693 df-mbf 25847 df-itg1 25848 df-itg2 25849 df-ibl 25850 df-itg 25851 df-0p 25898 df-limc 26093 df-dv 26094

This theorem is used by: fourierdlem103 47037 fourierdlem104 47038

W3C validator