fourierdlem32 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem32 46873

Description: Limit of a continuous function on an open subinterval. Lower bound version. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
fourierdlem32.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem32.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem32.altb	⊢ (𝜑 → 𝐴 < 𝐵)
fourierdlem32.f	⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
fourierdlem32.l	⊢ (𝜑 → 𝑅 ∈ (𝐹 lim_ℂ 𝐴))
fourierdlem32.c	⊢ (𝜑 → 𝐶 ∈ ℝ)
fourierdlem32.d	⊢ (𝜑 → 𝐷 ∈ ℝ)
fourierdlem32.cltd	⊢ (𝜑 → 𝐶 < 𝐷)
fourierdlem32.ss	⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
fourierdlem32.y	⊢ 𝑌 = if(𝐶 = 𝐴, 𝑅, (𝐹‘𝐶))
fourierdlem32.j	⊢ 𝐽 = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵))

**Assertion**
Ref	Expression
fourierdlem32	⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶))

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

Step	Hyp	Ref	Expression
1		fourierdlem32.l	. . . 4 ⊢ (𝜑 → 𝑅 ∈ (𝐹 lim_ℂ 𝐴))
2	1	adantr 485	. . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝑅 ∈ (𝐹 lim_ℂ 𝐴))
3		fourierdlem32.y	. . . . 5 ⊢ 𝑌 = if(𝐶 = 𝐴, 𝑅, (𝐹‘𝐶))
4		iftrue 4493	. . . . 5 ⊢ (𝐶 = 𝐴 → if(𝐶 = 𝐴, 𝑅, (𝐹‘𝐶)) = 𝑅)
5	3, 4	eqtr2id 2811	. . . 4 ⊢ (𝐶 = 𝐴 → 𝑅 = 𝑌)
6	5	adantl 486	. . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝑅 = 𝑌)
7		oveq2 7418	. . . . 5 ⊢ (𝐶 = 𝐴 → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐴))
8	7	adantl 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐴))
9		fourierdlem32.f	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
10		cncff 25052	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
11	9, 10	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
12	11	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
13		fourierdlem32.ss	. . . . . 6 ⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
14	13	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
15		ioosscn 13430	. . . . . 6 ⊢ (𝐴(,)𝐵) ⊆ ℂ
16	15	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐴(,)𝐵) ⊆ ℂ)
17		eqid 2763	. . . . 5 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
18		eqid 2763	. . . . 5 ⊢ ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})) = ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴}))
19		fourierdlem32.c	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ)
20	19	leidd 11775	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≤ 𝐶)
21		fourierdlem32.cltd	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 < 𝐷)
22		fourierdlem32.d	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ ℝ)
23	22	rexrd 11254	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ ℝ^*)
24		elico2 13432	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ^*) → (𝐶 ∈ (𝐶[,)𝐷) ↔ (𝐶 ∈ ℝ ∧ 𝐶 ≤ 𝐶 ∧ 𝐶 < 𝐷)))
25	19, 23, 24	syl2anc 595	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ (𝐶[,)𝐷) ↔ (𝐶 ∈ ℝ ∧ 𝐶 ≤ 𝐶 ∧ 𝐶 < 𝐷)))
26	19, 20, 21, 25	mpbir3and 1361	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ (𝐶[,)𝐷))
27	26	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐶 ∈ (𝐶[,)𝐷))
28		fourierdlem32.j	. . . . . . . . 9 ⊢ 𝐽 = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵))
29	17	cnfldtop 24940	. . . . . . . . . 10 ⊢ (TopOpen‘ℂ_fld) ∈ Top
30		ovex 7443	. . . . . . . . . . 11 ⊢ (𝐴[,)𝐵) ∈ V
31	30	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐴[,)𝐵) ∈ V)
32		resttop 23317	. . . . . . . . . 10 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,)𝐵) ∈ V) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)) ∈ Top)
33	29, 31, 32	sylancr 598	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)) ∈ Top)
34	28, 33	eqeltrid 2867	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐽 ∈ Top)
35		mnfxr 11261	. . . . . . . . . . . . . . . 16 ⊢ -∞ ∈ ℝ^*
36	35	a1i 11	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → -∞ ∈ ℝ^*)
37	23	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐷 ∈ ℝ^*)
38		simpr 489	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ (𝐴[,)𝐷))
39		fourierdlem32.a	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐴 ∈ ℝ)
40	39	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐴 ∈ ℝ)
41		elico2 13432	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ ℝ ∧ 𝐷 ∈ ℝ^*) → (𝑥 ∈ (𝐴[,)𝐷) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷)))
42	40, 37, 41	syl2anc 595	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → (𝑥 ∈ (𝐴[,)𝐷) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷)))
43	38, 42	mpbid 235	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷))
44	43	simp1d 1160	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ ℝ)
45	44	mnfltd 13144	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → -∞ < 𝑥)
46	43	simp3d 1162	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 < 𝐷)
47	36, 37, 44, 45, 46	eliood 46234	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ (-∞(,)𝐷))
48	43	simp2d 1161	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐴 ≤ 𝑥)
49	22	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐷 ∈ ℝ)
50		fourierdlem32.b	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐵 ∈ ℝ)
51	50	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐵 ∈ ℝ)
52	39, 50, 19, 22, 21, 13	fourierdlem10 46851	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵))
53	52	simprd 500	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐷 ≤ 𝐵)
54	53	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐷 ≤ 𝐵)
55	44, 49, 51, 46, 54	ltletrd 11365	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 < 𝐵)
56	50	rexrd 11254	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
57	56	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐵 ∈ ℝ^*)
58		elico2 13432	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → (𝑥 ∈ (𝐴[,)𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐵)))
59	40, 57, 58	syl2anc 595	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → (𝑥 ∈ (𝐴[,)𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐵)))
60	44, 48, 55, 59	mpbir3and 1361	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ (𝐴[,)𝐵))
61	47, 60	elind 4153	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)))
62		elinel1 4154	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) → 𝑥 ∈ (-∞(,)𝐷))
63		elioore 13397	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (-∞(,)𝐷) → 𝑥 ∈ ℝ)
64	62, 63	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) → 𝑥 ∈ ℝ)
65	64	adantl 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 ∈ ℝ)
66		elinel2 4155	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) → 𝑥 ∈ (𝐴[,)𝐵))
67	66	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 ∈ (𝐴[,)𝐵))
68	39	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝐴 ∈ ℝ)
69	56	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝐵 ∈ ℝ^*)
70	68, 69, 58	syl2anc 595	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ (𝐴[,)𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐵)))
71	67, 70	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐵))
72	71	simp2d 1161	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝐴 ≤ 𝑥)
73	62	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 ∈ (-∞(,)𝐷))
74	23	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝐷 ∈ ℝ^*)
75		elioo2 13408	. . . . . . . . . . . . . . . . 17 ⊢ ((-∞ ∈ ℝ^* ∧ 𝐷 ∈ ℝ^*) → (𝑥 ∈ (-∞(,)𝐷) ↔ (𝑥 ∈ ℝ ∧ -∞ < 𝑥 ∧ 𝑥 < 𝐷)))
76	35, 74, 75	sylancr 598	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ (-∞(,)𝐷) ↔ (𝑥 ∈ ℝ ∧ -∞ < 𝑥 ∧ 𝑥 < 𝐷)))
77	73, 76	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ ℝ ∧ -∞ < 𝑥 ∧ 𝑥 < 𝐷))
78	77	simp3d 1162	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 < 𝐷)
79	68, 74, 41	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ (𝐴[,)𝐷) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷)))
80	65, 72, 78, 79	mpbir3and 1361	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 ∈ (𝐴[,)𝐷))
81	61, 80	impbida 812	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,)𝐷) ↔ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))))
82	81	eqrdv 2761	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴[,)𝐷) = ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)))
83		retop 24918	. . . . . . . . . . . . 13 ⊢ (topGen‘ran (,)) ∈ Top
84	83	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (topGen‘ran (,)) ∈ Top)
85	30	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴[,)𝐵) ∈ V)
86		iooretop 24922	. . . . . . . . . . . . 13 ⊢ (-∞(,)𝐷) ∈ (topGen‘ran (,))
87	86	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (-∞(,)𝐷) ∈ (topGen‘ran (,)))
88		elrestr 17476	. . . . . . . . . . . 12 ⊢ (((topGen‘ran (,)) ∈ Top ∧ (𝐴[,)𝐵) ∈ V ∧ (-∞(,)𝐷) ∈ (topGen‘ran (,))) → ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
89	84, 85, 87, 88	syl3anc 1398	. . . . . . . . . . 11 ⊢ (𝜑 → ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
90	82, 89	eqeltrd 2863	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴[,)𝐷) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
91	90	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐴[,)𝐷) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
92		simpr 489	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐶 = 𝐴)
93	92	oveq1d 7425	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐶[,)𝐷) = (𝐴[,)𝐷))
94	28	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
95	29	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ Top)
96		icossre 13450	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → (𝐴[,)𝐵) ⊆ ℝ)
97	39, 56, 96	syl2anc 595	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴[,)𝐵) ⊆ ℝ)
98		reex 11186	. . . . . . . . . . . . 13 ⊢ ℝ ∈ V
99	98	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℝ ∈ V)
100		restabs 23322	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,)𝐵) ⊆ ℝ ∧ ℝ ∈ V) → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
101	95, 97, 99, 100	syl3anc 1398	. . . . . . . . . . 11 ⊢ (𝜑 → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
102		tgioo4 24962	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
103	102	eqcomi 2772	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℝ) = (topGen‘ran (,))
104	103	oveq1i 7420	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,)𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵))
105	104	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,)𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
106	94, 101, 105	3eqtr2d 2804	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 = ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
107	106	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐽 = ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
108	91, 93, 107	3eltr4d 2878	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐶[,)𝐷) ∈ 𝐽)
109		isopn3i 23239	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ (𝐶[,)𝐷) ∈ 𝐽) → ((int‘𝐽)‘(𝐶[,)𝐷)) = (𝐶[,)𝐷))
110	34, 108, 109	syl2anc 595	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((int‘𝐽)‘(𝐶[,)𝐷)) = (𝐶[,)𝐷))
111	27, 110	eleqtrrd 2866	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐶 ∈ ((int‘𝐽)‘(𝐶[,)𝐷)))
112		id 23	. . . . . . . 8 ⊢ (𝐶 = 𝐴 → 𝐶 = 𝐴)
113	112	eqcomd 2769	. . . . . . 7 ⊢ (𝐶 = 𝐴 → 𝐴 = 𝐶)
114	113	adantl 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐴 = 𝐶)
115		uncom 4112	. . . . . . . . . . . 12 ⊢ ((𝐴(,)𝐵) ∪ {𝐴}) = ({𝐴} ∪ (𝐴(,)𝐵))
116	39	rexrd 11254	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
117		fourierdlem32.altb	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 < 𝐵)
118		snunioo 13500	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ({𝐴} ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
119	116, 56, 117, 118	syl3anc 1398	. . . . . . . . . . . 12 ⊢ (𝜑 → ({𝐴} ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
120	115, 119	eqtrid 2810	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵))
121	120	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵))
122	121	oveq2d 7426	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
123	122, 28	eqtr4di 2816	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})) = 𝐽)
124	123	fveq2d 6885	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (int‘((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴}))) = (int‘𝐽))
125		uncom 4112	. . . . . . . . 9 ⊢ ((𝐶(,)𝐷) ∪ {𝐴}) = ({𝐴} ∪ (𝐶(,)𝐷))
126		sneq 4599	. . . . . . . . . . 11 ⊢ (𝐶 = 𝐴 → {𝐶} = {𝐴})
127	126	eqcomd 2769	. . . . . . . . . 10 ⊢ (𝐶 = 𝐴 → {𝐴} = {𝐶})
128	127	uneq1d 4121	. . . . . . . . 9 ⊢ (𝐶 = 𝐴 → ({𝐴} ∪ (𝐶(,)𝐷)) = ({𝐶} ∪ (𝐶(,)𝐷)))
129	125, 128	eqtrid 2810	. . . . . . . 8 ⊢ (𝐶 = 𝐴 → ((𝐶(,)𝐷) ∪ {𝐴}) = ({𝐶} ∪ (𝐶(,)𝐷)))
130	19	rexrd 11254	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
131		snunioo 13500	. . . . . . . . 9 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐷 ∈ ℝ^* ∧ 𝐶 < 𝐷) → ({𝐶} ∪ (𝐶(,)𝐷)) = (𝐶[,)𝐷))
132	130, 23, 21, 131	syl3anc 1398	. . . . . . . 8 ⊢ (𝜑 → ({𝐶} ∪ (𝐶(,)𝐷)) = (𝐶[,)𝐷))
133	129, 132	sylan9eqr 2820	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐶(,)𝐷) ∪ {𝐴}) = (𝐶[,)𝐷))
134	124, 133	fveq12d 6888	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((int‘((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})))‘((𝐶(,)𝐷) ∪ {𝐴})) = ((int‘𝐽)‘(𝐶[,)𝐷)))
135	111, 114, 134	3eltr4d 2878	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐴 ∈ ((int‘((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})))‘((𝐶(,)𝐷) ∪ {𝐴})))
136	12, 14, 16, 17, 18, 135	limcres 26045	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐴) = (𝐹 lim_ℂ 𝐴))
137	8, 136	eqtr2d 2799	. . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐹 lim_ℂ 𝐴) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶))
138	2, 6, 137	3eltr3d 2877	. 2 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶))
139		limcresi 26044	. . 3 ⊢ (𝐹 lim_ℂ 𝐶) ⊆ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶)
140		iffalse 4496	. . . . . 6 ⊢ (¬ 𝐶 = 𝐴 → if(𝐶 = 𝐴, 𝑅, (𝐹‘𝐶)) = (𝐹‘𝐶))
141	3, 140	eqtrid 2810	. . . . 5 ⊢ (¬ 𝐶 = 𝐴 → 𝑌 = (𝐹‘𝐶))
142	141	adantl 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝑌 = (𝐹‘𝐶))
143		ssid 3959	. . . . . . . . . . . . 13 ⊢ ℂ ⊆ ℂ
144	143	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℂ ⊆ ℂ)
145		eqid 2763	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵))
146		unicntop 24942	. . . . . . . . . . . . . . . 16 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
147	146	restid 17481	. . . . . . . . . . . . . . 15 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld))
148	29, 147	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld)
149	148	eqcomi 2772	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) = ((TopOpen‘ℂ_fld) ↾_t ℂ)
150	17, 145, 149	cncfcn 25069	. . . . . . . . . . . 12 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
151	15, 144, 150	sylancr 598	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
152	9, 151	eleqtrd 2865	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
153	17	cnfldtopon 24939	. . . . . . . . . . . 12 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
154		resttopon 23318	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)))
155	153, 15, 154	mp2an 704	. . . . . . . . . . 11 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))
156		cncnp 23437	. . . . . . . . . . 11 ⊢ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)) ∧ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)) → (𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))))
157	155, 153, 156	mp2an 704	. . . . . . . . . 10 ⊢ (𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥)))
158	152, 157	sylib 221	. . . . . . . . 9 ⊢ (𝜑 → (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥)))
159	158	simprd 500	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))
160	159	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))
161	116	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐴 ∈ ℝ^*)
162	56	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐵 ∈ ℝ^*)
163	19	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐶 ∈ ℝ)
164	39	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐴 ∈ ℝ)
165	52	simpld 499	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ≤ 𝐶)
166	165	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐴 ≤ 𝐶)
167	112	eqcoms 2771	. . . . . . . . . . . 12 ⊢ (𝐴 = 𝐶 → 𝐶 = 𝐴)
168	167	necon3bi 2984	. . . . . . . . . . 11 ⊢ (¬ 𝐶 = 𝐴 → 𝐴 ≠ 𝐶)
169	168	adantl 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐴 ≠ 𝐶)
170	169	necomd 3013	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐶 ≠ 𝐴)
171	164, 163, 166, 170	leneltd 11359	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐴 < 𝐶)
172	19, 22, 50, 21, 53	ltletrd 11365	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 < 𝐵)
173	172	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐶 < 𝐵)
174	161, 162, 163, 171, 173	eliood 46234	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐶 ∈ (𝐴(,)𝐵))
175		fveq2 6881	. . . . . . . . 9 ⊢ (𝑥 = 𝐶 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶))
176	175	eleq2d 2849	. . . . . . . 8 ⊢ (𝑥 = 𝐶 → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) ↔ 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶)))
177	176	rspccva 3580	. . . . . . 7 ⊢ ((∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) ∧ 𝐶 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶))
178	160, 174, 177	syl2anc 595	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶))
179	17, 145	cnplimc 26046	. . . . . . 7 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ 𝐶 ∈ (𝐴(,)𝐵)) → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐶) ∈ (𝐹 lim_ℂ 𝐶))))
180	15, 174, 179	sylancr 598	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐶) ∈ (𝐹 lim_ℂ 𝐶))))
181	178, 180	mpbid 235	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐶) ∈ (𝐹 lim_ℂ 𝐶)))
182	181	simprd 500	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → (𝐹‘𝐶) ∈ (𝐹 lim_ℂ 𝐶))
183	142, 182	eqeltrd 2863	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝑌 ∈ (𝐹 lim_ℂ 𝐶))
184	139, 183	sselid 3935	. 2 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶))
185	138, 184	pm2.61dan 824	1 ⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 Vcvv 3455 ∪ cun 3903 ∩ cin 3904 ⊆ wss 3905 ifcif 4487 {csn 4589 class class class wbr 5109 ran crn 5662 ↾ cres 5663 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ℂcc 11093 ℝcr 11094 -∞cmnf 11236 ℝ^*cxr 11237 < clt 11238 ≤ cle 11239 (,)cioo 13367 [,)cico 13369 ↾_t crest 17468 TopOpenctopn 17469 topGenctg 17485 ℂ_fldccnfld 21522 Topctop 23050 TopOnctopon 23067 intcnt 23174 Cn ccn 23381 CnP ccnp 23382 –cn→ccncf 25035 lim_ℂ climc 26021

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fi 9367 df-sup 9398 df-inf 9399 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-4 12300 df-5 12301 df-6 12302 df-7 12303 df-8 12304 df-9 12305 df-n0 12500 df-z 12587 df-dec 12707 df-uz 12858 df-q 12968 df-rp 13012 df-xneg 13132 df-xadd 13133 df-xmul 13134 df-ioo 13371 df-ico 13373 df-icc 13374 df-fz 13531 df-seq 14034 df-exp 14094 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-struct 17202 df-slot 17237 df-ndx 17249 df-base 17265 df-plusg 17318 df-mulr 17319 df-starv 17320 df-tset 17324 df-ple 17325 df-ds 17327 df-unif 17328 df-rest 17470 df-topn 17471 df-topgen 17491 df-psmet 21514 df-xmet 21515 df-met 21516 df-bl 21517 df-mopn 21518 df-cnfld 21523 df-top 23051 df-topon 23068 df-topsp 23090 df-bases 23103 df-ntr 23177 df-cn 23384 df-cnp 23385 df-xms 24477 df-ms 24478 df-cncf 25037 df-limc 26025

This theorem is referenced by: fourierdlem48 46888 fourierdlem76 46916 fourierdlem89 46929

W3C validator