fourierdlem59 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem59 43596

Description: The derivative of 𝐻 is continuous on the given interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem59.f	⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
fourierdlem59.x	⊢ (𝜑 → 𝑋 ∈ ℝ)
fourierdlem59.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem59.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem59.n0	⊢ (𝜑 → ¬ 0 ∈ (𝐴(,)𝐵))
fourierdlem59.fdv	⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℝ))
fourierdlem59.c	⊢ (𝜑 → 𝐶 ∈ ℝ)
fourierdlem59.h	⊢ 𝐻 = (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠))

**Assertion**
Ref	Expression
fourierdlem59	⊢ (𝜑 → (ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℝ))

Distinct variable groups: 𝐴,𝑠 𝐵,𝑠 𝐶,𝑠 𝐹,𝑠 𝑋,𝑠 𝜑,𝑠 Allowed substitution hint: 𝐻(𝑠)

**Proof of Theorem fourierdlem59**
Step	Hyp	Ref	Expression
1		fourierdlem59.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ)
2	1	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐹:ℝ⟶ℝ)
3		fourierdlem59.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ℝ)
4	3	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑋 ∈ ℝ)
5		elioore 13038	. . . . . . . . . 10 ⊢ (𝑠 ∈ (𝐴(,)𝐵) → 𝑠 ∈ ℝ)
6	5	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℝ)
7	4, 6	readdcld 10935	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) ∈ ℝ)
8	2, 7	ffvelrnd 6944	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐹‘(𝑋 + 𝑠)) ∈ ℝ)
9		fourierdlem59.c	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ)
10	9	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ ℝ)
11	8, 10	resubcld 11333	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) − 𝐶) ∈ ℝ)
12		eqcom 2745	. . . . . . . . . . . 12 ⊢ (𝑠 = 0 ↔ 0 = 𝑠)
13	12	biimpi 215	. . . . . . . . . . 11 ⊢ (𝑠 = 0 → 0 = 𝑠)
14	13	adantl 481	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (𝐴(,)𝐵) ∧ 𝑠 = 0) → 0 = 𝑠)
15		simpl 482	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (𝐴(,)𝐵) ∧ 𝑠 = 0) → 𝑠 ∈ (𝐴(,)𝐵))
16	14, 15	eqeltrd 2839	. . . . . . . . 9 ⊢ ((𝑠 ∈ (𝐴(,)𝐵) ∧ 𝑠 = 0) → 0 ∈ (𝐴(,)𝐵))
17	16	adantll 710	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) ∧ 𝑠 = 0) → 0 ∈ (𝐴(,)𝐵))
18		fourierdlem59.n0	. . . . . . . . 9 ⊢ (𝜑 → ¬ 0 ∈ (𝐴(,)𝐵))
19	18	ad2antrr 722	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) ∧ 𝑠 = 0) → ¬ 0 ∈ (𝐴(,)𝐵))
20	17, 19	pm2.65da 813	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ¬ 𝑠 = 0)
21	20	neqned 2949	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ≠ 0)
22	11, 6, 21	redivcld 11733	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠) ∈ ℝ)
23		fourierdlem59.h	. . . . 5 ⊢ 𝐻 = (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠))
24	22, 23	fmptd 6970	. . . 4 ⊢ (𝜑 → 𝐻:(𝐴(,)𝐵)⟶ℝ)
25		ioossre 13069	. . . . 5 ⊢ (𝐴(,)𝐵) ⊆ ℝ
26	25	a1i 11	. . . 4 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
27		dvfre 25020	. . . 4 ⊢ ((𝐻:(𝐴(,)𝐵)⟶ℝ ∧ (𝐴(,)𝐵) ⊆ ℝ) → (ℝ D 𝐻):dom (ℝ D 𝐻)⟶ℝ)
28	24, 26, 27	syl2anc 583	. . 3 ⊢ (𝜑 → (ℝ D 𝐻):dom (ℝ D 𝐻)⟶ℝ)
29		ovex 7288	. . . . . . . . . 10 ⊢ (𝐴(,)𝐵) ∈ V
30	29	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (𝐴(,)𝐵) ∈ V)
31		eqidd 2739	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)))
32		eqidd 2739	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠))
33	30, 11, 6, 31, 32	offval2 7531	. . . . . . . 8 ⊢ (𝜑 → ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠)))
34	23, 33	eqtr4id 2798	. . . . . . 7 ⊢ (𝜑 → 𝐻 = ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)))
35	34	oveq2d 7271	. . . . . 6 ⊢ (𝜑 → (ℝ D 𝐻) = (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠))))
36		reelprrecn 10894	. . . . . . . 8 ⊢ ℝ ∈ {ℝ, ℂ}
37	36	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
38	11	recnd 10934	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) − 𝐶) ∈ ℂ)
39		eqid 2738	. . . . . . . 8 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶))
40	38, 39	fmptd 6970	. . . . . . 7 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)):(𝐴(,)𝐵)⟶ℂ)
41	6	recnd 10934	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℂ)
42		eldifsn 4717	. . . . . . . . 9 ⊢ (𝑠 ∈ (ℂ ∖ {0}) ↔ (𝑠 ∈ ℂ ∧ 𝑠 ≠ 0))
43	41, 21, 42	sylanbrc 582	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ (ℂ ∖ {0}))
44		eqid 2738	. . . . . . . 8 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)
45	43, 44	fmptd 6970	. . . . . . 7 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠):(𝐴(,)𝐵)⟶(ℂ ∖ {0}))
46		eqidd 2739	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))))
47		eqidd 2739	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶))
48	30, 8, 10, 46, 47	offval2 7531	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)))
49	48	eqcomd 2744	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) = ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)))
50	49	oveq2d 7271	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶))) = (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶))))
51	8	recnd 10934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐹‘(𝑋 + 𝑠)) ∈ ℂ)
52		eqid 2738	. . . . . . . . . 10 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠)))
53	51, 52	fmptd 6970	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))):(𝐴(,)𝐵)⟶ℂ)
54	10	recnd 10934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ ℂ)
55		eqid 2738	. . . . . . . . . 10 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)
56	54, 55	fmptd 6970	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶):(𝐴(,)𝐵)⟶ℂ)
57		fourierdlem59.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ)
58		fourierdlem59.b	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ)
59		eqid 2738	. . . . . . . . . . 11 ⊢ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) = (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵))))
60		fourierdlem59.fdv	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℝ))
61		cncff 23962	. . . . . . . . . . . 12 ⊢ ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℝ) → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℝ)
62	60, 61	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℝ)
63	1, 3, 57, 58, 59, 62	fourierdlem28 43566	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠)))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵))))‘(𝑋 + 𝑠))))
64		ioosscn 13070	. . . . . . . . . . . 12 ⊢ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)) ⊆ ℂ
65	64	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)) ⊆ ℂ)
66		ax-resscn 10859	. . . . . . . . . . . . . 14 ⊢ ℝ ⊆ ℂ
67	66	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ⊆ ℂ)
68	62, 67	fssd 6602	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℂ)
69		ssid 3939	. . . . . . . . . . . . . 14 ⊢ ℂ ⊆ ℂ
70	69	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℂ ⊆ ℂ)
71		cncffvrn 23967	. . . . . . . . . . . . 13 ⊢ ((ℂ ⊆ ℂ ∧ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℝ)) → ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℂ) ↔ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℂ))
72	70, 60, 71	syl2anc 583	. . . . . . . . . . . 12 ⊢ (𝜑 → ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℂ) ↔ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℂ))
73	68, 72	mpbird 256	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℂ))
74		ioosscn 13070	. . . . . . . . . . . 12 ⊢ (𝐴(,)𝐵) ⊆ ℂ
75	74	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
76	3	recnd 10934	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ℂ)
77	3, 57	readdcld 10935	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋 + 𝐴) ∈ ℝ)
78	77	rexrd 10956	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 + 𝐴) ∈ ℝ^*)
79	78	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐴) ∈ ℝ^*)
80	3, 58	readdcld 10935	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋 + 𝐵) ∈ ℝ)
81	80	rexrd 10956	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 + 𝐵) ∈ ℝ^*)
82	81	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐵) ∈ ℝ^*)
83	57	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ)
84	83	rexrd 10956	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ^*)
85	58	rexrd 10956	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
86	85	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ^*)
87		simpr 484	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ (𝐴(,)𝐵))
88		ioogtlb 42923	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝑠)
89	84, 86, 87, 88	syl3anc 1369	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝑠)
90	83, 6, 4, 89	ltadd2dd 11064	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐴) < (𝑋 + 𝑠))
91	58	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ)
92		iooltub 42938	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 𝐵)
93	84, 86, 87, 92	syl3anc 1369	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 𝐵)
94	6, 91, 4, 93	ltadd2dd 11064	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) < (𝑋 + 𝐵))
95	79, 82, 7, 90, 94	eliood 42926	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) ∈ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))
96	65, 73, 75, 76, 95	fourierdlem23 43561	. . . . . . . . . 10 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵))))‘(𝑋 + 𝑠))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
97	63, 96	eqeltrd 2839	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠)))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
98		iooretop 23835	. . . . . . . . . . . . 13 ⊢ (𝐴(,)𝐵) ∈ (topGen‘ran (,))
99		eqid 2738	. . . . . . . . . . . . . 14 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
100	99	tgioo2 23872	. . . . . . . . . . . . 13 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
101	98, 100	eleqtri 2837	. . . . . . . . . . . 12 ⊢ (𝐴(,)𝐵) ∈ ((TopOpen‘ℂ_fld) ↾_t ℝ)
102	101	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴(,)𝐵) ∈ ((TopOpen‘ℂ_fld) ↾_t ℝ))
103	9	recnd 10934	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ ℂ)
104	37, 102, 103	dvmptconst 43346	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 0))
105		0cnd 10899	. . . . . . . . . . 11 ⊢ (𝜑 → 0 ∈ ℂ)
106	75, 105, 70	constcncfg 43303	. . . . . . . . . 10 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 0) ∈ ((𝐴(,)𝐵)–cn→ℂ))
107	104, 106	eqeltrd 2839	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
108	37, 53, 56, 97, 107	dvsubcncf 43355	. . . . . . . 8 ⊢ (𝜑 → (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
109	50, 108	eqeltrd 2839	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
110	37, 102	dvmptidg 43348	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 1))
111		1cnd 10901	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℂ)
112	75, 111, 70	constcncfg 43303	. . . . . . . 8 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 1) ∈ ((𝐴(,)𝐵)–cn→ℂ))
113	110, 112	eqeltrd 2839	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
114	37, 40, 45, 109, 113	dvdivcncf 43358	. . . . . 6 ⊢ (𝜑 → (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
115	35, 114	eqeltrd 2839	. . . . 5 ⊢ (𝜑 → (ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℂ))
116		cncff 23962	. . . . 5 ⊢ ((ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℂ) → (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℂ)
117		fdm 6593	. . . . 5 ⊢ ((ℝ D 𝐻):(𝐴(,)𝐵)⟶ℂ → dom (ℝ D 𝐻) = (𝐴(,)𝐵))
118	115, 116, 117	3syl 18	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝐻) = (𝐴(,)𝐵))
119	118	feq2d 6570	. . 3 ⊢ (𝜑 → ((ℝ D 𝐻):dom (ℝ D 𝐻)⟶ℝ ↔ (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℝ))
120	28, 119	mpbid 231	. 2 ⊢ (𝜑 → (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℝ)
121		cncffvrn 23967	. . 3 ⊢ ((ℝ ⊆ ℂ ∧ (ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℂ)) → ((ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℝ) ↔ (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℝ))
122	67, 115, 121	syl2anc 583	. 2 ⊢ (𝜑 → ((ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℝ) ↔ (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℝ))
123	120, 122	mpbird 256	1 ⊢ (𝜑 → (ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℝ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 Vcvv 3422 ∖ cdif 3880 ⊆ wss 3883 {csn 4558 {cpr 4560 class class class wbr 5070 ↦ cmpt 5153 dom cdm 5580 ran crn 5581 ↾ cres 5582 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ∘_f cof 7509 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 ℝ^*cxr 10939 < clt 10940 − cmin 11135 / cdiv 11562 (,)cioo 13008 ↾_t crest 17048 TopOpenctopn 17049 topGenctg 17065 ℂ_fldccnfld 20510 –cn→ccncf 23945 D cdv 24932

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 ax-addf 10881 ax-mulf 10882

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-of 7511 df-om 7688 df-1st 7804 df-2nd 7805 df-supp 7949 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-2o 8268 df-er 8456 df-map 8575 df-pm 8576 df-ixp 8644 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fsupp 9059 df-fi 9100 df-sup 9131 df-inf 9132 df-oi 9199 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-q 12618 df-rp 12660 df-xneg 12777 df-xadd 12778 df-xmul 12779 df-ioo 13012 df-icc 13015 df-fz 13169 df-fzo 13312 df-seq 13650 df-exp 13711 df-hash 13973 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-struct 16776 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-starv 16903 df-sca 16904 df-vsca 16905 df-ip 16906 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-hom 16912 df-cco 16913 df-rest 17050 df-topn 17051 df-0g 17069 df-gsum 17070 df-topgen 17071 df-pt 17072 df-prds 17075 df-xrs 17130 df-qtop 17135 df-imas 17136 df-xps 17138 df-mre 17212 df-mrc 17213 df-acs 17215 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-submnd 18346 df-mulg 18616 df-cntz 18838 df-cmn 19303 df-psmet 20502 df-xmet 20503 df-met 20504 df-bl 20505 df-mopn 20506 df-fbas 20507 df-fg 20508 df-cnfld 20511 df-top 21951 df-topon 21968 df-topsp 21990 df-bases 22004 df-cld 22078 df-ntr 22079 df-cls 22080 df-nei 22157 df-lp 22195 df-perf 22196 df-cn 22286 df-cnp 22287 df-t1 22373 df-haus 22374 df-tx 22621 df-hmeo 22814 df-fil 22905 df-fm 22997 df-flim 22998 df-flf 22999 df-xms 23381 df-ms 23382 df-tms 23383 df-cncf 23947 df-limc 24935 df-dv 24936

This theorem is referenced by: fourierdlem72 43609

W3C validator