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 44867

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 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐹:ℝ⟶ℝ)
3		fourierdlem59.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ ℝ)
4	3	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑋 ∈ ℝ)
5		elioore 13350	. . . . . . . . . 10 ⊢ (𝑠 ∈ (𝐴(,)𝐵) → 𝑠 ∈ ℝ)
6	5	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℝ)
7	4, 6	readdcld 11239	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) ∈ ℝ)
8	2, 7	ffvelcdmd 7084	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐹‘(𝑋 + 𝑠)) ∈ ℝ)
9		fourierdlem59.c	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ)
10	9	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ ℝ)
11	8, 10	resubcld 11638	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) − 𝐶) ∈ ℝ)
12		eqcom 2739	. . . . . . . . . . . 12 ⊢ (𝑠 = 0 ↔ 0 = 𝑠)
13	12	biimpi 215	. . . . . . . . . . 11 ⊢ (𝑠 = 0 → 0 = 𝑠)
14	13	adantl 482	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (𝐴(,)𝐵) ∧ 𝑠 = 0) → 0 = 𝑠)
15		simpl 483	. . . . . . . . . 10 ⊢ ((𝑠 ∈ (𝐴(,)𝐵) ∧ 𝑠 = 0) → 𝑠 ∈ (𝐴(,)𝐵))
16	14, 15	eqeltrd 2833	. . . . . . . . 9 ⊢ ((𝑠 ∈ (𝐴(,)𝐵) ∧ 𝑠 = 0) → 0 ∈ (𝐴(,)𝐵))
17	16	adantll 712	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) ∧ 𝑠 = 0) → 0 ∈ (𝐴(,)𝐵))
18		fourierdlem59.n0	. . . . . . . . 9 ⊢ (𝜑 → ¬ 0 ∈ (𝐴(,)𝐵))
19	18	ad2antrr 724	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) ∧ 𝑠 = 0) → ¬ 0 ∈ (𝐴(,)𝐵))
20	17, 19	pm2.65da 815	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ¬ 𝑠 = 0)
21	20	neqned 2947	. . . . . 6 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ≠ 0)
22	11, 6, 21	redivcld 12038	. . . . 5 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠) ∈ ℝ)
23		fourierdlem59.h	. . . . 5 ⊢ 𝐻 = (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠))
24	22, 23	fmptd 7110	. . . 4 ⊢ (𝜑 → 𝐻:(𝐴(,)𝐵)⟶ℝ)
25		ioossre 13381	. . . . 5 ⊢ (𝐴(,)𝐵) ⊆ ℝ
26	25	a1i 11	. . . 4 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℝ)
27		dvfre 25459	. . . 4 ⊢ ((𝐻:(𝐴(,)𝐵)⟶ℝ ∧ (𝐴(,)𝐵) ⊆ ℝ) → (ℝ D 𝐻):dom (ℝ D 𝐻)⟶ℝ)
28	24, 26, 27	syl2anc 584	. . 3 ⊢ (𝜑 → (ℝ D 𝐻):dom (ℝ D 𝐻)⟶ℝ)
29		ovex 7438	. . . . . . . . . 10 ⊢ (𝐴(,)𝐵) ∈ V
30	29	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (𝐴(,)𝐵) ∈ V)
31		eqidd 2733	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)))
32		eqidd 2733	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠))
33	30, 11, 6, 31, 32	offval2 7686	. . . . . . . 8 ⊢ (𝜑 → ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (((𝐹‘(𝑋 + 𝑠)) − 𝐶) / 𝑠)))
34	23, 33	eqtr4id 2791	. . . . . . 7 ⊢ (𝜑 → 𝐻 = ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)))
35	34	oveq2d 7421	. . . . . 6 ⊢ (𝜑 → (ℝ D 𝐻) = (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠))))
36		reelprrecn 11198	. . . . . . . 8 ⊢ ℝ ∈ {ℝ, ℂ}
37	36	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ∈ {ℝ, ℂ})
38	11	recnd 11238	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → ((𝐹‘(𝑋 + 𝑠)) − 𝐶) ∈ ℂ)
39		eqid 2732	. . . . . . . 8 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶))
40	38, 39	fmptd 7110	. . . . . . 7 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)):(𝐴(,)𝐵)⟶ℂ)
41	6	recnd 11238	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ ℂ)
42		eldifsn 4789	. . . . . . . . 9 ⊢ (𝑠 ∈ (ℂ ∖ {0}) ↔ (𝑠 ∈ ℂ ∧ 𝑠 ≠ 0))
43	41, 21, 42	sylanbrc 583	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ (ℂ ∖ {0}))
44		eqid 2732	. . . . . . . 8 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)
45	43, 44	fmptd 7110	. . . . . . 7 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠):(𝐴(,)𝐵)⟶(ℂ ∖ {0}))
46		eqidd 2733	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))))
47		eqidd 2733	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶))
48	30, 8, 10, 46, 47	offval2 7686	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)))
49	48	eqcomd 2738	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) = ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)))
50	49	oveq2d 7421	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶))) = (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶))))
51	8	recnd 11238	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝐹‘(𝑋 + 𝑠)) ∈ ℂ)
52		eqid 2732	. . . . . . . . . 10 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠)))
53	51, 52	fmptd 7110	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))):(𝐴(,)𝐵)⟶ℂ)
54	10	recnd 11238	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐶 ∈ ℂ)
55		eqid 2732	. . . . . . . . . 10 ⊢ (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)
56	54, 55	fmptd 7110	. . . . . . . . 9 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶):(𝐴(,)𝐵)⟶ℂ)
57		fourierdlem59.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ ℝ)
58		fourierdlem59.b	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 ∈ ℝ)
59		eqid 2732	. . . . . . . . . . 11 ⊢ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) = (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵))))
60		fourierdlem59.fdv	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℝ))
61		cncff 24400	. . . . . . . . . . . 12 ⊢ ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℝ) → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℝ)
62	60, 61	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℝ)
63	1, 3, 57, 58, 59, 62	fourierdlem28 44837	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠)))) = (𝑠 ∈ (𝐴(,)𝐵) ↦ ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵))))‘(𝑋 + 𝑠))))
64		ioosscn 13382	. . . . . . . . . . . 12 ⊢ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)) ⊆ ℂ
65	64	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)) ⊆ ℂ)
66		ax-resscn 11163	. . . . . . . . . . . . . 14 ⊢ ℝ ⊆ ℂ
67	66	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ⊆ ℂ)
68	62, 67	fssd 6732	. . . . . . . . . . . 12 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℂ)
69		ssid 4003	. . . . . . . . . . . . . 14 ⊢ ℂ ⊆ ℂ
70	69	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℂ ⊆ ℂ)
71		cncfcdm 24405	. . . . . . . . . . . . 13 ⊢ ((ℂ ⊆ ℂ ∧ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℝ)) → ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℂ) ↔ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℂ))
72	70, 60, 71	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℂ) ↔ (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))):((𝑋 + 𝐴)(,)(𝑋 + 𝐵))⟶ℂ))
73	68, 72	mpbird 256	. . . . . . . . . . 11 ⊢ (𝜑 → (ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))) ∈ (((𝑋 + 𝐴)(,)(𝑋 + 𝐵))–cn→ℂ))
74		ioosscn 13382	. . . . . . . . . . . 12 ⊢ (𝐴(,)𝐵) ⊆ ℂ
75	74	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
76	3	recnd 11238	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ℂ)
77	3, 57	readdcld 11239	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋 + 𝐴) ∈ ℝ)
78	77	rexrd 11260	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 + 𝐴) ∈ ℝ^*)
79	78	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐴) ∈ ℝ^*)
80	3, 58	readdcld 11239	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋 + 𝐵) ∈ ℝ)
81	80	rexrd 11260	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 + 𝐵) ∈ ℝ^*)
82	81	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐵) ∈ ℝ^*)
83	57	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ)
84	83	rexrd 11260	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 ∈ ℝ^*)
85	58	rexrd 11260	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
86	85	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ^*)
87		simpr 485	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 ∈ (𝐴(,)𝐵))
88		ioogtlb 44194	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝑠)
89	84, 86, 87, 88	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐴 < 𝑠)
90	83, 6, 4, 89	ltadd2dd 11369	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝐴) < (𝑋 + 𝑠))
91	58	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝐵 ∈ ℝ)
92		iooltub 44209	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 𝐵)
93	84, 86, 87, 92	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → 𝑠 < 𝐵)
94	6, 91, 4, 93	ltadd2dd 11369	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) < (𝑋 + 𝐵))
95	79, 82, 7, 90, 94	eliood 44197	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑠 ∈ (𝐴(,)𝐵)) → (𝑋 + 𝑠) ∈ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵)))
96	65, 73, 75, 76, 95	fourierdlem23 44832	. . . . . . . . . 10 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ ((ℝ D (𝐹 ↾ ((𝑋 + 𝐴)(,)(𝑋 + 𝐵))))‘(𝑋 + 𝑠))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
97	63, 96	eqeltrd 2833	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠)))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
98		iooretop 24273	. . . . . . . . . . . . 13 ⊢ (𝐴(,)𝐵) ∈ (topGen‘ran (,))
99		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
100	99	tgioo2 24310	. . . . . . . . . . . . 13 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
101	98, 100	eleqtri 2831	. . . . . . . . . . . 12 ⊢ (𝐴(,)𝐵) ∈ ((TopOpen‘ℂ_fld) ↾_t ℝ)
102	101	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴(,)𝐵) ∈ ((TopOpen‘ℂ_fld) ↾_t ℝ))
103	9	recnd 11238	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ ℂ)
104	37, 102, 103	dvmptconst 44617	. . . . . . . . . 10 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 0))
105		0cnd 11203	. . . . . . . . . . 11 ⊢ (𝜑 → 0 ∈ ℂ)
106	75, 105, 70	constcncfg 44574	. . . . . . . . . 10 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 0) ∈ ((𝐴(,)𝐵)–cn→ℂ))
107	104, 106	eqeltrd 2833	. . . . . . . . 9 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
108	37, 53, 56, 97, 107	dvsubcncf 44626	. . . . . . . 8 ⊢ (𝜑 → (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ (𝐹‘(𝑋 + 𝑠))) ∘_f − (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝐶))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
109	50, 108	eqeltrd 2833	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
110	37, 102	dvmptidg 44619	. . . . . . . 8 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)) = (𝑠 ∈ (𝐴(,)𝐵) ↦ 1))
111		1cnd 11205	. . . . . . . . 9 ⊢ (𝜑 → 1 ∈ ℂ)
112	75, 111, 70	constcncfg 44574	. . . . . . . 8 ⊢ (𝜑 → (𝑠 ∈ (𝐴(,)𝐵) ↦ 1) ∈ ((𝐴(,)𝐵)–cn→ℂ))
113	110, 112	eqeltrd 2833	. . . . . . 7 ⊢ (𝜑 → (ℝ D (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠)) ∈ ((𝐴(,)𝐵)–cn→ℂ))
114	37, 40, 45, 109, 113	dvdivcncf 44629	. . . . . 6 ⊢ (𝜑 → (ℝ D ((𝑠 ∈ (𝐴(,)𝐵) ↦ ((𝐹‘(𝑋 + 𝑠)) − 𝐶)) ∘_f / (𝑠 ∈ (𝐴(,)𝐵) ↦ 𝑠))) ∈ ((𝐴(,)𝐵)–cn→ℂ))
115	35, 114	eqeltrd 2833	. . . . 5 ⊢ (𝜑 → (ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℂ))
116		cncff 24400	. . . . 5 ⊢ ((ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℂ) → (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℂ)
117		fdm 6723	. . . . 5 ⊢ ((ℝ D 𝐻):(𝐴(,)𝐵)⟶ℂ → dom (ℝ D 𝐻) = (𝐴(,)𝐵))
118	115, 116, 117	3syl 18	. . . 4 ⊢ (𝜑 → dom (ℝ D 𝐻) = (𝐴(,)𝐵))
119	118	feq2d 6700	. . 3 ⊢ (𝜑 → ((ℝ D 𝐻):dom (ℝ D 𝐻)⟶ℝ ↔ (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℝ))
120	28, 119	mpbid 231	. 2 ⊢ (𝜑 → (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℝ)
121		cncfcdm 24405	. . 3 ⊢ ((ℝ ⊆ ℂ ∧ (ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℂ)) → ((ℝ D 𝐻) ∈ ((𝐴(,)𝐵)–cn→ℝ) ↔ (ℝ D 𝐻):(𝐴(,)𝐵)⟶ℝ))
122	67, 115, 121	syl2anc 584	. 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 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 Vcvv 3474 ∖ cdif 3944 ⊆ wss 3947 {csn 4627 {cpr 4629 class class class wbr 5147 ↦ cmpt 5230 dom cdm 5675 ran crn 5676 ↾ cres 5677 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ∘_f cof 7664 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 + caddc 11109 ℝ^*cxr 11243 < clt 11244 − cmin 11440 / cdiv 11867 (,)cioo 13320 ↾_t crest 17362 TopOpenctopn 17363 topGenctg 17379 ℂ_fldccnfld 20936 –cn→ccncf 24383 D cdv 25371

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185 ax-mulf 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7666 df-om 7852 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8699 df-map 8818 df-pm 8819 df-ixp 8888 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-fi 9402 df-sup 9433 df-inf 9434 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-q 12929 df-rp 12971 df-xneg 13088 df-xadd 13089 df-xmul 13090 df-ioo 13324 df-icc 13327 df-fz 13481 df-fzo 13624 df-seq 13963 df-exp 14024 df-hash 14287 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-starv 17208 df-sca 17209 df-vsca 17210 df-ip 17211 df-tset 17212 df-ple 17213 df-ds 17215 df-unif 17216 df-hom 17217 df-cco 17218 df-rest 17364 df-topn 17365 df-0g 17383 df-gsum 17384 df-topgen 17385 df-pt 17386 df-prds 17389 df-xrs 17444 df-qtop 17449 df-imas 17450 df-xps 17452 df-mre 17526 df-mrc 17527 df-acs 17529 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-submnd 18668 df-mulg 18945 df-cntz 19175 df-cmn 19644 df-psmet 20928 df-xmet 20929 df-met 20930 df-bl 20931 df-mopn 20932 df-fbas 20933 df-fg 20934 df-cnfld 20937 df-top 22387 df-topon 22404 df-topsp 22426 df-bases 22440 df-cld 22514 df-ntr 22515 df-cls 22516 df-nei 22593 df-lp 22631 df-perf 22632 df-cn 22722 df-cnp 22723 df-t1 22809 df-haus 22810 df-tx 23057 df-hmeo 23250 df-fil 23341 df-fm 23433 df-flim 23434 df-flf 23435 df-xms 23817 df-ms 23818 df-tms 23819 df-cncf 24385 df-limc 25374 df-dv 25375

This theorem is referenced by: fourierdlem72 44880

W3C validator