fourierdlem61 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem61 40894

Description: Given a differentiable function 𝐹, with finite limit of the derivative at 𝐴 the derived function 𝐻 has a limit at 0. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem61.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem61.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem61.altb	⊢ (𝜑 → 𝐴 < 𝐵)
fourierdlem61.f	⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
fourierdlem61.y	⊢ (𝜑 → 𝑌 ∈ (𝐹 lim_ℂ 𝐴))
fourierdlem61.g	⊢ 𝐺 = (ℝ D 𝐹)
fourierdlem61.domg	⊢ (𝜑 → dom 𝐺 = (𝐴(,)𝐵))
fourierdlem61.e	⊢ (𝜑 → 𝐸 ∈ (𝐺 lim_ℂ 𝐴))
fourierdlem61.h	⊢ 𝐻 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((𝐹‘(𝐴 + 𝑠)) − 𝑌) / 𝑠))
fourierdlem61.n	⊢ 𝑁 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
fourierdlem61.d	⊢ 𝐷 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)

**Assertion**
Ref	Expression
fourierdlem61	⊢ (𝜑 → 𝐸 ∈ (𝐻 lim_ℂ 0))

Distinct variable groups: 𝐴,𝑠 𝐵,𝑠 𝐷,𝑠 𝐸,𝑠 𝐹,𝑠 𝐺,𝑠 𝑁,𝑠 𝑌,𝑠 𝜑,𝑠 Allowed substitution hint: 𝐻(𝑠)

Proof of Theorem fourierdlem61 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		0red 10241	. . 3 ⊢ (𝜑 → 0 ∈ ℝ)
2		fourierdlem61.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
3		fourierdlem61.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4	2, 3	resubcld 10658	. . . 4 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℝ)
5	4	rexrd 10289	. . 3 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℝ^*)
6		fourierdlem61.altb	. . . 4 ⊢ (𝜑 → 𝐴 < 𝐵)
7	3, 2	posdifd 10814	. . . 4 ⊢ (𝜑 → (𝐴 < 𝐵 ↔ 0 < (𝐵 − 𝐴)))
8	6, 7	mpbid 222	. . 3 ⊢ (𝜑 → 0 < (𝐵 − 𝐴))
9		fourierdlem61.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
10	9	adantr 466	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
11	3	rexrd 10289	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
12	11	adantr 466	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 ∈ ℝ^*)
13	2	rexrd 10289	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
14	13	adantr 466	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐵 ∈ ℝ^*)
15	3	adantr 466	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 ∈ ℝ)
16		elioore 12403	. . . . . . . . 9 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) → 𝑠 ∈ ℝ)
17	16	adantl 467	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 ∈ ℝ)
18	15, 17	readdcld 10269	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ∈ ℝ)
19	3	recnd 10268	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℂ)
20	19	addid1d 10436	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 + 0) = 𝐴)
21	20	eqcomd 2777	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = (𝐴 + 0))
22	21	adantr 466	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 = (𝐴 + 0))
23		0red 10241	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 ∈ ℝ)
24		0xr 10286	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ^*
25	24	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 ∈ ℝ^*)
26	5	adantr 466	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐵 − 𝐴) ∈ ℝ^*)
27		simpr 471	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 ∈ (0(,)(𝐵 − 𝐴)))
28		ioogtlb 40231	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ^* ∧ (𝐵 − 𝐴) ∈ ℝ^* ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 < 𝑠)
29	25, 26, 27, 28	syl3anc 1476	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 < 𝑠)
30	23, 17, 15, 29	ltadd2dd 10396	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 0) < (𝐴 + 𝑠))
31	22, 30	eqbrtrd 4808	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 < (𝐴 + 𝑠))
32	4	adantr 466	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐵 − 𝐴) ∈ ℝ)
33		iooltub 40248	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ^* ∧ (𝐵 − 𝐴) ∈ ℝ^* ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 < (𝐵 − 𝐴))
34	25, 26, 27, 33	syl3anc 1476	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 < (𝐵 − 𝐴))
35	17, 32, 15, 34	ltadd2dd 10396	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) < (𝐴 + (𝐵 − 𝐴)))
36	2	recnd 10268	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℂ)
37	19, 36	pncan3d 10595	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 + (𝐵 − 𝐴)) = 𝐵)
38	37	adantr 466	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + (𝐵 − 𝐴)) = 𝐵)
39	35, 38	breqtrd 4812	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) < 𝐵)
40	12, 14, 18, 31, 39	eliood 40234	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ∈ (𝐴(,)𝐵))
41	10, 40	ffvelrnd 6501	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐹‘(𝐴 + 𝑠)) ∈ ℝ)
42		ioossre 12433	. . . . . . . . 9 ⊢ (𝐴(,)𝐵) ⊆ ℝ
43	42	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
44		ax-resscn 10193	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
45	43, 44	syl6ss 3764	. . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
46		eqid 2771	. . . . . . . 8 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
47	46, 13, 3, 6	lptioo1cn 40389	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(𝐴(,)𝐵)))
48		fourierdlem61.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ (𝐹 lim_ℂ 𝐴))
49	9, 45, 47, 48	limcrecl 40372	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ℝ)
50	49	adantr 466	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑌 ∈ ℝ)
51	41, 50	resubcld 10658	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐹‘(𝐴 + 𝑠)) − 𝑌) ∈ ℝ)
52		fourierdlem61.n	. . . 4 ⊢ 𝑁 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
53	51, 52	fmptd 6525	. . 3 ⊢ (𝜑 → 𝑁:(0(,)(𝐵 − 𝐴))⟶ℝ)
54		fourierdlem61.d	. . . 4 ⊢ 𝐷 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)
55	17, 54	fmptd 6525	. . 3 ⊢ (𝜑 → 𝐷:(0(,)(𝐵 − 𝐴))⟶ℝ)
56	52	oveq2i 6802	. . . . . 6 ⊢ (ℝ D 𝑁) = (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)))
57	56	a1i 11	. . . . 5 ⊢ (𝜑 → (ℝ D 𝑁) = (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))))
58	57	dmeqd 5462	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝑁) = dom (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))))
59		reelprrecn 10228	. . . . . . . 8 ⊢ ℝ ∈ {ℝ, ℂ}
60	59	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
61	41	recnd 10268	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐹‘(𝐴 + 𝑠)) ∈ ℂ)
62		dvfre 23927	. . . . . . . . . . 11 ⊢ ((𝐹:(𝐴(,)𝐵)⟶ℝ ∧ (𝐴(,)𝐵) ⊆ ℝ) → (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ)
63	9, 43, 62	syl2anc 573	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ)
64		fourierdlem61.g	. . . . . . . . . . . 12 ⊢ 𝐺 = (ℝ D 𝐹)
65	64	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 = (ℝ D 𝐹))
66	65	feq1d 6168	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺:dom (ℝ D 𝐹)⟶ℝ ↔ (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ))
67	63, 66	mpbird 247	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:dom (ℝ D 𝐹)⟶ℝ)
68	67	adantr 466	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐺:dom (ℝ D 𝐹)⟶ℝ)
69	65	eqcomd 2777	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D 𝐹) = 𝐺)
70	69	dmeqd 5462	. . . . . . . . . . 11 ⊢ (𝜑 → dom (ℝ D 𝐹) = dom 𝐺)
71		fourierdlem61.domg	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐺 = (𝐴(,)𝐵))
72	70, 71	eqtr2d 2806	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴(,)𝐵) = dom (ℝ D 𝐹))
73	72	adantr 466	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴(,)𝐵) = dom (ℝ D 𝐹))
74	40, 73	eleqtrd 2852	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ∈ dom (ℝ D 𝐹))
75	68, 74	ffvelrnd 6501	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) ∈ ℝ)
76		1red 10255	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 1 ∈ ℝ)
77	9	ffvelrnda 6500	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐹‘𝑥) ∈ ℝ)
78	77	recnd 10268	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐹‘𝑥) ∈ ℂ)
79	72	feq2d 6169	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺:(𝐴(,)𝐵)⟶ℝ ↔ 𝐺:dom (ℝ D 𝐹)⟶ℝ))
80	67, 79	mpbird 247	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺:(𝐴(,)𝐵)⟶ℝ)
81	80	ffvelrnda 6500	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐺‘𝑥) ∈ ℝ)
82	19	adantr 466	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 ∈ ℂ)
83	19	adantr 466	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝐴 ∈ ℂ)
84		0red 10241	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 0 ∈ ℝ)
85	60, 19	dvmptc 23934	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝐴)) = (𝑠 ∈ ℝ ↦ 0))
86		ioossre 12433	. . . . . . . . . . . . 13 ⊢ (0(,)(𝐵 − 𝐴)) ⊆ ℝ
87	86	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ⊆ ℝ)
88	46	tgioo2 22819	. . . . . . . . . . . 12 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
89		iooretop 22782	. . . . . . . . . . . . 13 ⊢ (0(,)(𝐵 − 𝐴)) ∈ (topGen‘ran (,))
90	89	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ∈ (topGen‘ran (,)))
91	60, 83, 84, 85, 87, 88, 46, 90	dvmptres 23939	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 0))
92	17	recnd 10268	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 ∈ ℂ)
93		recn 10226	. . . . . . . . . . . . 13 ⊢ (𝑠 ∈ ℝ → 𝑠 ∈ ℂ)
94	93	adantl 467	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑠 ∈ ℂ)
95		1red 10255	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 1 ∈ ℝ)
96	60	dvmptid 23933	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝑠)) = (𝑠 ∈ ℝ ↦ 1))
97	60, 94, 95, 96, 87, 88, 46, 90	dvmptres 23939	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
98	60, 82, 23, 91, 92, 76, 97	dvmptadd 23936	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (0 + 1)))
99		0p1e1 11332	. . . . . . . . . . 11 ⊢ (0 + 1) = 1
100	99	mpteq2i 4875	. . . . . . . . . 10 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (0 + 1)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)
101	98, 100	syl6eq 2821	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
102	9	feqmptd 6389	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)))
103	102	eqcomd 2777	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) = 𝐹)
104	103	oveq2d 6807	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥))) = (ℝ D 𝐹))
105	80	feqmptd 6389	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)))
106	104, 69, 105	3eqtrd 2809	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)))
107		fveq2 6330	. . . . . . . . 9 ⊢ (𝑥 = (𝐴 + 𝑠) → (𝐹‘𝑥) = (𝐹‘(𝐴 + 𝑠)))
108		fveq2 6330	. . . . . . . . 9 ⊢ (𝑥 = (𝐴 + 𝑠) → (𝐺‘𝑥) = (𝐺‘(𝐴 + 𝑠)))
109	60, 60, 40, 76, 78, 81, 101, 106, 107, 108	dvmptco 23948	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠)))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) · 1)))
110	75	recnd 10268	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) ∈ ℂ)
111	110	mulid1d 10257	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) · 1) = (𝐺‘(𝐴 + 𝑠)))
112	111	mpteq2dva 4878	. . . . . . . 8 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) · 1)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
113	109, 112	eqtrd 2805	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠)))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
114		limccl 23852	. . . . . . . . 9 ⊢ (𝐹 lim_ℂ 𝐴) ⊆ ℂ
115	114, 48	sseldi 3750	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ ℂ)
116	115	adantr 466	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑌 ∈ ℂ)
117	115	adantr 466	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑌 ∈ ℂ)
118	60, 115	dvmptc 23934	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝑌)) = (𝑠 ∈ ℝ ↦ 0))
119	60, 117, 84, 118, 87, 88, 46, 90	dvmptres 23939	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 0))
120	60, 61, 75, 113, 116, 25, 119	dvmptsub 23943	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) − 0)))
121	110	subid1d 10581	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) − 0) = (𝐺‘(𝐴 + 𝑠)))
122	121	mpteq2dva 4878	. . . . . 6 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) − 0)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
123	120, 122	eqtrd 2805	. . . . 5 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
124	123	dmeqd 5462	. . . 4 ⊢ (𝜑 → dom (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))) = dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
125	75	ralrimiva 3115	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ (0(,)(𝐵 − 𝐴))(𝐺‘(𝐴 + 𝑠)) ∈ ℝ)
126		dmmptg 5774	. . . . 5 ⊢ (∀𝑠 ∈ (0(,)(𝐵 − 𝐴))(𝐺‘(𝐴 + 𝑠)) ∈ ℝ → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (0(,)(𝐵 − 𝐴)))
127	125, 126	syl 17	. . . 4 ⊢ (𝜑 → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (0(,)(𝐵 − 𝐴)))
128	58, 124, 127	3eqtrd 2809	. . 3 ⊢ (𝜑 → dom (ℝ D 𝑁) = (0(,)(𝐵 − 𝐴)))
129	54	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐷 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠))
130	129	oveq2d 6807	. . . . . 6 ⊢ (𝜑 → (ℝ D 𝐷) = (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)))
131	130, 97	eqtrd 2805	. . . . 5 ⊢ (𝜑 → (ℝ D 𝐷) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
132	131	dmeqd 5462	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝐷) = dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
133	76	ralrimiva 3115	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ (0(,)(𝐵 − 𝐴))1 ∈ ℝ)
134		dmmptg 5774	. . . . 5 ⊢ (∀𝑠 ∈ (0(,)(𝐵 − 𝐴))1 ∈ ℝ → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = (0(,)(𝐵 − 𝐴)))
135	133, 134	syl 17	. . . 4 ⊢ (𝜑 → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = (0(,)(𝐵 − 𝐴)))
136	132, 135	eqtrd 2805	. . 3 ⊢ (𝜑 → dom (ℝ D 𝐷) = (0(,)(𝐵 − 𝐴)))
137		eqid 2771	. . . . 5 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠)))
138		eqid 2771	. . . . 5 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌)
139		eqid 2771	. . . . 5 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
140	40	adantrr 696	. . . . . 6 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) ≠ 𝐴)) → (𝐴 + 𝑠) ∈ (𝐴(,)𝐵))
141		eqid 2771	. . . . . . . 8 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴)
142		eqid 2771	. . . . . . . 8 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)
143		eqid 2771	. . . . . . . 8 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠))
144	87, 44	syl6ss 3764	. . . . . . . . 9 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ⊆ ℂ)
145	1	recnd 10268	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ ℂ)
146	141, 144, 19, 145	constlimc 40367	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴) lim_ℂ 0))
147	144, 142, 145	idlimc 40369	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠) lim_ℂ 0))
148	141, 142, 143, 82, 92, 146, 147	addlimc 40391	. . . . . . 7 ⊢ (𝜑 → (𝐴 + 0) ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠)) lim_ℂ 0))
149	21, 148	eqeltrd 2850	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠)) lim_ℂ 0))
150	102	oveq1d 6806	. . . . . . 7 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐴) = ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) lim_ℂ 𝐴))
151	48, 150	eleqtrd 2852	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) lim_ℂ 𝐴))
152		simplrr 763	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐹‘(𝐴 + 𝑠)) = 𝑌) → (𝐴 + 𝑠) = 𝐴)
153	15, 31	gtned 10372	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ≠ 𝐴)
154	153	neneqd 2948	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ¬ (𝐴 + 𝑠) = 𝐴)
155	154	adantrr 696	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) → ¬ (𝐴 + 𝑠) = 𝐴)
156	155	adantr 466	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐹‘(𝐴 + 𝑠)) = 𝑌) → ¬ (𝐴 + 𝑠) = 𝐴)
157	152, 156	condan 819	. . . . . 6 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) → (𝐹‘(𝐴 + 𝑠)) = 𝑌)
158	140, 78, 149, 151, 107, 157	limcco 23870	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠))) lim_ℂ 0))
159	138, 144, 115, 145	constlimc 40367	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌) lim_ℂ 0))
160	137, 138, 139, 61, 116, 158, 159	sublimc 40395	. . . 4 ⊢ (𝜑 → (𝑌 − 𝑌) ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) lim_ℂ 0))
161	115	subidd 10580	. . . 4 ⊢ (𝜑 → (𝑌 − 𝑌) = 0)
162	52	eqcomi 2780	. . . . . 6 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) = 𝑁
163	162	oveq1i 6801	. . . . 5 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) lim_ℂ 0) = (𝑁 lim_ℂ 0)
164	163	a1i 11	. . . 4 ⊢ (𝜑 → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) lim_ℂ 0) = (𝑁 lim_ℂ 0))
165	160, 161, 164	3eltr3d 2864	. . 3 ⊢ (𝜑 → 0 ∈ (𝑁 lim_ℂ 0))
166	144, 54, 145	idlimc 40369	. . 3 ⊢ (𝜑 → 0 ∈ (𝐷 lim_ℂ 0))
167		lbioo 12404	. . . . 5 ⊢ ¬ 0 ∈ (0(,)(𝐵 − 𝐴))
168	167	a1i 11	. . . 4 ⊢ (𝜑 → ¬ 0 ∈ (0(,)(𝐵 − 𝐴)))
169		mptresid 5595	. . . . . . 7 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠) = ( I ↾ (0(,)(𝐵 − 𝐴)))
170	129, 169	syl6eq 2821	. . . . . 6 ⊢ (𝜑 → 𝐷 = ( I ↾ (0(,)(𝐵 − 𝐴))))
171	170	rneqd 5489	. . . . 5 ⊢ (𝜑 → ran 𝐷 = ran ( I ↾ (0(,)(𝐵 − 𝐴))))
172		rnresi 5618	. . . . 5 ⊢ ran ( I ↾ (0(,)(𝐵 − 𝐴))) = (0(,)(𝐵 − 𝐴))
173	171, 172	syl6req 2822	. . . 4 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) = ran 𝐷)
174	168, 173	neleqtrd 2871	. . 3 ⊢ (𝜑 → ¬ 0 ∈ ran 𝐷)
175		0ne1 11288	. . . . . 6 ⊢ 0 ≠ 1
176	175	neii 2945	. . . . 5 ⊢ ¬ 0 = 1
177		elsng 4330	. . . . . 6 ⊢ (0 ∈ ℝ → (0 ∈ {1} ↔ 0 = 1))
178	1, 177	syl 17	. . . . 5 ⊢ (𝜑 → (0 ∈ {1} ↔ 0 = 1))
179	176, 178	mtbiri 316	. . . 4 ⊢ (𝜑 → ¬ 0 ∈ {1})
180	131	rneqd 5489	. . . . 5 ⊢ (𝜑 → ran (ℝ D 𝐷) = ran (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
181		eqid 2771	. . . . . 6 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)
182	24	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ ℝ^*)
183		ioon0 12399	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝐵 − 𝐴) ∈ ℝ^*) → ((0(,)(𝐵 − 𝐴)) ≠ ∅ ↔ 0 < (𝐵 − 𝐴)))
184	182, 5, 183	syl2anc 573	. . . . . . 7 ⊢ (𝜑 → ((0(,)(𝐵 − 𝐴)) ≠ ∅ ↔ 0 < (𝐵 − 𝐴)))
185	8, 184	mpbird 247	. . . . . 6 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ≠ ∅)
186	181, 76, 185	rnmptc 39866	. . . . 5 ⊢ (𝜑 → ran (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = {1})
187	180, 186	eqtr2d 2806	. . . 4 ⊢ (𝜑 → {1} = ran (ℝ D 𝐷))
188	179, 187	neleqtrd 2871	. . 3 ⊢ (𝜑 → ¬ 0 ∈ ran (ℝ D 𝐷))
189	81	recnd 10268	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐺‘𝑥) ∈ ℂ)
190		fourierdlem61.e	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (𝐺 lim_ℂ 𝐴))
191	105	oveq1d 6806	. . . . . 6 ⊢ (𝜑 → (𝐺 lim_ℂ 𝐴) = ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)) lim_ℂ 𝐴))
192	190, 191	eleqtrd 2852	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)) lim_ℂ 𝐴))
193		simplrr 763	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐺‘(𝐴 + 𝑠)) = 𝐸) → (𝐴 + 𝑠) = 𝐴)
194	155	adantr 466	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐺‘(𝐴 + 𝑠)) = 𝐸) → ¬ (𝐴 + 𝑠) = 𝐴)
195	193, 194	condan 819	. . . . 5 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) → (𝐺‘(𝐴 + 𝑠)) = 𝐸)
196	140, 189, 149, 192, 108, 195	limcco 23870	. . . 4 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) lim_ℂ 0))
197	110	div1d 10993	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) / 1) = (𝐺‘(𝐴 + 𝑠)))
198	56, 123	syl5eq 2817	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D 𝑁) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
199	198	adantr 466	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (ℝ D 𝑁) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
200	199	fveq1d 6332	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((ℝ D 𝑁)‘𝑠) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))‘𝑠))
201		eqid 2771	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))
202	201	fvmpt2 6431	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐺‘(𝐴 + 𝑠)) ∈ ℝ) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))‘𝑠) = (𝐺‘(𝐴 + 𝑠)))
203	27, 75, 202	syl2anc 573	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))‘𝑠) = (𝐺‘(𝐴 + 𝑠)))
204	200, 203	eqtr2d 2806	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) = ((ℝ D 𝑁)‘𝑠))
205	131	fveq1d 6332	. . . . . . . . . 10 ⊢ (𝜑 → ((ℝ D 𝐷)‘𝑠) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠))
206	205	adantr 466	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((ℝ D 𝐷)‘𝑠) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠))
207	181	fvmpt2 6431	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ 1 ∈ ℝ) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠) = 1)
208	27, 76, 207	syl2anc 573	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠) = 1)
209	206, 208	eqtr2d 2806	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 1 = ((ℝ D 𝐷)‘𝑠))
210	204, 209	oveq12d 6809	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) / 1) = (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠)))
211	197, 210	eqtr3d 2807	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) = (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠)))
212	211	mpteq2dva 4878	. . . . 5 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))))
213	212	oveq1d 6806	. . . 4 ⊢ (𝜑 → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) lim_ℂ 0) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))) lim_ℂ 0))
214	196, 213	eleqtrd 2852	. . 3 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))) lim_ℂ 0))
215	1, 5, 8, 53, 55, 128, 136, 165, 166, 174, 188, 214	lhop1 23990	. 2 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) lim_ℂ 0))
216	52	fvmpt2 6431	. . . . . . 7 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ ((𝐹‘(𝐴 + 𝑠)) − 𝑌) ∈ ℝ) → (𝑁‘𝑠) = ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
217	27, 51, 216	syl2anc 573	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝑁‘𝑠) = ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
218	54	fvmpt2 6431	. . . . . . 7 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐷‘𝑠) = 𝑠)
219	27, 27, 218	syl2anc 573	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐷‘𝑠) = 𝑠)
220	217, 219	oveq12d 6809	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝑁‘𝑠) / (𝐷‘𝑠)) = (((𝐹‘(𝐴 + 𝑠)) − 𝑌) / 𝑠))
221	220	mpteq2dva 4878	. . . 4 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((𝐹‘(𝐴 + 𝑠)) − 𝑌) / 𝑠)))
222		fourierdlem61.h	. . . 4 ⊢ 𝐻 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((𝐹‘(𝐴 + 𝑠)) − 𝑌) / 𝑠))
223	221, 222	syl6eqr 2823	. . 3 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) = 𝐻)
224	223	oveq1d 6806	. 2 ⊢ (𝜑 → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) lim_ℂ 0) = (𝐻 lim_ℂ 0))
225	215, 224	eleqtrd 2852	1 ⊢ (𝜑 → 𝐸 ∈ (𝐻 lim_ℂ 0))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 382 = wceq 1631 ∈ wcel 2145 ≠ wne 2943 ∀wral 3061 ⊆ wss 3723 ∅c0 4063 {csn 4316 {cpr 4318 class class class wbr 4786 ↦ cmpt 4863 I cid 5156 dom cdm 5249 ran crn 5250 ↾ cres 5251 ⟶wf 6025 ‘cfv 6029 (class class class)co 6791 ℂcc 10134 ℝcr 10135 0cc0 10136 1c1 10137 + caddc 10139 · cmul 10141 ℝ^*cxr 10273 < clt 10274 − cmin 10466 / cdiv 10884 (,)cioo 12373 TopOpenctopn 16283 topGenctg 16299 ℂ_fldccnfld 19954 lim_ℂ climc 23839 D cdv 23840

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pow 4974 ax-pr 5034 ax-un 7094 ax-inf2 8700 ax-cnex 10192 ax-resscn 10193 ax-1cn 10194 ax-icn 10195 ax-addcl 10196 ax-addrcl 10197 ax-mulcl 10198 ax-mulrcl 10199 ax-mulcom 10200 ax-addass 10201 ax-mulass 10202 ax-distr 10203 ax-i2m1 10204 ax-1ne0 10205 ax-1rid 10206 ax-rnegex 10207 ax-rrecex 10208 ax-cnre 10209 ax-pre-lttri 10210 ax-pre-lttrn 10211 ax-pre-ltadd 10212 ax-pre-mulgt0 10213 ax-pre-sup 10214 ax-addf 10215 ax-mulf 10216

This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4226 df-pw 4299 df-sn 4317 df-pr 4319 df-tp 4321 df-op 4323 df-uni 4575 df-int 4612 df-iun 4656 df-iin 4657 df-br 4787 df-opab 4847 df-mpt 4864 df-tr 4887 df-id 5157 df-eprel 5162 df-po 5170 df-so 5171 df-fr 5208 df-se 5209 df-we 5210 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-pred 5821 df-ord 5867 df-on 5868 df-lim 5869 df-suc 5870 df-iota 5992 df-fun 6031 df-fn 6032 df-f 6033 df-f1 6034 df-fo 6035 df-f1o 6036 df-fv 6037 df-isom 6038 df-riota 6752 df-ov 6794 df-oprab 6795 df-mpt2 6796 df-of 7042 df-om 7211 df-1st 7313 df-2nd 7314 df-supp 7445 df-wrecs 7557 df-recs 7619 df-rdg 7657 df-1o 7711 df-2o 7712 df-oadd 7715 df-er 7894 df-map 8009 df-pm 8010 df-ixp 8061 df-en 8108 df-dom 8109 df-sdom 8110 df-fin 8111 df-fsupp 8430 df-fi 8471 df-sup 8502 df-inf 8503 df-oi 8569 df-card 8963 df-cda 9190 df-pnf 10276 df-mnf 10277 df-xr 10278 df-ltxr 10279 df-le 10280 df-sub 10468 df-neg 10469 df-div 10885 df-nn 11221 df-2 11279 df-3 11280 df-4 11281 df-5 11282 df-6 11283 df-7 11284 df-8 11285 df-9 11286 df-n0 11493 df-z 11578 df-dec 11694 df-uz 11887 df-q 11990 df-rp 12029 df-xneg 12144 df-xadd 12145 df-xmul 12146 df-ioo 12377 df-ioc 12378 df-ico 12379 df-icc 12380 df-fz 12527 df-fzo 12667 df-seq 13002 df-exp 13061 df-hash 13315 df-cj 14040 df-re 14041 df-im 14042 df-sqrt 14176 df-abs 14177 df-struct 16059 df-ndx 16060 df-slot 16061 df-base 16063 df-sets 16064 df-ress 16065 df-plusg 16155 df-mulr 16156 df-starv 16157 df-sca 16158 df-vsca 16159 df-ip 16160 df-tset 16161 df-ple 16162 df-ds 16165 df-unif 16166 df-hom 16167 df-cco 16168 df-rest 16284 df-topn 16285 df-0g 16303 df-gsum 16304 df-topgen 16305 df-pt 16306 df-prds 16309 df-xrs 16363 df-qtop 16368 df-imas 16369 df-xps 16371 df-mre 16447 df-mrc 16448 df-acs 16450 df-mgm 17443 df-sgrp 17485 df-mnd 17496 df-submnd 17537 df-mulg 17742 df-cntz 17950 df-cmn 18395 df-psmet 19946 df-xmet 19947 df-met 19948 df-bl 19949 df-mopn 19950 df-fbas 19951 df-fg 19952 df-cnfld 19955 df-top 20912 df-topon 20929 df-topsp 20951 df-bases 20964 df-cld 21037 df-ntr 21038 df-cls 21039 df-nei 21116 df-lp 21154 df-perf 21155 df-cn 21245 df-cnp 21246 df-haus 21333 df-cmp 21404 df-tx 21579 df-hmeo 21772 df-fil 21863 df-fm 21955 df-flim 21956 df-flf 21957 df-xms 22338 df-ms 22339 df-tms 22340 df-cncf 22894 df-limc 23843 df-dv 23844

This theorem is referenced by: fourierdlem75 40908

W3C validator