fourierdlem60 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem60 41888

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
fourierdlem60.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem60.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem60.altb	⊢ (𝜑 → 𝐴 < 𝐵)
fourierdlem60.f	⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
fourierdlem60.y	⊢ (𝜑 → 𝑌 ∈ (𝐹 lim_ℂ 𝐵))
fourierdlem60.g	⊢ 𝐺 = (ℝ D 𝐹)
fourierdlem60.domg	⊢ (𝜑 → dom 𝐺 = (𝐴(,)𝐵))
fourierdlem60.e	⊢ (𝜑 → 𝐸 ∈ (𝐺 lim_ℂ 𝐵))
fourierdlem60.h	⊢ 𝐻 = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (((𝐹‘(𝐵 + 𝑠)) − 𝑌) / 𝑠))
fourierdlem60.n	⊢ 𝑁 = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))
fourierdlem60.d	⊢ 𝐷 = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠)

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

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

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

Step	Hyp	Ref	Expression
1		fourierdlem60.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
2		fourierdlem60.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
3	1, 2	resubcld 10869	. . . 4 ⊢ (𝜑 → (𝐴 − 𝐵) ∈ ℝ)
4	3	rexrd 10490	. . 3 ⊢ (𝜑 → (𝐴 − 𝐵) ∈ ℝ^*)
5		0red 10443	. . 3 ⊢ (𝜑 → 0 ∈ ℝ)
6		fourierdlem60.altb	. . . 4 ⊢ (𝜑 → 𝐴 < 𝐵)
7	1, 2	sublt0d 11067	. . . 4 ⊢ (𝜑 → ((𝐴 − 𝐵) < 0 ↔ 𝐴 < 𝐵))
8	6, 7	mpbird 249	. . 3 ⊢ (𝜑 → (𝐴 − 𝐵) < 0)
9		fourierdlem60.f	. . . . . . 7 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
10	9	adantr 473	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
11	1	rexrd 10490	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
12	11	adantr 473	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐴 ∈ ℝ^*)
13	2	rexrd 10490	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
14	13	adantr 473	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐵 ∈ ℝ^*)
15	2	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐵 ∈ ℝ)
16		elioore 12584	. . . . . . . . 9 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) → 𝑠 ∈ ℝ)
17	16	adantl 474	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝑠 ∈ ℝ)
18	15, 17	readdcld 10469	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + 𝑠) ∈ ℝ)
19	2	recnd 10468	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℂ)
20	1	recnd 10468	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℂ)
21	19, 20	pncan3d 10801	. . . . . . . . . 10 ⊢ (𝜑 → (𝐵 + (𝐴 − 𝐵)) = 𝐴)
22	21	eqcomd 2784	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 = (𝐵 + (𝐴 − 𝐵)))
23	22	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐴 = (𝐵 + (𝐴 − 𝐵)))
24	3	adantr 473	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐴 − 𝐵) ∈ ℝ)
25	4	adantr 473	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐴 − 𝐵) ∈ ℝ^*)
26		0xr 10487	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ^*
27	26	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 0 ∈ ℝ^*)
28		simpr 477	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝑠 ∈ ((𝐴 − 𝐵)(,)0))
29		ioogtlb 41207	. . . . . . . . . 10 ⊢ (((𝐴 − 𝐵) ∈ ℝ^* ∧ 0 ∈ ℝ^* ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐴 − 𝐵) < 𝑠)
30	25, 27, 28, 29	syl3anc 1351	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐴 − 𝐵) < 𝑠)
31	24, 17, 15, 30	ltadd2dd 10599	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + (𝐴 − 𝐵)) < (𝐵 + 𝑠))
32	23, 31	eqbrtrd 4951	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐴 < (𝐵 + 𝑠))
33		0red 10443	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 0 ∈ ℝ)
34		iooltub 41223	. . . . . . . . . 10 ⊢ (((𝐴 − 𝐵) ∈ ℝ^* ∧ 0 ∈ ℝ^* ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝑠 < 0)
35	25, 27, 28, 34	syl3anc 1351	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝑠 < 0)
36	17, 33, 15, 35	ltadd2dd 10599	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + 𝑠) < (𝐵 + 0))
37	19	addid1d 10640	. . . . . . . . 9 ⊢ (𝜑 → (𝐵 + 0) = 𝐵)
38	37	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + 0) = 𝐵)
39	36, 38	breqtrd 4955	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + 𝑠) < 𝐵)
40	12, 14, 18, 32, 39	eliood 41210	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + 𝑠) ∈ (𝐴(,)𝐵))
41	10, 40	ffvelrnd 6677	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐹‘(𝐵 + 𝑠)) ∈ ℝ)
42		ioossre 12614	. . . . . . . . 9 ⊢ (𝐴(,)𝐵) ⊆ ℝ
43	42	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
44		ax-resscn 10392	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
45	43, 44	syl6ss 3870	. . . . . . 7 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
46		eqid 2778	. . . . . . . 8 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
47	46, 11, 2, 6	lptioo2cn 41363	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(𝐴(,)𝐵)))
48		fourierdlem60.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ (𝐹 lim_ℂ 𝐵))
49	9, 45, 47, 48	limcrecl 41347	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ℝ)
50	49	adantr 473	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝑌 ∈ ℝ)
51	41, 50	resubcld 10869	. . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝐹‘(𝐵 + 𝑠)) − 𝑌) ∈ ℝ)
52		fourierdlem60.n	. . . 4 ⊢ 𝑁 = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))
53	51, 52	fmptd 6701	. . 3 ⊢ (𝜑 → 𝑁:((𝐴 − 𝐵)(,)0)⟶ℝ)
54		fourierdlem60.d	. . . 4 ⊢ 𝐷 = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠)
55	17, 54	fmptd 6701	. . 3 ⊢ (𝜑 → 𝐷:((𝐴 − 𝐵)(,)0)⟶ℝ)
56	52	oveq2i 6987	. . . . . 6 ⊢ (ℝ D 𝑁) = (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌)))
57	56	a1i 11	. . . . 5 ⊢ (𝜑 → (ℝ D 𝑁) = (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))))
58	57	dmeqd 5624	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝑁) = dom (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))))
59		reelprrecn 10427	. . . . . . . 8 ⊢ ℝ ∈ {ℝ, ℂ}
60	59	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
61	41	recnd 10468	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐹‘(𝐵 + 𝑠)) ∈ ℂ)
62		dvfre 24251	. . . . . . . . . . 11 ⊢ ((𝐹:(𝐴(,)𝐵)⟶ℝ ∧ (𝐴(,)𝐵) ⊆ ℝ) → (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ)
63	9, 43, 62	syl2anc 576	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ)
64		fourierdlem60.g	. . . . . . . . . . . 12 ⊢ 𝐺 = (ℝ D 𝐹)
65	64	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 = (ℝ D 𝐹))
66	65	feq1d 6329	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺:dom (ℝ D 𝐹)⟶ℝ ↔ (ℝ D 𝐹):dom (ℝ D 𝐹)⟶ℝ))
67	63, 66	mpbird 249	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:dom (ℝ D 𝐹)⟶ℝ)
68	67	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐺:dom (ℝ D 𝐹)⟶ℝ)
69	65	eqcomd 2784	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D 𝐹) = 𝐺)
70	69	dmeqd 5624	. . . . . . . . . . 11 ⊢ (𝜑 → dom (ℝ D 𝐹) = dom 𝐺)
71		fourierdlem60.domg	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐺 = (𝐴(,)𝐵))
72	70, 71	eqtr2d 2815	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴(,)𝐵) = dom (ℝ D 𝐹))
73	72	adantr 473	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐴(,)𝐵) = dom (ℝ D 𝐹))
74	40, 73	eleqtrd 2868	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + 𝑠) ∈ dom (ℝ D 𝐹))
75	68, 74	ffvelrnd 6677	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐺‘(𝐵 + 𝑠)) ∈ ℝ)
76		1red 10440	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 1 ∈ ℝ)
77	9	ffvelrnda 6676	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐹‘𝑥) ∈ ℝ)
78	77	recnd 10468	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐹‘𝑥) ∈ ℂ)
79	72	feq2d 6330	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺:(𝐴(,)𝐵)⟶ℝ ↔ 𝐺:dom (ℝ D 𝐹)⟶ℝ))
80	67, 79	mpbird 249	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺:(𝐴(,)𝐵)⟶ℝ)
81	80	ffvelrnda 6676	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐺‘𝑥) ∈ ℝ)
82	19	adantr 473	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝐵 ∈ ℂ)
83	19	adantr 473	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝐵 ∈ ℂ)
84		0red 10443	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 0 ∈ ℝ)
85	60, 19	dvmptc 24258	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝐵)) = (𝑠 ∈ ℝ ↦ 0))
86		ioossre 12614	. . . . . . . . . . . . 13 ⊢ ((𝐴 − 𝐵)(,)0) ⊆ ℝ
87	86	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐴 − 𝐵)(,)0) ⊆ ℝ)
88	46	tgioo2 23114	. . . . . . . . . . . 12 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
89		iooretop 23077	. . . . . . . . . . . . 13 ⊢ ((𝐴 − 𝐵)(,)0) ∈ (topGen‘ran (,))
90	89	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐴 − 𝐵)(,)0) ∈ (topGen‘ran (,)))
91	60, 83, 84, 85, 87, 88, 46, 90	dvmptres 24263	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝐵)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 0))
92	17	recnd 10468	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝑠 ∈ ℂ)
93		recn 10425	. . . . . . . . . . . . 13 ⊢ (𝑠 ∈ ℝ → 𝑠 ∈ ℂ)
94	93	adantl 474	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑠 ∈ ℂ)
95		1red 10440	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 1 ∈ ℝ)
96	60	dvmptid 24257	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝑠)) = (𝑠 ∈ ℝ ↦ 1))
97	60, 94, 95, 96, 87, 88, 46, 90	dvmptres 24263	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1))
98	60, 82, 33, 91, 92, 76, 97	dvmptadd 24260	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐵 + 𝑠))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (0 + 1)))
99		0p1e1 11569	. . . . . . . . . . 11 ⊢ (0 + 1) = 1
100	99	mpteq2i 5019	. . . . . . . . . 10 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (0 + 1)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1)
101	98, 100	syl6eq 2830	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐵 + 𝑠))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1))
102	9	feqmptd 6562	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)))
103	102	eqcomd 2784	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) = 𝐹)
104	103	oveq2d 6992	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥))) = (ℝ D 𝐹))
105	80	feqmptd 6562	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)))
106	104, 69, 105	3eqtrd 2818	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)))
107		fveq2 6499	. . . . . . . . 9 ⊢ (𝑥 = (𝐵 + 𝑠) → (𝐹‘𝑥) = (𝐹‘(𝐵 + 𝑠)))
108		fveq2 6499	. . . . . . . . 9 ⊢ (𝑥 = (𝐵 + 𝑠) → (𝐺‘𝑥) = (𝐺‘(𝐵 + 𝑠)))
109	60, 60, 40, 76, 78, 81, 101, 106, 107, 108	dvmptco 24272	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐹‘(𝐵 + 𝑠)))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐺‘(𝐵 + 𝑠)) · 1)))
110	75	recnd 10468	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐺‘(𝐵 + 𝑠)) ∈ ℂ)
111	110	mulid1d 10457	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝐺‘(𝐵 + 𝑠)) · 1) = (𝐺‘(𝐵 + 𝑠)))
112	111	mpteq2dva 5022	. . . . . . . 8 ⊢ (𝜑 → (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐺‘(𝐵 + 𝑠)) · 1)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))))
113	109, 112	eqtrd 2814	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐹‘(𝐵 + 𝑠)))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))))
114		limccl 24176	. . . . . . . . 9 ⊢ (𝐹 lim_ℂ 𝐵) ⊆ ℂ
115	114, 48	sseldi 3856	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ ℂ)
116	115	adantr 473	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 𝑌 ∈ ℂ)
117	115	adantr 473	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ℝ) → 𝑌 ∈ ℂ)
118	60, 115	dvmptc 24258	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ℝ ↦ 𝑌)) = (𝑠 ∈ ℝ ↦ 0))
119	60, 117, 84, 118, 87, 88, 46, 90	dvmptres 24263	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑌)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 0))
120	60, 61, 75, 113, 116, 27, 119	dvmptsub 24267	. . . . . 6 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐺‘(𝐵 + 𝑠)) − 0)))
121	110	subid1d 10787	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝐺‘(𝐵 + 𝑠)) − 0) = (𝐺‘(𝐵 + 𝑠)))
122	121	mpteq2dva 5022	. . . . . 6 ⊢ (𝜑 → (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐺‘(𝐵 + 𝑠)) − 0)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))))
123	120, 122	eqtrd 2814	. . . . 5 ⊢ (𝜑 → (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))))
124	123	dmeqd 5624	. . . 4 ⊢ (𝜑 → dom (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))) = dom (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))))
125	75	ralrimiva 3132	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ ((𝐴 − 𝐵)(,)0)(𝐺‘(𝐵 + 𝑠)) ∈ ℝ)
126		dmmptg 5935	. . . . 5 ⊢ (∀𝑠 ∈ ((𝐴 − 𝐵)(,)0)(𝐺‘(𝐵 + 𝑠)) ∈ ℝ → dom (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))) = ((𝐴 − 𝐵)(,)0))
127	125, 126	syl 17	. . . 4 ⊢ (𝜑 → dom (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))) = ((𝐴 − 𝐵)(,)0))
128	58, 124, 127	3eqtrd 2818	. . 3 ⊢ (𝜑 → dom (ℝ D 𝑁) = ((𝐴 − 𝐵)(,)0))
129	54	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝐷 = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠))
130	129	oveq2d 6992	. . . . . 6 ⊢ (𝜑 → (ℝ D 𝐷) = (ℝ D (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠)))
131	130, 97	eqtrd 2814	. . . . 5 ⊢ (𝜑 → (ℝ D 𝐷) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1))
132	131	dmeqd 5624	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝐷) = dom (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1))
133	76	ralrimiva 3132	. . . . 5 ⊢ (𝜑 → ∀𝑠 ∈ ((𝐴 − 𝐵)(,)0)1 ∈ ℝ)
134		dmmptg 5935	. . . . 5 ⊢ (∀𝑠 ∈ ((𝐴 − 𝐵)(,)0)1 ∈ ℝ → dom (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1) = ((𝐴 − 𝐵)(,)0))
135	133, 134	syl 17	. . . 4 ⊢ (𝜑 → dom (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1) = ((𝐴 − 𝐵)(,)0))
136	132, 135	eqtrd 2814	. . 3 ⊢ (𝜑 → dom (ℝ D 𝐷) = ((𝐴 − 𝐵)(,)0))
137		eqid 2778	. . . . 5 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐹‘(𝐵 + 𝑠))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐹‘(𝐵 + 𝑠)))
138		eqid 2778	. . . . 5 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑌) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑌)
139		eqid 2778	. . . . 5 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌))
140	40	adantrr 704	. . . . . 6 ⊢ ((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) ≠ 𝐵)) → (𝐵 + 𝑠) ∈ (𝐴(,)𝐵))
141		eqid 2778	. . . . . . . 8 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝐵) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝐵)
142		eqid 2778	. . . . . . . 8 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠)
143		eqid 2778	. . . . . . . 8 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐵 + 𝑠)) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐵 + 𝑠))
144	87, 44	syl6ss 3870	. . . . . . . . 9 ⊢ (𝜑 → ((𝐴 − 𝐵)(,)0) ⊆ ℂ)
145	5	recnd 10468	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ ℂ)
146	141, 144, 19, 145	constlimc 41342	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝐵) lim_ℂ 0))
147	144, 142, 145	idlimc 41344	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠) lim_ℂ 0))
148	141, 142, 143, 82, 92, 146, 147	addlimc 41366	. . . . . . 7 ⊢ (𝜑 → (𝐵 + 0) ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐵 + 𝑠)) lim_ℂ 0))
149	37, 148	eqeltrrd 2867	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐵 + 𝑠)) lim_ℂ 0))
150	102	oveq1d 6991	. . . . . . 7 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐵) = ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) lim_ℂ 𝐵))
151	48, 150	eleqtrd 2868	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) lim_ℂ 𝐵))
152		simplrr 765	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) = 𝐵)) ∧ ¬ (𝐹‘(𝐵 + 𝑠)) = 𝑌) → (𝐵 + 𝑠) = 𝐵)
153	18, 39	ltned 10576	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐵 + 𝑠) ≠ 𝐵)
154	153	neneqd 2972	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ¬ (𝐵 + 𝑠) = 𝐵)
155	154	adantrr 704	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) = 𝐵)) → ¬ (𝐵 + 𝑠) = 𝐵)
156	155	adantr 473	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) = 𝐵)) ∧ ¬ (𝐹‘(𝐵 + 𝑠)) = 𝑌) → ¬ (𝐵 + 𝑠) = 𝐵)
157	152, 156	condan 805	. . . . . 6 ⊢ ((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) = 𝐵)) → (𝐹‘(𝐵 + 𝑠)) = 𝑌)
158	140, 78, 149, 151, 107, 157	limcco 24194	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐹‘(𝐵 + 𝑠))) lim_ℂ 0))
159	138, 144, 115, 145	constlimc 41342	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑌) lim_ℂ 0))
160	137, 138, 139, 61, 116, 158, 159	sublimc 41370	. . . 4 ⊢ (𝜑 → (𝑌 − 𝑌) ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌)) lim_ℂ 0))
161	115	subidd 10786	. . . 4 ⊢ (𝜑 → (𝑌 − 𝑌) = 0)
162	52	eqcomi 2787	. . . . . 6 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌)) = 𝑁
163	162	oveq1i 6986	. . . . 5 ⊢ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌)) lim_ℂ 0) = (𝑁 lim_ℂ 0)
164	163	a1i 11	. . . 4 ⊢ (𝜑 → ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝐹‘(𝐵 + 𝑠)) − 𝑌)) lim_ℂ 0) = (𝑁 lim_ℂ 0))
165	160, 161, 164	3eltr3d 2880	. . 3 ⊢ (𝜑 → 0 ∈ (𝑁 lim_ℂ 0))
166	144, 54, 145	idlimc 41344	. . 3 ⊢ (𝜑 → 0 ∈ (𝐷 lim_ℂ 0))
167		ubioo 12586	. . . . 5 ⊢ ¬ 0 ∈ ((𝐴 − 𝐵)(,)0)
168	167	a1i 11	. . . 4 ⊢ (𝜑 → ¬ 0 ∈ ((𝐴 − 𝐵)(,)0))
169		mptresid 5762	. . . . . . 7 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 𝑠) = ( I ↾ ((𝐴 − 𝐵)(,)0))
170	129, 169	syl6eq 2830	. . . . . 6 ⊢ (𝜑 → 𝐷 = ( I ↾ ((𝐴 − 𝐵)(,)0)))
171	170	rneqd 5651	. . . . 5 ⊢ (𝜑 → ran 𝐷 = ran ( I ↾ ((𝐴 − 𝐵)(,)0)))
172		rnresi 5783	. . . . 5 ⊢ ran ( I ↾ ((𝐴 − 𝐵)(,)0)) = ((𝐴 − 𝐵)(,)0)
173	171, 172	syl6req 2831	. . . 4 ⊢ (𝜑 → ((𝐴 − 𝐵)(,)0) = ran 𝐷)
174	168, 173	neleqtrd 2887	. . 3 ⊢ (𝜑 → ¬ 0 ∈ ran 𝐷)
175		0ne1 11511	. . . . . 6 ⊢ 0 ≠ 1
176	175	neii 2969	. . . . 5 ⊢ ¬ 0 = 1
177		elsng 4455	. . . . . 6 ⊢ (0 ∈ ℝ → (0 ∈ {1} ↔ 0 = 1))
178	5, 177	syl 17	. . . . 5 ⊢ (𝜑 → (0 ∈ {1} ↔ 0 = 1))
179	176, 178	mtbiri 319	. . . 4 ⊢ (𝜑 → ¬ 0 ∈ {1})
180	131	rneqd 5651	. . . . 5 ⊢ (𝜑 → ran (ℝ D 𝐷) = ran (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1))
181		eqid 2778	. . . . . 6 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1)
182	26	a1i 11	. . . . . . . 8 ⊢ (𝜑 → 0 ∈ ℝ^*)
183		ioon0 12580	. . . . . . . 8 ⊢ (((𝐴 − 𝐵) ∈ ℝ^* ∧ 0 ∈ ℝ^*) → (((𝐴 − 𝐵)(,)0) ≠ ∅ ↔ (𝐴 − 𝐵) < 0))
184	4, 182, 183	syl2anc 576	. . . . . . 7 ⊢ (𝜑 → (((𝐴 − 𝐵)(,)0) ≠ ∅ ↔ (𝐴 − 𝐵) < 0))
185	8, 184	mpbird 249	. . . . . 6 ⊢ (𝜑 → ((𝐴 − 𝐵)(,)0) ≠ ∅)
186	181, 76, 185	rnmptc 6796	. . . . 5 ⊢ (𝜑 → ran (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1) = {1})
187	180, 186	eqtr2d 2815	. . . 4 ⊢ (𝜑 → {1} = ran (ℝ D 𝐷))
188	179, 187	neleqtrd 2887	. . 3 ⊢ (𝜑 → ¬ 0 ∈ ran (ℝ D 𝐷))
189	81	recnd 10468	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐺‘𝑥) ∈ ℂ)
190		fourierdlem60.e	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (𝐺 lim_ℂ 𝐵))
191	105	oveq1d 6991	. . . . . 6 ⊢ (𝜑 → (𝐺 lim_ℂ 𝐵) = ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)) lim_ℂ 𝐵))
192	190, 191	eleqtrd 2868	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ ((𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐺‘𝑥)) lim_ℂ 𝐵))
193		simplrr 765	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) = 𝐵)) ∧ ¬ (𝐺‘(𝐵 + 𝑠)) = 𝐸) → (𝐵 + 𝑠) = 𝐵)
194	155	adantr 473	. . . . . 6 ⊢ (((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) = 𝐵)) ∧ ¬ (𝐺‘(𝐵 + 𝑠)) = 𝐸) → ¬ (𝐵 + 𝑠) = 𝐵)
195	193, 194	condan 805	. . . . 5 ⊢ ((𝜑 ∧ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐵 + 𝑠) = 𝐵)) → (𝐺‘(𝐵 + 𝑠)) = 𝐸)
196	140, 189, 149, 192, 108, 195	limcco 24194	. . . 4 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))) lim_ℂ 0))
197	110	div1d 11209	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝐺‘(𝐵 + 𝑠)) / 1) = (𝐺‘(𝐵 + 𝑠)))
198	56, 123	syl5eq 2826	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D 𝑁) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))))
199	198	adantr 473	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (ℝ D 𝑁) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))))
200	199	fveq1d 6501	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((ℝ D 𝑁)‘𝑠) = ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠)))‘𝑠))
201		eqid 2778	. . . . . . . . . . 11 ⊢ (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠)))
202	201	fvmpt2 6605	. . . . . . . . . 10 ⊢ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ (𝐺‘(𝐵 + 𝑠)) ∈ ℝ) → ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠)))‘𝑠) = (𝐺‘(𝐵 + 𝑠)))
203	28, 75, 202	syl2anc 576	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠)))‘𝑠) = (𝐺‘(𝐵 + 𝑠)))
204	200, 203	eqtr2d 2815	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐺‘(𝐵 + 𝑠)) = ((ℝ D 𝑁)‘𝑠))
205	131	fveq1d 6501	. . . . . . . . . 10 ⊢ (𝜑 → ((ℝ D 𝐷)‘𝑠) = ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1)‘𝑠))
206	205	adantr 473	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((ℝ D 𝐷)‘𝑠) = ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1)‘𝑠))
207	181	fvmpt2 6605	. . . . . . . . . 10 ⊢ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ 1 ∈ ℝ) → ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1)‘𝑠) = 1)
208	28, 76, 207	syl2anc 576	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ 1)‘𝑠) = 1)
209	206, 208	eqtr2d 2815	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → 1 = ((ℝ D 𝐷)‘𝑠))
210	204, 209	oveq12d 6994	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝐺‘(𝐵 + 𝑠)) / 1) = (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠)))
211	197, 210	eqtr3d 2816	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐺‘(𝐵 + 𝑠)) = (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠)))
212	211	mpteq2dva 5022	. . . . 5 ⊢ (𝜑 → (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))))
213	212	oveq1d 6991	. . . 4 ⊢ (𝜑 → ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (𝐺‘(𝐵 + 𝑠))) lim_ℂ 0) = ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))) lim_ℂ 0))
214	196, 213	eleqtrd 2868	. . 3 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (((ℝ D 𝑁)‘𝑠) / ((ℝ D 𝐷)‘𝑠))) lim_ℂ 0))
215	4, 5, 8, 53, 55, 128, 136, 165, 166, 174, 188, 214	lhop2 24315	. 2 ⊢ (𝜑 → 𝐸 ∈ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) lim_ℂ 0))
216	52	fvmpt2 6605	. . . . . . 7 ⊢ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ ((𝐹‘(𝐵 + 𝑠)) − 𝑌) ∈ ℝ) → (𝑁‘𝑠) = ((𝐹‘(𝐵 + 𝑠)) − 𝑌))
217	28, 51, 216	syl2anc 576	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝑁‘𝑠) = ((𝐹‘(𝐵 + 𝑠)) − 𝑌))
218	54	fvmpt2 6605	. . . . . . 7 ⊢ ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐷‘𝑠) = 𝑠)
219	28, 28, 218	syl2anc 576	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → (𝐷‘𝑠) = 𝑠)
220	217, 219	oveq12d 6994	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ ((𝐴 − 𝐵)(,)0)) → ((𝑁‘𝑠) / (𝐷‘𝑠)) = (((𝐹‘(𝐵 + 𝑠)) − 𝑌) / 𝑠))
221	220	mpteq2dva 5022	. . . 4 ⊢ (𝜑 → (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (((𝐹‘(𝐵 + 𝑠)) − 𝑌) / 𝑠)))
222		fourierdlem60.h	. . . 4 ⊢ 𝐻 = (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ (((𝐹‘(𝐵 + 𝑠)) − 𝑌) / 𝑠))
223	221, 222	syl6eqr 2832	. . 3 ⊢ (𝜑 → (𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) = 𝐻)
224	223	oveq1d 6991	. 2 ⊢ (𝜑 → ((𝑠 ∈ ((𝐴 − 𝐵)(,)0) ↦ ((𝑁‘𝑠) / (𝐷‘𝑠))) lim_ℂ 0) = (𝐻 lim_ℂ 0))
225	215, 224	eleqtrd 2868	1 ⊢ (𝜑 → 𝐸 ∈ (𝐻 lim_ℂ 0))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 198 ∧ wa 387 = wceq 1507 ∈ wcel 2050 ≠ wne 2967 ∀wral 3088 ⊆ wss 3829 ∅c0 4178 {csn 4441 {cpr 4443 class class class wbr 4929 ↦ cmpt 5008 I cid 5311 dom cdm 5407 ran crn 5408 ↾ cres 5409 ⟶wf 6184 ‘cfv 6188 (class class class)co 6976 ℂcc 10333 ℝcr 10334 0cc0 10335 1c1 10336 + caddc 10338 · cmul 10340 ℝ^*cxr 10473 < clt 10474 − cmin 10670 / cdiv 11098 (,)cioo 12554 TopOpenctopn 16551 topGenctg 16567 ℂ_fldccnfld 20247 lim_ℂ climc 24163 D cdv 24164

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2750 ax-rep 5049 ax-sep 5060 ax-nul 5067 ax-pow 5119 ax-pr 5186 ax-un 7279 ax-cnex 10391 ax-resscn 10392 ax-1cn 10393 ax-icn 10394 ax-addcl 10395 ax-addrcl 10396 ax-mulcl 10397 ax-mulrcl 10398 ax-mulcom 10399 ax-addass 10400 ax-mulass 10401 ax-distr 10402 ax-i2m1 10403 ax-1ne0 10404 ax-1rid 10405 ax-rnegex 10406 ax-rrecex 10407 ax-cnre 10408 ax-pre-lttri 10409 ax-pre-lttrn 10410 ax-pre-ltadd 10411 ax-pre-mulgt0 10412 ax-pre-sup 10413 ax-addf 10414 ax-mulf 10415

This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3or 1069 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2759 df-cleq 2771 df-clel 2846 df-nfc 2918 df-ne 2968 df-nel 3074 df-ral 3093 df-rex 3094 df-reu 3095 df-rmo 3096 df-rab 3097 df-v 3417 df-sbc 3682 df-csb 3787 df-dif 3832 df-un 3834 df-in 3836 df-ss 3843 df-pss 3845 df-nul 4179 df-if 4351 df-pw 4424 df-sn 4442 df-pr 4444 df-tp 4446 df-op 4448 df-uni 4713 df-int 4750 df-iun 4794 df-iin 4795 df-br 4930 df-opab 4992 df-mpt 5009 df-tr 5031 df-id 5312 df-eprel 5317 df-po 5326 df-so 5327 df-fr 5366 df-se 5367 df-we 5368 df-xp 5413 df-rel 5414 df-cnv 5415 df-co 5416 df-dm 5417 df-rn 5418 df-res 5419 df-ima 5420 df-pred 5986 df-ord 6032 df-on 6033 df-lim 6034 df-suc 6035 df-iota 6152 df-fun 6190 df-fn 6191 df-f 6192 df-f1 6193 df-fo 6194 df-f1o 6195 df-fv 6196 df-isom 6197 df-riota 6937 df-ov 6979 df-oprab 6980 df-mpo 6981 df-of 7227 df-om 7397 df-1st 7501 df-2nd 7502 df-supp 7634 df-wrecs 7750 df-recs 7812 df-rdg 7850 df-1o 7905 df-2o 7906 df-oadd 7909 df-er 8089 df-map 8208 df-pm 8209 df-ixp 8260 df-en 8307 df-dom 8308 df-sdom 8309 df-fin 8310 df-fsupp 8629 df-fi 8670 df-sup 8701 df-inf 8702 df-oi 8769 df-card 9162 df-cda 9388 df-pnf 10476 df-mnf 10477 df-xr 10478 df-ltxr 10479 df-le 10480 df-sub 10672 df-neg 10673 df-div 11099 df-nn 11440 df-2 11503 df-3 11504 df-4 11505 df-5 11506 df-6 11507 df-7 11508 df-8 11509 df-9 11510 df-n0 11708 df-z 11794 df-dec 11912 df-uz 12059 df-q 12163 df-rp 12205 df-xneg 12324 df-xadd 12325 df-xmul 12326 df-ioo 12558 df-ioc 12559 df-ico 12560 df-icc 12561 df-fz 12709 df-fzo 12850 df-seq 13185 df-exp 13245 df-hash 13506 df-cj 14319 df-re 14320 df-im 14321 df-sqrt 14455 df-abs 14456 df-struct 16341 df-ndx 16342 df-slot 16343 df-base 16345 df-sets 16346 df-ress 16347 df-plusg 16434 df-mulr 16435 df-starv 16436 df-sca 16437 df-vsca 16438 df-ip 16439 df-tset 16440 df-ple 16441 df-ds 16443 df-unif 16444 df-hom 16445 df-cco 16446 df-rest 16552 df-topn 16553 df-0g 16571 df-gsum 16572 df-topgen 16573 df-pt 16574 df-prds 16577 df-xrs 16631 df-qtop 16636 df-imas 16637 df-xps 16639 df-mre 16715 df-mrc 16716 df-acs 16718 df-mgm 17710 df-sgrp 17752 df-mnd 17763 df-submnd 17804 df-mulg 18012 df-cntz 18218 df-cmn 18668 df-psmet 20239 df-xmet 20240 df-met 20241 df-bl 20242 df-mopn 20243 df-fbas 20244 df-fg 20245 df-cnfld 20248 df-top 21206 df-topon 21223 df-topsp 21245 df-bases 21258 df-cld 21331 df-ntr 21332 df-cls 21333 df-nei 21410 df-lp 21448 df-perf 21449 df-cn 21539 df-cnp 21540 df-haus 21627 df-cmp 21699 df-tx 21874 df-hmeo 22067 df-fil 22158 df-fm 22250 df-flim 22251 df-flf 22252 df-xms 22633 df-ms 22634 df-tms 22635 df-cncf 23189 df-limc 24167 df-dv 24168

This theorem is referenced by: fourierdlem74 41902

W3C validator