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 46779

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 4498	. . . . 5 ⊢ (𝐶 = 𝐴 → if(𝐶 = 𝐴, 𝑅, (𝐹‘𝐶)) = 𝑅)
5	3, 4	eqtr2id 2817	. . . 4 ⊢ (𝐶 = 𝐴 → 𝑅 = 𝑌)
6	5	adantl 486	. . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝑅 = 𝑌)
7		oveq2 7419	. . . . 5 ⊢ (𝐶 = 𝐴 → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐴))
8	7	adantl 486	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐴))
9		fourierdlem32.f	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
10		cncff 25021	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
11	9, 10	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
12	11	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
13		fourierdlem32.ss	. . . . . 6 ⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
14	13	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
15		ioosscn 13435	. . . . . 6 ⊢ (𝐴(,)𝐵) ⊆ ℂ
16	15	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐴(,)𝐵) ⊆ ℂ)
17		eqid 2769	. . . . 5 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
18		eqid 2769	. . . . 5 ⊢ ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})) = ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴}))
19		fourierdlem32.c	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ)
20	19	leidd 11780	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≤ 𝐶)
21		fourierdlem32.cltd	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 < 𝐷)
22		fourierdlem32.d	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ ℝ)
23	22	rexrd 11259	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ ℝ^*)
24		elico2 13437	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ ∧ 𝐷 ∈ ℝ^*) → (𝐶 ∈ (𝐶[,)𝐷) ↔ (𝐶 ∈ ℝ ∧ 𝐶 ≤ 𝐶 ∧ 𝐶 < 𝐷)))
25	19, 23, 24	syl2anc 595	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ (𝐶[,)𝐷) ↔ (𝐶 ∈ ℝ ∧ 𝐶 ≤ 𝐶 ∧ 𝐶 < 𝐷)))
26	19, 20, 21, 25	mpbir3and 1359	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ (𝐶[,)𝐷))
27	26	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐶 ∈ (𝐶[,)𝐷))
28		fourierdlem32.j	. . . . . . . . 9 ⊢ 𝐽 = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵))
29	17	cnfldtop 24909	. . . . . . . . . 10 ⊢ (TopOpen‘ℂ_fld) ∈ Top
30		ovex 7444	. . . . . . . . . . 11 ⊢ (𝐴[,)𝐵) ∈ V
31	30	a1i 11	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐴[,)𝐵) ∈ V)
32		resttop 23286	. . . . . . . . . 10 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,)𝐵) ∈ V) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)) ∈ Top)
33	29, 31, 32	sylancr 598	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)) ∈ Top)
34	28, 33	eqeltrid 2873	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐽 ∈ Top)
35		mnfxr 11266	. . . . . . . . . . . . . . . 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 13437	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ ℝ ∧ 𝐷 ∈ ℝ^*) → (𝑥 ∈ (𝐴[,)𝐷) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷)))
42	40, 37, 41	syl2anc 595	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → (𝑥 ∈ (𝐴[,)𝐷) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷)))
43	38, 42	mpbid 235	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷))
44	43	simp1d 1158	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ ℝ)
45	44	mnfltd 13149	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → -∞ < 𝑥)
46	43	simp3d 1160	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 < 𝐷)
47	36, 37, 44, 45, 46	eliood 46140	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ (-∞(,)𝐷))
48	43	simp2d 1159	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐴 ≤ 𝑥)
49	22	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐷 ∈ ℝ)
50		fourierdlem32.b	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐵 ∈ ℝ)
51	50	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐵 ∈ ℝ)
52	39, 50, 19, 22, 21, 13	fourierdlem10 46757	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵))
53	52	simprd 500	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐷 ≤ 𝐵)
54	53	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐷 ≤ 𝐵)
55	44, 49, 51, 46, 54	ltletrd 11370	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 < 𝐵)
56	50	rexrd 11259	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
57	56	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝐵 ∈ ℝ^*)
58		elico2 13437	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → (𝑥 ∈ (𝐴[,)𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐵)))
59	40, 57, 58	syl2anc 595	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → (𝑥 ∈ (𝐴[,)𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐵)))
60	44, 48, 55, 59	mpbir3and 1359	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ (𝐴[,)𝐵))
61	47, 60	elind 4161	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,)𝐷)) → 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)))
62		elinel1 4162	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) → 𝑥 ∈ (-∞(,)𝐷))
63		elioore 13402	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (-∞(,)𝐷) → 𝑥 ∈ ℝ)
64	62, 63	syl 18	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) → 𝑥 ∈ ℝ)
65	64	adantl 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 ∈ ℝ)
66		elinel2 4163	. . . . . . . . . . . . . . . . 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 1159	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝐴 ≤ 𝑥)
73	62	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 ∈ (-∞(,)𝐷))
74	23	adantr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝐷 ∈ ℝ^*)
75		elioo2 13413	. . . . . . . . . . . . . . . . 17 ⊢ ((-∞ ∈ ℝ^* ∧ 𝐷 ∈ ℝ^*) → (𝑥 ∈ (-∞(,)𝐷) ↔ (𝑥 ∈ ℝ ∧ -∞ < 𝑥 ∧ 𝑥 < 𝐷)))
76	35, 74, 75	sylancr 598	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ (-∞(,)𝐷) ↔ (𝑥 ∈ ℝ ∧ -∞ < 𝑥 ∧ 𝑥 < 𝐷)))
77	73, 76	mpbid 235	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ ℝ ∧ -∞ < 𝑥 ∧ 𝑥 < 𝐷))
78	77	simp3d 1160	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 < 𝐷)
79	68, 74, 41	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → (𝑥 ∈ (𝐴[,)𝐷) ↔ (𝑥 ∈ ℝ ∧ 𝐴 ≤ 𝑥 ∧ 𝑥 < 𝐷)))
80	65, 72, 78, 79	mpbir3and 1359	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))) → 𝑥 ∈ (𝐴[,)𝐷))
81	61, 80	impbida 812	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ (𝐴[,)𝐷) ↔ 𝑥 ∈ ((-∞(,)𝐷) ∩ (𝐴[,)𝐵))))
82	81	eqrdv 2767	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴[,)𝐷) = ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)))
83		retop 24887	. . . . . . . . . . . . 13 ⊢ (topGen‘ran (,)) ∈ Top
84	83	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (topGen‘ran (,)) ∈ Top)
85	30	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴[,)𝐵) ∈ V)
86		iooretop 24891	. . . . . . . . . . . . 13 ⊢ (-∞(,)𝐷) ∈ (topGen‘ran (,))
87	86	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (-∞(,)𝐷) ∈ (topGen‘ran (,)))
88		elrestr 17481	. . . . . . . . . . . 12 ⊢ (((topGen‘ran (,)) ∈ Top ∧ (𝐴[,)𝐵) ∈ V ∧ (-∞(,)𝐷) ∈ (topGen‘ran (,))) → ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
89	84, 85, 87, 88	syl3anc 1396	. . . . . . . . . . 11 ⊢ (𝜑 → ((-∞(,)𝐷) ∩ (𝐴[,)𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
90	82, 89	eqeltrd 2869	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴[,)𝐷) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
91	90	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐴[,)𝐷) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
92		simpr 489	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐶 = 𝐴)
93	92	oveq1d 7426	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐶[,)𝐷) = (𝐴[,)𝐷))
94	28	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
95	29	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ Top)
96		icossre 13455	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ^*) → (𝐴[,)𝐵) ⊆ ℝ)
97	39, 56, 96	syl2anc 595	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴[,)𝐵) ⊆ ℝ)
98		reex 11191	. . . . . . . . . . . . 13 ⊢ ℝ ∈ V
99	98	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℝ ∈ V)
100		restabs 23291	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,)𝐵) ⊆ ℝ ∧ ℝ ∈ V) → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
101	95, 97, 99, 100	syl3anc 1396	. . . . . . . . . . 11 ⊢ (𝜑 → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
102		tgioo4 24931	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
103	102	eqcomi 2778	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℝ) = (topGen‘ran (,))
104	103	oveq1i 7421	. . . . . . . . . . . 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 2810	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 = ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
107	106	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐽 = ((topGen‘ran (,)) ↾_t (𝐴[,)𝐵)))
108	91, 93, 107	3eltr4d 2884	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐶[,)𝐷) ∈ 𝐽)
109		isopn3i 23208	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ (𝐶[,)𝐷) ∈ 𝐽) → ((int‘𝐽)‘(𝐶[,)𝐷)) = (𝐶[,)𝐷))
110	34, 108, 109	syl2anc 595	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((int‘𝐽)‘(𝐶[,)𝐷)) = (𝐶[,)𝐷))
111	27, 110	eleqtrrd 2872	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐶 ∈ ((int‘𝐽)‘(𝐶[,)𝐷)))
112		id 23	. . . . . . . 8 ⊢ (𝐶 = 𝐴 → 𝐶 = 𝐴)
113	112	eqcomd 2775	. . . . . . 7 ⊢ (𝐶 = 𝐴 → 𝐴 = 𝐶)
114	113	adantl 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐴 = 𝐶)
115		uncom 4120	. . . . . . . . . . . 12 ⊢ ((𝐴(,)𝐵) ∪ {𝐴}) = ({𝐴} ∪ (𝐴(,)𝐵))
116	39	rexrd 11259	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
117		fourierdlem32.altb	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 < 𝐵)
118		snunioo 13505	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ({𝐴} ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
119	116, 56, 117, 118	syl3anc 1396	. . . . . . . . . . . 12 ⊢ (𝜑 → ({𝐴} ∪ (𝐴(,)𝐵)) = (𝐴[,)𝐵))
120	115, 119	eqtrid 2816	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵))
121	120	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐴(,)𝐵) ∪ {𝐴}) = (𝐴[,)𝐵))
122	121	oveq2d 7427	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,)𝐵)))
123	122, 28	eqtr4di 2822	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})) = 𝐽)
124	123	fveq2d 6886	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (int‘((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴}))) = (int‘𝐽))
125		uncom 4120	. . . . . . . . 9 ⊢ ((𝐶(,)𝐷) ∪ {𝐴}) = ({𝐴} ∪ (𝐶(,)𝐷))
126		sneq 4604	. . . . . . . . . . 11 ⊢ (𝐶 = 𝐴 → {𝐶} = {𝐴})
127	126	eqcomd 2775	. . . . . . . . . 10 ⊢ (𝐶 = 𝐴 → {𝐴} = {𝐶})
128	127	uneq1d 4129	. . . . . . . . 9 ⊢ (𝐶 = 𝐴 → ({𝐴} ∪ (𝐶(,)𝐷)) = ({𝐶} ∪ (𝐶(,)𝐷)))
129	125, 128	eqtrid 2816	. . . . . . . 8 ⊢ (𝐶 = 𝐴 → ((𝐶(,)𝐷) ∪ {𝐴}) = ({𝐶} ∪ (𝐶(,)𝐷)))
130	19	rexrd 11259	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
131		snunioo 13505	. . . . . . . . 9 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐷 ∈ ℝ^* ∧ 𝐶 < 𝐷) → ({𝐶} ∪ (𝐶(,)𝐷)) = (𝐶[,)𝐷))
132	130, 23, 21, 131	syl3anc 1396	. . . . . . . 8 ⊢ (𝜑 → ({𝐶} ∪ (𝐶(,)𝐷)) = (𝐶[,)𝐷))
133	129, 132	sylan9eqr 2826	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐶(,)𝐷) ∪ {𝐴}) = (𝐶[,)𝐷))
134	124, 133	fveq12d 6889	. . . . . 6 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((int‘((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})))‘((𝐶(,)𝐷) ∪ {𝐴})) = ((int‘𝐽)‘(𝐶[,)𝐷)))
135	111, 114, 134	3eltr4d 2884	. . . . 5 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝐴 ∈ ((int‘((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐴})))‘((𝐶(,)𝐷) ∪ {𝐴})))
136	12, 14, 16, 17, 18, 135	limcres 26014	. . . 4 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐴) = (𝐹 lim_ℂ 𝐴))
137	8, 136	eqtr2d 2805	. . 3 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → (𝐹 lim_ℂ 𝐴) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶))
138	2, 6, 137	3eltr3d 2883	. 2 ⊢ ((𝜑 ∧ 𝐶 = 𝐴) → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶))
139		limcresi 26013	. . 3 ⊢ (𝐹 lim_ℂ 𝐶) ⊆ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐶)
140		iffalse 4501	. . . . . 6 ⊢ (¬ 𝐶 = 𝐴 → if(𝐶 = 𝐴, 𝑅, (𝐹‘𝐶)) = (𝐹‘𝐶))
141	3, 140	eqtrid 2816	. . . . 5 ⊢ (¬ 𝐶 = 𝐴 → 𝑌 = (𝐹‘𝐶))
142	141	adantl 486	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝑌 = (𝐹‘𝐶))
143		ssid 3967	. . . . . . . . . . . . 13 ⊢ ℂ ⊆ ℂ
144	143	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℂ ⊆ ℂ)
145		eqid 2769	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵))
146		unicntop 24911	. . . . . . . . . . . . . . . 16 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
147	146	restid 17486	. . . . . . . . . . . . . . 15 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld))
148	29, 147	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld)
149	148	eqcomi 2778	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) = ((TopOpen‘ℂ_fld) ↾_t ℂ)
150	17, 145, 149	cncfcn 25038	. . . . . . . . . . . 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 2871	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
153	17	cnfldtopon 24908	. . . . . . . . . . . 12 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
154		resttopon 23287	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)))
155	153, 15, 154	mp2an 704	. . . . . . . . . . 11 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵))
156		cncnp 23406	. . . . . . . . . . 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 2777	. . . . . . . . . . . 12 ⊢ (𝐴 = 𝐶 → 𝐶 = 𝐴)
168	167	necon3bi 2990	. . . . . . . . . . 11 ⊢ (¬ 𝐶 = 𝐴 → 𝐴 ≠ 𝐶)
169	168	adantl 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐴 ≠ 𝐶)
170	169	necomd 3019	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐶 ≠ 𝐴)
171	164, 163, 166, 170	leneltd 11364	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐴 < 𝐶)
172	19, 22, 50, 21, 53	ltletrd 11370	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 < 𝐵)
173	172	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐶 < 𝐵)
174	161, 162, 163, 171, 173	eliood 46140	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝐶 ∈ (𝐴(,)𝐵))
175		fveq2 6882	. . . . . . . . 9 ⊢ (𝑥 = 𝐶 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶))
176	175	eleq2d 2855	. . . . . . . 8 ⊢ (𝑥 = 𝐶 → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) ↔ 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐶)))
177	176	rspccva 3589	. . . . . . 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 26015	. . . . . . 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 2869	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐶 = 𝐴) → 𝑌 ∈ (𝐹 lim_ℂ 𝐶))
184	139, 183	sselid 3943	. 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 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 Vcvv 3463 ∪ cun 3911 ∩ cin 3912 ⊆ wss 3913 ifcif 4492 {csn 4594 class class class wbr 5113 ran crn 5663 ↾ cres 5664 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ℂcc 11098 ℝcr 11099 -∞cmnf 11241 ℝ^*cxr 11242 < clt 11243 ≤ cle 11244 (,)cioo 13372 [,)cico 13374 ↾_t crest 17473 TopOpenctopn 17474 topGenctg 17490 ℂ_fldccnfld 21491 Topctop 23019 TopOnctopon 23036 intcnt 23143 Cn ccn 23350 CnP ccnp 23351 –cn→ccncf 25004 lim_ℂ climc 25990

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-er 8694 df-map 8826 df-pm 8827 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fi 9371 df-sup 9402 df-inf 9403 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-q 12973 df-rp 13017 df-xneg 13137 df-xadd 13138 df-xmul 13139 df-ioo 13376 df-ico 13378 df-icc 13379 df-fz 13536 df-seq 14038 df-exp 14098 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-struct 17207 df-slot 17242 df-ndx 17254 df-base 17270 df-plusg 17323 df-mulr 17324 df-starv 17325 df-tset 17329 df-ple 17330 df-ds 17332 df-unif 17333 df-rest 17475 df-topn 17476 df-topgen 17496 df-psmet 21483 df-xmet 21484 df-met 21485 df-bl 21486 df-mopn 21487 df-cnfld 21492 df-top 23020 df-topon 23037 df-topsp 23059 df-bases 23072 df-ntr 23146 df-cn 23353 df-cnp 23354 df-xms 24446 df-ms 24447 df-cncf 25006 df-limc 25994

This theorem is referenced by: fourierdlem48 46794 fourierdlem76 46822 fourierdlem89 46835

W3C validator