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 41021

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 10297	. . 3 ⊢ (𝜑 → 0 ∈ ℝ)
2		fourierdlem61.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
3		fourierdlem61.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4	2, 3	resubcld 10712	. . . 4 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℝ)
5	4	rexrd 10343	. . 3 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℝ^*)
6		fourierdlem61.altb	. . . 4 ⊢ (𝜑 → 𝐴 < 𝐵)
7	3, 2	posdifd 10868	. . . 4 ⊢ (𝜑 → (𝐴 < 𝐵 ↔ 0 < (𝐵 − 𝐴)))
8	6, 7	mpbid 223	. . 3 ⊢ (𝜑 → 0 < (𝐵 − 𝐴))
9		fourierdlem61.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
10	9	adantr 472	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
11	3	rexrd 10343	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
12	11	adantr 472	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 ∈ ℝ^*)
13	2	rexrd 10343	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
14	13	adantr 472	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐵 ∈ ℝ^*)
15	3	adantr 472	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 ∈ ℝ)
16		elioore 12407	. . . . . . . . 9 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) → 𝑠 ∈ ℝ)
17	16	adantl 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 ∈ ℝ)
18	15, 17	readdcld 10323	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ∈ ℝ)
19	3	recnd 10322	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℂ)
20	19	addid1d 10490	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 + 0) = 𝐴)
21	20	eqcomd 2771	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = (𝐴 + 0))
22	21	adantr 472	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 = (𝐴 + 0))
23		0red 10297	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 ∈ ℝ)
24		0xr 10340	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ^*
25	24	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 ∈ ℝ^*)
26	5	adantr 472	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐵 − 𝐴) ∈ ℝ^*)
27		simpr 477	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 ∈ (0(,)(𝐵 − 𝐴)))
28		ioogtlb 40359	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ^* ∧ (𝐵 − 𝐴) ∈ ℝ^* ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 < 𝑠)
29	25, 26, 27, 28	syl3anc 1490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 0 < 𝑠)
30	23, 17, 15, 29	ltadd2dd 10450	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 0) < (𝐴 + 𝑠))
31	22, 30	eqbrtrd 4831	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 < (𝐴 + 𝑠))
32	4	adantr 472	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐵 − 𝐴) ∈ ℝ)
33		iooltub 40375	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ^* ∧ (𝐵 − 𝐴) ∈ ℝ^* ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 < (𝐵 − 𝐴))
34	25, 26, 27, 33	syl3anc 1490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 < (𝐵 − 𝐴))
35	17, 32, 15, 34	ltadd2dd 10450	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) < (𝐴 + (𝐵 − 𝐴)))
36	2	recnd 10322	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℂ)
37	19, 36	pncan3d 10649	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 + (𝐵 − 𝐴)) = 𝐵)
38	37	adantr 472	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + (𝐵 − 𝐴)) = 𝐵)
39	35, 38	breqtrd 4835	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) < 𝐵)
40	12, 14, 18, 31, 39	eliood 40362	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ∈ (𝐴(,)𝐵))
41	10, 40	ffvelrnd 6550	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐹‘(𝐴 + 𝑠)) ∈ ℝ)
42		ioossre 12437	. . . . . . . . 9 ⊢ (𝐴(,)𝐵) ⊆ ℝ
43	42	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
44		ax-resscn 10246	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
45	43, 44	syl6ss 3773	. . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
46		eqid 2765	. . . . . . . 8 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
47	46, 13, 3, 6	lptioo1cn 40516	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(𝐴(,)𝐵)))
48		fourierdlem61.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ (𝐹 lim_ℂ 𝐴))
49	9, 45, 47, 48	limcrecl 40499	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ℝ)
50	49	adantr 472	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑌 ∈ ℝ)
51	41, 50	resubcld 10712	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐹‘(𝐴 + 𝑠)) − 𝑌) ∈ ℝ)
52		fourierdlem61.n	. . . 4 ⊢ 𝑁 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
53	51, 52	fmptd 6574	. . 3 ⊢ (𝜑 → 𝑁:(0(,)(𝐵 − 𝐴))⟶ℝ)
54		fourierdlem61.d	. . . 4 ⊢ 𝐷 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)
55	17, 54	fmptd 6574	. . 3 ⊢ (𝜑 → 𝐷:(0(,)(𝐵 − 𝐴))⟶ℝ)
56	52	oveq2i 6853	. . . . . 6 ⊢ (ℝ D 𝑁) = (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)))
57	56	a1i 11	. . . . 5 ⊢ (𝜑 → (ℝ D 𝑁) = (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))))
58	57	dmeqd 5494	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝑁) = dom (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))))
59		reelprrecn 10281	. . . . . . . 8 ⊢ ℝ ∈ {ℝ, ℂ}
60	59	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
61	41	recnd 10322	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐹‘(𝐴 + 𝑠)) ∈ ℂ)
62		dvfre 24005	. . . . . . . . . . 11 ⊢ ((𝐹:(𝐴(,)𝐵)⟶ℝ ∧ (𝐴(,)𝐵) ⊆ ℝ) → (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ)
63	9, 43, 62	syl2anc 579	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ)
64		fourierdlem61.g	. . . . . . . . . . . 12 ⊢ 𝐺 = (ℝ D 𝐹)
65	64	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 = (ℝ D 𝐹))
66	65	feq1d 6208	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺:dom (ℝ D 𝐹)⟶ℝ ↔ (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ))
67	63, 66	mpbird 248	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:dom (ℝ D 𝐹)⟶ℝ)
68	67	adantr 472	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐺:dom (ℝ D 𝐹)⟶ℝ)
69	65	eqcomd 2771	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D 𝐹) = 𝐺)
70	69	dmeqd 5494	. . . . . . . . . . 11 ⊢ (𝜑 → dom (ℝ D 𝐹) = dom 𝐺)
71		fourierdlem61.domg	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐺 = (𝐴(,)𝐵))
72	70, 71	eqtr2d 2800	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴(,)𝐵) = dom (ℝ D 𝐹))
73	72	adantr 472	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴(,)𝐵) = dom (ℝ D 𝐹))
74	40, 73	eleqtrd 2846	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ∈ dom (ℝ D 𝐹))
75	68, 74	ffvelrnd 6550	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) ∈ ℝ)
76		1red 10294	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 1 ∈ ℝ)
77	9	ffvelrnda 6549	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐹‘𝑥) ∈ ℝ)
78	77	recnd 10322	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐹‘𝑥) ∈ ℂ)
79	72	feq2d 6209	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺:(𝐴(,)𝐵)⟶ℝ ↔ 𝐺:dom (ℝ D 𝐹)⟶ℝ))
80	67, 79	mpbird 248	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺:(𝐴(,)𝐵)⟶ℝ)
81	80	ffvelrnda 6549	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐺‘𝑥) ∈ ℝ)
82	19	adantr 472	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝐴 ∈ ℂ)
83	19	adantr 472	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝐴 ∈ ℂ)
84		0red 10297	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 0 ∈ ℝ)
85	60, 19	dvmptc 24012	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝐴)) = (𝑠 ∈ ℝ ↦ 0))
86		ioossre 12437	. . . . . . . . . . . . 13 ⊢ (0(,)(𝐵 − 𝐴)) ⊆ ℝ
87	86	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ⊆ ℝ)
88	46	tgioo2 22885	. . . . . . . . . . . 12 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
89		iooretop 22848	. . . . . . . . . . . . 13 ⊢ (0(,)(𝐵 − 𝐴)) ∈ (topGen‘ran (,))
90	89	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ∈ (topGen‘ran (,)))
91	60, 83, 84, 85, 87, 88, 46, 90	dvmptres 24017	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 0))
92	17	recnd 10322	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑠 ∈ ℂ)
93		recn 10279	. . . . . . . . . . . . 13 ⊢ (𝑠 ∈ ℝ → 𝑠 ∈ ℂ)
94	93	adantl 473	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑠 ∈ ℂ)
95		1red 10294	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 1 ∈ ℝ)
96	60	dvmptid 24011	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝑠)) = (𝑠 ∈ ℝ ↦ 1))
97	60, 94, 95, 96, 87, 88, 46, 90	dvmptres 24017	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
98	60, 82, 23, 91, 92, 76, 97	dvmptadd 24014	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (0 + 1)))
99		0p1e1 11401	. . . . . . . . . . 11 ⊢ (0 + 1) = 1
100	99	mpteq2i 4900	. . . . . . . . . 10 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (0 + 1)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)
101	98, 100	syl6eq 2815	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
102	9	feqmptd 6438	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)))
103	102	eqcomd 2771	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) = 𝐹)
104	103	oveq2d 6858	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥))) = (ℝ D 𝐹))
105	80	feqmptd 6438	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)))
106	104, 69, 105	3eqtrd 2803	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)))
107		fveq2 6375	. . . . . . . . 9 ⊢ (𝑥 = (𝐴 + 𝑠) → (𝐹‘𝑥) = (𝐹‘(𝐴 + 𝑠)))
108		fveq2 6375	. . . . . . . . 9 ⊢ (𝑥 = (𝐴 + 𝑠) → (𝐺‘𝑥) = (𝐺‘(𝐴 + 𝑠)))
109	60, 60, 40, 76, 78, 81, 101, 106, 107, 108	dvmptco 24026	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠)))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) · 1)))
110	75	recnd 10322	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) ∈ ℂ)
111	110	mulid1d 10311	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) · 1) = (𝐺‘(𝐴 + 𝑠)))
112	111	mpteq2dva 4903	. . . . . . . 8 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) · 1)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
113	109, 112	eqtrd 2799	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠)))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
114		limccl 23930	. . . . . . . . 9 ⊢ (𝐹 lim_ℂ 𝐴) ⊆ ℂ
115	114, 48	sseldi 3759	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ ℂ)
116	115	adantr 472	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 𝑌 ∈ ℂ)
117	115	adantr 472	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑌 ∈ ℂ)
118	60, 115	dvmptc 24012	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝑌)) = (𝑠 ∈ ℝ ↦ 0))
119	60, 117, 84, 118, 87, 88, 46, 90	dvmptres 24017	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 0))
120	60, 61, 75, 113, 116, 25, 119	dvmptsub 24021	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) − 0)))
121	110	subid1d 10635	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) − 0) = (𝐺‘(𝐴 + 𝑠)))
122	121	mpteq2dva 4903	. . . . . 6 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐺‘(𝐴 + 𝑠)) − 0)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
123	120, 122	eqtrd 2799	. . . . 5 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
124	123	dmeqd 5494	. . . 4 ⊢ (𝜑 → dom (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))) = dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
125	75	ralrimiva 3113	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ (0(,)(𝐵 − 𝐴))(𝐺‘(𝐴 + 𝑠)) ∈ ℝ)
126		dmmptg 5818	. . . . 5 ⊢ (∀𝑠 ∈ (0(,)(𝐵 − 𝐴))(𝐺‘(𝐴 + 𝑠)) ∈ ℝ → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (0(,)(𝐵 − 𝐴)))
127	125, 126	syl 17	. . . 4 ⊢ (𝜑 → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (0(,)(𝐵 − 𝐴)))
128	58, 124, 127	3eqtrd 2803	. . 3 ⊢ (𝜑 → dom (ℝ D 𝑁) = (0(,)(𝐵 − 𝐴)))
129	54	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐷 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠))
130	129	oveq2d 6858	. . . . . 6 ⊢ (𝜑 → (ℝ D 𝐷) = (ℝ D (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)))
131	130, 97	eqtrd 2799	. . . . 5 ⊢ (𝜑 → (ℝ D 𝐷) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
132	131	dmeqd 5494	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝐷) = dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
133	76	ralrimiva 3113	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ (0(,)(𝐵 − 𝐴))1 ∈ ℝ)
134		dmmptg 5818	. . . . 5 ⊢ (∀𝑠 ∈ (0(,)(𝐵 − 𝐴))1 ∈ ℝ → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = (0(,)(𝐵 − 𝐴)))
135	133, 134	syl 17	. . . 4 ⊢ (𝜑 → dom (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = (0(,)(𝐵 − 𝐴)))
136	132, 135	eqtrd 2799	. . 3 ⊢ (𝜑 → dom (ℝ D 𝐷) = (0(,)(𝐵 − 𝐴)))
137		eqid 2765	. . . . 5 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠)))
138		eqid 2765	. . . . 5 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌)
139		eqid 2765	. . . . 5 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
140	40	adantrr 708	. . . . . 6 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) ≠ 𝐴)) → (𝐴 + 𝑠) ∈ (𝐴(,)𝐵))
141		eqid 2765	. . . . . . . 8 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴)
142		eqid 2765	. . . . . . . 8 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠)
143		eqid 2765	. . . . . . . 8 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠)) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠))
144	87, 44	syl6ss 3773	. . . . . . . . 9 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ⊆ ℂ)
145	1	recnd 10322	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ ℂ)
146	141, 144, 19, 145	constlimc 40494	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝐴) lim_ℂ 0))
147	144, 142, 145	idlimc 40496	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠) lim_ℂ 0))
148	141, 142, 143, 82, 92, 146, 147	addlimc 40518	. . . . . . 7 ⊢ (𝜑 → (𝐴 + 0) ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠)) lim_ℂ 0))
149	21, 148	eqeltrd 2844	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐴 + 𝑠)) lim_ℂ 0))
150	102	oveq1d 6857	. . . . . . 7 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐴) = ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) lim_ℂ 𝐴))
151	48, 150	eleqtrd 2846	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) lim_ℂ 𝐴))
152		simplrr 796	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐹‘(𝐴 + 𝑠)) = 𝑌) → (𝐴 + 𝑠) = 𝐴)
153	15, 31	gtned 10426	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐴 + 𝑠) ≠ 𝐴)
154	153	neneqd 2942	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ¬ (𝐴 + 𝑠) = 𝐴)
155	154	adantrr 708	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) → ¬ (𝐴 + 𝑠) = 𝐴)
156	155	adantr 472	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐹‘(𝐴 + 𝑠)) = 𝑌) → ¬ (𝐴 + 𝑠) = 𝐴)
157	152, 156	condan 852	. . . . . 6 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) → (𝐹‘(𝐴 + 𝑠)) = 𝑌)
158	140, 78, 149, 151, 107, 157	limcco 23948	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐹‘(𝐴 + 𝑠))) lim_ℂ 0))
159	138, 144, 115, 145	constlimc 40494	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑌) lim_ℂ 0))
160	137, 138, 139, 61, 116, 158, 159	sublimc 40522	. . . 4 ⊢ (𝜑 → (𝑌 − 𝑌) ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) lim_ℂ 0))
161	115	subidd 10634	. . . 4 ⊢ (𝜑 → (𝑌 − 𝑌) = 0)
162	52	eqcomi 2774	. . . . . 6 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) = 𝑁
163	162	oveq1i 6852	. . . . 5 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) lim_ℂ 0) = (𝑁 lim_ℂ 0)
164	163	a1i 11	. . . 4 ⊢ (𝜑 → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝐹‘(𝐴 + 𝑠)) − 𝑌)) lim_ℂ 0) = (𝑁 lim_ℂ 0))
165	160, 161, 164	3eltr3d 2858	. . 3 ⊢ (𝜑 → 0 ∈ (𝑁 lim_ℂ 0))
166	144, 54, 145	idlimc 40496	. . 3 ⊢ (𝜑 → 0 ∈ (𝐷 lim_ℂ 0))
167		lbioo 12408	. . . . 5 ⊢ ¬ 0 ∈ (0(,)(𝐵 − 𝐴))
168	167	a1i 11	. . . 4 ⊢ (𝜑 → ¬ 0 ∈ (0(,)(𝐵 − 𝐴)))
169		mptresid 5640	. . . . . . 7 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 𝑠) = ( I ↾ (0(,)(𝐵 − 𝐴)))
170	129, 169	syl6eq 2815	. . . . . 6 ⊢ (𝜑 → 𝐷 = ( I ↾ (0(,)(𝐵 − 𝐴))))
171	170	rneqd 5521	. . . . 5 ⊢ (𝜑 → ran 𝐷 = ran ( I ↾ (0(,)(𝐵 − 𝐴))))
172		rnresi 5661	. . . . 5 ⊢ ran ( I ↾ (0(,)(𝐵 − 𝐴))) = (0(,)(𝐵 − 𝐴))
173	171, 172	syl6req 2816	. . . 4 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) = ran 𝐷)
174	168, 173	neleqtrd 2865	. . 3 ⊢ (𝜑 → ¬ 0 ∈ ran 𝐷)
175		0ne1 11343	. . . . . 6 ⊢ 0 ≠ 1
176	175	neii 2939	. . . . 5 ⊢ ¬ 0 = 1
177		elsng 4348	. . . . . 6 ⊢ (0 ∈ ℝ → (0 ∈ {1} ↔ 0 = 1))
178	1, 177	syl 17	. . . . 5 ⊢ (𝜑 → (0 ∈ {1} ↔ 0 = 1))
179	176, 178	mtbiri 318	. . . 4 ⊢ (𝜑 → ¬ 0 ∈ {1})
180	131	rneqd 5521	. . . . 5 ⊢ (𝜑 → ran (ℝ D 𝐷) = ran (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1))
181		eqid 2765	. . . . . 6 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)
182	24	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ ℝ^*)
183		ioon0 12403	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝐵 − 𝐴) ∈ ℝ^*) → ((0(,)(𝐵 − 𝐴)) ≠ ∅ ↔ 0 < (𝐵 − 𝐴)))
184	182, 5, 183	syl2anc 579	. . . . . . 7 ⊢ (𝜑 → ((0(,)(𝐵 − 𝐴)) ≠ ∅ ↔ 0 < (𝐵 − 𝐴)))
185	8, 184	mpbird 248	. . . . . 6 ⊢ (𝜑 → (0(,)(𝐵 − 𝐴)) ≠ ∅)
186	181, 76, 185	rnmptc 40000	. . . . 5 ⊢ (𝜑 → ran (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1) = {1})
187	180, 186	eqtr2d 2800	. . . 4 ⊢ (𝜑 → {1} = ran (ℝ D 𝐷))
188	179, 187	neleqtrd 2865	. . 3 ⊢ (𝜑 → ¬ 0 ∈ ran (ℝ D 𝐷))
189	81	recnd 10322	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐺‘𝑥) ∈ ℂ)
190		fourierdlem61.e	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (𝐺 lim_ℂ 𝐴))
191	105	oveq1d 6857	. . . . . 6 ⊢ (𝜑 → (𝐺 lim_ℂ 𝐴) = ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)) lim_ℂ 𝐴))
192	190, 191	eleqtrd 2846	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)) lim_ℂ 𝐴))
193		simplrr 796	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐺‘(𝐴 + 𝑠)) = 𝐸) → (𝐴 + 𝑠) = 𝐴)
194	155	adantr 472	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) ∧ ¬ (𝐺‘(𝐴 + 𝑠)) = 𝐸) → ¬ (𝐴 + 𝑠) = 𝐴)
195	193, 194	condan 852	. . . . 5 ⊢ ((𝜑 ∧ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐴 + 𝑠) = 𝐴)) → (𝐺‘(𝐴 + 𝑠)) = 𝐸)
196	140, 189, 149, 192, 108, 195	limcco 23948	. . . 4 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) lim_ℂ 0))
197	110	div1d 11047	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) / 1) = (𝐺‘(𝐴 + 𝑠)))
198	56, 123	syl5eq 2811	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D 𝑁) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
199	198	adantr 472	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (ℝ D 𝑁) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))))
200	199	fveq1d 6377	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((ℝ D 𝑁)‘𝑠) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))‘𝑠))
201		eqid 2765	. . . . . . . . . . 11 ⊢ (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))
202	201	fvmpt2 6480	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ (𝐺‘(𝐴 + 𝑠)) ∈ ℝ) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))‘𝑠) = (𝐺‘(𝐴 + 𝑠)))
203	27, 75, 202	syl2anc 579	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠)))‘𝑠) = (𝐺‘(𝐴 + 𝑠)))
204	200, 203	eqtr2d 2800	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) = ((ℝ D 𝑁)‘𝑠))
205	131	fveq1d 6377	. . . . . . . . . 10 ⊢ (𝜑 → ((ℝ D 𝐷)‘𝑠) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠))
206	205	adantr 472	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((ℝ D 𝐷)‘𝑠) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠))
207	181	fvmpt2 6480	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ 1 ∈ ℝ) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠) = 1)
208	27, 76, 207	syl2anc 579	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ 1)‘𝑠) = 1)
209	206, 208	eqtr2d 2800	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → 1 = ((ℝ D 𝐷)‘𝑠))
210	204, 209	oveq12d 6860	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝐺‘(𝐴 + 𝑠)) / 1) = (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠)))
211	197, 210	eqtr3d 2801	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐺‘(𝐴 + 𝑠)) = (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠)))
212	211	mpteq2dva 4903	. . . . 5 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))))
213	212	oveq1d 6857	. . . 4 ⊢ (𝜑 → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (𝐺‘(𝐴 + 𝑠))) lim_ℂ 0) = ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))) lim_ℂ 0))
214	196, 213	eleqtrd 2846	. . 3 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))) lim_ℂ 0))
215	1, 5, 8, 53, 55, 128, 136, 165, 166, 174, 188, 214	lhop1 24068	. 2 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) lim_ℂ 0))
216	52	fvmpt2 6480	. . . . . . 7 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ ((𝐹‘(𝐴 + 𝑠)) − 𝑌) ∈ ℝ) → (𝑁‘𝑠) = ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
217	27, 51, 216	syl2anc 579	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝑁‘𝑠) = ((𝐹‘(𝐴 + 𝑠)) − 𝑌))
218	54	fvmpt2 6480	. . . . . . 7 ⊢ ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐷‘𝑠) = 𝑠)
219	27, 27, 218	syl2anc 579	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → (𝐷‘𝑠) = 𝑠)
220	217, 219	oveq12d 6860	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (0(,)(𝐵 − 𝐴))) → ((𝑁‘𝑠) / (𝐷‘𝑠)) = (((𝐹‘(𝐴 + 𝑠)) − 𝑌) / 𝑠))
221	220	mpteq2dva 4903	. . . 4 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((𝐹‘(𝐴 + 𝑠)) − 𝑌) / 𝑠)))
222		fourierdlem61.h	. . . 4 ⊢ 𝐻 = (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ (((𝐹‘(𝐴 + 𝑠)) − 𝑌) / 𝑠))
223	221, 222	syl6eqr 2817	. . 3 ⊢ (𝜑 → (𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) = 𝐻)
224	223	oveq1d 6857	. 2 ⊢ (𝜑 → ((𝑠 ∈ (0(,)(𝐵 − 𝐴)) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) lim_ℂ 0) = (𝐻 lim_ℂ 0))
225	215, 224	eleqtrd 2846	1 ⊢ (𝜑 → 𝐸 ∈ (𝐻 lim_ℂ 0))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 197 ∧ wa 384 = wceq 1652 ∈ wcel 2155 ≠ wne 2937 ∀wral 3055 ⊆ wss 3732 ∅c0 4079 {csn 4334 {cpr 4336 class class class wbr 4809 ↦ cmpt 4888 I cid 5184 dom cdm 5277 ran crn 5278 ↾ cres 5279 ⟶wf 6064 ‘cfv 6068 (class class class)co 6842 ℂcc 10187 ℝcr 10188 0cc0 10189 1c1 10190 + caddc 10192 · cmul 10194 ℝ^*cxr 10327 < clt 10328 − cmin 10520 / cdiv 10938 (,)cioo 12377 TopOpenctopn 16348 topGenctg 16364 ℂ_fldccnfld 20019 lim_ℂ climc 23917 D cdv 23918

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1890 ax-4 1904 ax-5 2005 ax-6 2070 ax-7 2105 ax-8 2157 ax-9 2164 ax-10 2183 ax-11 2198 ax-12 2211 ax-13 2352 ax-ext 2743 ax-rep 4930 ax-sep 4941 ax-nul 4949 ax-pow 5001 ax-pr 5062 ax-un 7147 ax-inf2 8753 ax-cnex 10245 ax-resscn 10246 ax-1cn 10247 ax-icn 10248 ax-addcl 10249 ax-addrcl 10250 ax-mulcl 10251 ax-mulrcl 10252 ax-mulcom 10253 ax-addass 10254 ax-mulass 10255 ax-distr 10256 ax-i2m1 10257 ax-1ne0 10258 ax-1rid 10259 ax-rnegex 10260 ax-rrecex 10261 ax-cnre 10262 ax-pre-lttri 10263 ax-pre-lttrn 10264 ax-pre-ltadd 10265 ax-pre-mulgt0 10266 ax-pre-sup 10267 ax-addf 10268 ax-mulf 10269

This theorem depends on definitions: df-bi 198 df-an 385 df-or 874 df-3or 1108 df-3an 1109 df-tru 1656 df-ex 1875 df-nf 1879 df-sb 2063 df-mo 2565 df-eu 2582 df-clab 2752 df-cleq 2758 df-clel 2761 df-nfc 2896 df-ne 2938 df-nel 3041 df-ral 3060 df-rex 3061 df-reu 3062 df-rmo 3063 df-rab 3064 df-v 3352 df-sbc 3597 df-csb 3692 df-dif 3735 df-un 3737 df-in 3739 df-ss 3746 df-pss 3748 df-nul 4080 df-if 4244 df-pw 4317 df-sn 4335 df-pr 4337 df-tp 4339 df-op 4341 df-uni 4595 df-int 4634 df-iun 4678 df-iin 4679 df-br 4810 df-opab 4872 df-mpt 4889 df-tr 4912 df-id 5185 df-eprel 5190 df-po 5198 df-so 5199 df-fr 5236 df-se 5237 df-we 5238 df-xp 5283 df-rel 5284 df-cnv 5285 df-co 5286 df-dm 5287 df-rn 5288 df-res 5289 df-ima 5290 df-pred 5865 df-ord 5911 df-on 5912 df-lim 5913 df-suc 5914 df-iota 6031 df-fun 6070 df-fn 6071 df-f 6072 df-f1 6073 df-fo 6074 df-f1o 6075 df-fv 6076 df-isom 6077 df-riota 6803 df-ov 6845 df-oprab 6846 df-mpt2 6847 df-of 7095 df-om 7264 df-1st 7366 df-2nd 7367 df-supp 7498 df-wrecs 7610 df-recs 7672 df-rdg 7710 df-1o 7764 df-2o 7765 df-oadd 7768 df-er 7947 df-map 8062 df-pm 8063 df-ixp 8114 df-en 8161 df-dom 8162 df-sdom 8163 df-fin 8164 df-fsupp 8483 df-fi 8524 df-sup 8555 df-inf 8556 df-oi 8622 df-card 9016 df-cda 9243 df-pnf 10330 df-mnf 10331 df-xr 10332 df-ltxr 10333 df-le 10334 df-sub 10522 df-neg 10523 df-div 10939 df-nn 11275 df-2 11335 df-3 11336 df-4 11337 df-5 11338 df-6 11339 df-7 11340 df-8 11341 df-9 11342 df-n0 11539 df-z 11625 df-dec 11741 df-uz 11887 df-q 11990 df-rp 12029 df-xneg 12146 df-xadd 12147 df-xmul 12148 df-ioo 12381 df-ioc 12382 df-ico 12383 df-icc 12384 df-fz 12534 df-fzo 12674 df-seq 13009 df-exp 13068 df-hash 13322 df-cj 14124 df-re 14125 df-im 14126 df-sqrt 14260 df-abs 14261 df-struct 16132 df-ndx 16133 df-slot 16134 df-base 16136 df-sets 16137 df-ress 16138 df-plusg 16227 df-mulr 16228 df-starv 16229 df-sca 16230 df-vsca 16231 df-ip 16232 df-tset 16233 df-ple 16234 df-ds 16236 df-unif 16237 df-hom 16238 df-cco 16239 df-rest 16349 df-topn 16350 df-0g 16368 df-gsum 16369 df-topgen 16370 df-pt 16371 df-prds 16374 df-xrs 16428 df-qtop 16433 df-imas 16434 df-xps 16436 df-mre 16512 df-mrc 16513 df-acs 16515 df-mgm 17508 df-sgrp 17550 df-mnd 17561 df-submnd 17602 df-mulg 17808 df-cntz 18013 df-cmn 18461 df-psmet 20011 df-xmet 20012 df-met 20013 df-bl 20014 df-mopn 20015 df-fbas 20016 df-fg 20017 df-cnfld 20020 df-top 20978 df-topon 20995 df-topsp 21017 df-bases 21030 df-cld 21103 df-ntr 21104 df-cls 21105 df-nei 21182 df-lp 21220 df-perf 21221 df-cn 21311 df-cnp 21312 df-haus 21399 df-cmp 21470 df-tx 21645 df-hmeo 21838 df-fil 21929 df-fm 22021 df-flim 22022 df-flf 22023 df-xms 22404 df-ms 22405 df-tms 22406 df-cncf 22960 df-limc 23921 df-dv 23922

This theorem is referenced by: fourierdlem75 41035

W3C validator