fourierdlem33 - Mathbox for Glauco Siliprandi

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

Theorem fourierdlem33 46136

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

**Hypotheses**
Ref	Expression
fourierdlem33.1	⊢ (𝜑 → 𝐴 ∈ ℝ)
fourierdlem33.2	⊢ (𝜑 → 𝐵 ∈ ℝ)
fourierdlem33.3	⊢ (𝜑 → 𝐴 < 𝐵)
fourierdlem33.4	⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
fourierdlem33.5	⊢ (𝜑 → 𝐿 ∈ (𝐹 lim_ℂ 𝐵))
fourierdlem33.6	⊢ (𝜑 → 𝐶 ∈ ℝ)
fourierdlem33.7	⊢ (𝜑 → 𝐷 ∈ ℝ)
fourierdlem33.8	⊢ (𝜑 → 𝐶 < 𝐷)
fourierdlem33.ss	⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
fourierdlem33.y	⊢ 𝑌 = if(𝐷 = 𝐵, 𝐿, (𝐹‘𝐷))
fourierdlem33.10	⊢ 𝐽 = ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵}))

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

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

Step	Hyp	Ref	Expression
1		fourierdlem33.5	. . . 4 ⊢ (𝜑 → 𝐿 ∈ (𝐹 lim_ℂ 𝐵))
2	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐿 ∈ (𝐹 lim_ℂ 𝐵))
3		fourierdlem33.y	. . . . 5 ⊢ 𝑌 = if(𝐷 = 𝐵, 𝐿, (𝐹‘𝐷))
4		iftrue 4511	. . . . 5 ⊢ (𝐷 = 𝐵 → if(𝐷 = 𝐵, 𝐿, (𝐹‘𝐷)) = 𝐿)
5	3, 4	eqtr2id 2784	. . . 4 ⊢ (𝐷 = 𝐵 → 𝐿 = 𝑌)
6	5	adantl 481	. . 3 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐿 = 𝑌)
7		oveq2 7418	. . . . 5 ⊢ (𝐷 = 𝐵 → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐵))
8	7	adantl 481	. . . 4 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐵))
9		fourierdlem33.4	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
10		cncff 24842	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
11	9, 10	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
13		fourierdlem33.ss	. . . . . 6 ⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
14	13	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
15		ioosscn 13430	. . . . . 6 ⊢ (𝐴(,)𝐵) ⊆ ℂ
16	15	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐴(,)𝐵) ⊆ ℂ)
17		eqid 2736	. . . . 5 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
18		fourierdlem33.10	. . . . 5 ⊢ 𝐽 = ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵}))
19		fourierdlem33.7	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ℝ)
20		fourierdlem33.8	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 < 𝐷)
21	19	leidd 11808	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ≤ 𝐷)
22		fourierdlem33.6	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ ℝ)
23	22	rexrd 11290	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
24		elioc2 13431	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐷 ∈ ℝ) → (𝐷 ∈ (𝐶(,]𝐷) ↔ (𝐷 ∈ ℝ ∧ 𝐶 < 𝐷 ∧ 𝐷 ≤ 𝐷)))
25	23, 19, 24	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → (𝐷 ∈ (𝐶(,]𝐷) ↔ (𝐷 ∈ ℝ ∧ 𝐶 < 𝐷 ∧ 𝐷 ≤ 𝐷)))
26	19, 20, 21, 25	mpbir3and 1343	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ (𝐶(,]𝐷))
27	26	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐷 ∈ (𝐶(,]𝐷))
28		eqcom 2743	. . . . . . . . 9 ⊢ (𝐷 = 𝐵 ↔ 𝐵 = 𝐷)
29	28	biimpi 216	. . . . . . . 8 ⊢ (𝐷 = 𝐵 → 𝐵 = 𝐷)
30	29	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐵 = 𝐷)
31	17	cnfldtop 24727	. . . . . . . . . . 11 ⊢ (TopOpen‘ℂ_fld) ∈ Top
32		fourierdlem33.1	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ∈ ℝ)
33	32	rexrd 11290	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
34		fourierdlem33.2	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ ℝ)
35	34	rexrd 11290	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
36		fourierdlem33.3	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 < 𝐵)
37		ioounsn 13499	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵))
38	33, 35, 36, 37	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵))
39		ovex 7443	. . . . . . . . . . . . 13 ⊢ (𝐴(,]𝐵) ∈ V
40	39	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴(,]𝐵) ∈ V)
41	38, 40	eqeltrd 2835	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵) ∪ {𝐵}) ∈ V)
42		resttop 23103	. . . . . . . . . . 11 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ ((𝐴(,)𝐵) ∪ {𝐵}) ∈ V) → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})) ∈ Top)
43	31, 41, 42	sylancr 587	. . . . . . . . . 10 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})) ∈ Top)
44	18, 43	eqeltrid 2839	. . . . . . . . 9 ⊢ (𝜑 → 𝐽 ∈ Top)
45	44	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐽 ∈ Top)
46		oveq2 7418	. . . . . . . . . . 11 ⊢ (𝐷 = 𝐵 → (𝐶(,]𝐷) = (𝐶(,]𝐵))
47	46	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) = (𝐶(,]𝐵))
48	23	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐶 ∈ ℝ^*)
49		pnfxr 11294	. . . . . . . . . . . . . . . . 17 ⊢ +∞ ∈ ℝ^*
50	49	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → +∞ ∈ ℝ^*)
51		simpr 484	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ (𝐶(,]𝐵))
52	34	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐵 ∈ ℝ)
53		elioc2 13431	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐶(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
54	48, 52, 53	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → (𝑥 ∈ (𝐶(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
55	51, 54	mpbid 232	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵))
56	55	simp1d 1142	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ ℝ)
57	55	simp2d 1143	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐶 < 𝑥)
58	56	ltpnfd 13142	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 < +∞)
59	48, 50, 56, 57, 58	eliood 45494	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ (𝐶(,)+∞))
60	32	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 ∈ ℝ)
61	22	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐶 ∈ ℝ)
62	32, 34, 22, 19, 20, 13	fourierdlem10 46113	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵))
63	62	simpld 494	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ≤ 𝐶)
64	63	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 ≤ 𝐶)
65	60, 61, 56, 64, 57	lelttrd 11398	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 < 𝑥)
66	55	simp3d 1144	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ≤ 𝐵)
67	33	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 ∈ ℝ^*)
68		elioc2 13431	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
69	67, 52, 68	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
70	56, 65, 66, 69	mpbir3and 1343	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ (𝐴(,]𝐵))
71	59, 70	elind 4180	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)))
72		elinel1 4181	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) → 𝑥 ∈ (𝐶(,)+∞))
73		elioore 13397	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ (𝐶(,)+∞) → 𝑥 ∈ ℝ)
74	72, 73	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) → 𝑥 ∈ ℝ)
75	74	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ ℝ)
76	23	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐶 ∈ ℝ^*)
77	49	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → +∞ ∈ ℝ^*)
78	72	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ (𝐶(,)+∞))
79		ioogtlb 45491	. . . . . . . . . . . . . . . 16 ⊢ ((𝐶 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 𝑥 ∈ (𝐶(,)+∞)) → 𝐶 < 𝑥)
80	76, 77, 78, 79	syl3anc 1373	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐶 < 𝑥)
81		elinel2 4182	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) → 𝑥 ∈ (𝐴(,]𝐵))
82	81	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ (𝐴(,]𝐵))
83	33	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐴 ∈ ℝ^*)
84	34	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐵 ∈ ℝ)
85	83, 84, 68	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
86	82, 85	mpbid 232	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵))
87	86	simp3d 1144	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ≤ 𝐵)
88	76, 84, 53	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → (𝑥 ∈ (𝐶(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
89	75, 80, 87, 88	mpbir3and 1343	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ (𝐶(,]𝐵))
90	71, 89	impbida 800	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ (𝐶(,]𝐵) ↔ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))))
91	90	eqrdv 2734	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶(,]𝐵) = ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)))
92		retop 24705	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) ∈ Top
93	92	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (topGen‘ran (,)) ∈ Top)
94		iooretop 24709	. . . . . . . . . . . . . 14 ⊢ (𝐶(,)+∞) ∈ (topGen‘ran (,))
95	94	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐶(,)+∞) ∈ (topGen‘ran (,)))
96		elrestr 17447	. . . . . . . . . . . . 13 ⊢ (((topGen‘ran (,)) ∈ Top ∧ (𝐴(,]𝐵) ∈ V ∧ (𝐶(,)+∞) ∈ (topGen‘ran (,))) → ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
97	93, 40, 95, 96	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
98	91, 97	eqeltrd 2835	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶(,]𝐵) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
99	98	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐵) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
100	47, 99	eqeltrd 2835	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
101	18	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 = ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})))
102	38	oveq2d 7426	. . . . . . . . . . 11 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)))
103	31	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ Top)
104		iocssre 13449	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝐴(,]𝐵) ⊆ ℝ)
105	33, 34, 104	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴(,]𝐵) ⊆ ℝ)
106		reex 11225	. . . . . . . . . . . . . 14 ⊢ ℝ ∈ V
107	106	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ∈ V)
108		restabs 23108	. . . . . . . . . . . . 13 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴(,]𝐵) ⊆ ℝ ∧ ℝ ∈ V) → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴(,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)))
109	103, 105, 107, 108	syl3anc 1373	. . . . . . . . . . . 12 ⊢ (𝜑 → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴(,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)))
110		tgioo4 24749	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
111	110	eqcomi 2745	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℝ) = (topGen‘ran (,))
112	111	oveq1i 7420	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴(,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵))
113	109, 112	eqtr3di 2786	. . . . . . . . . . 11 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
114	101, 102, 113	3eqtrrd 2776	. . . . . . . . . 10 ⊢ (𝜑 → ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)) = 𝐽)
115	114	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)) = 𝐽)
116	100, 115	eleqtrd 2837	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) ∈ 𝐽)
117		isopn3i 23025	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ (𝐶(,]𝐷) ∈ 𝐽) → ((int‘𝐽)‘(𝐶(,]𝐷)) = (𝐶(,]𝐷))
118	45, 116, 117	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((int‘𝐽)‘(𝐶(,]𝐷)) = (𝐶(,]𝐷))
119	27, 30, 118	3eltr4d 2850	. . . . . 6 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐵 ∈ ((int‘𝐽)‘(𝐶(,]𝐷)))
120		sneq 4616	. . . . . . . . . . 11 ⊢ (𝐷 = 𝐵 → {𝐷} = {𝐵})
121	120	eqcomd 2742	. . . . . . . . . 10 ⊢ (𝐷 = 𝐵 → {𝐵} = {𝐷})
122	121	uneq2d 4148	. . . . . . . . 9 ⊢ (𝐷 = 𝐵 → ((𝐶(,)𝐷) ∪ {𝐵}) = ((𝐶(,)𝐷) ∪ {𝐷}))
123	122	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐶(,)𝐷) ∪ {𝐵}) = ((𝐶(,)𝐷) ∪ {𝐷}))
124	19	rexrd 11290	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ ℝ^*)
125		ioounsn 13499	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐷 ∈ ℝ^* ∧ 𝐶 < 𝐷) → ((𝐶(,)𝐷) ∪ {𝐷}) = (𝐶(,]𝐷))
126	23, 124, 20, 125	syl3anc 1373	. . . . . . . . 9 ⊢ (𝜑 → ((𝐶(,)𝐷) ∪ {𝐷}) = (𝐶(,]𝐷))
127	126	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐶(,)𝐷) ∪ {𝐷}) = (𝐶(,]𝐷))
128	123, 127	eqtr2d 2772	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) = ((𝐶(,)𝐷) ∪ {𝐵}))
129	128	fveq2d 6885	. . . . . 6 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((int‘𝐽)‘(𝐶(,]𝐷)) = ((int‘𝐽)‘((𝐶(,)𝐷) ∪ {𝐵})))
130	119, 129	eleqtrd 2837	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐵 ∈ ((int‘𝐽)‘((𝐶(,)𝐷) ∪ {𝐵})))
131	12, 14, 16, 17, 18, 130	limcres 25844	. . . 4 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐵) = (𝐹 lim_ℂ 𝐵))
132	8, 131	eqtr2d 2772	. . 3 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐹 lim_ℂ 𝐵) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))
133	2, 6, 132	3eltr3d 2849	. 2 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))
134		limcresi 25843	. . 3 ⊢ (𝐹 lim_ℂ 𝐷) ⊆ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷)
135		iffalse 4514	. . . . . 6 ⊢ (¬ 𝐷 = 𝐵 → if(𝐷 = 𝐵, 𝐿, (𝐹‘𝐷)) = (𝐹‘𝐷))
136	3, 135	eqtrid 2783	. . . . 5 ⊢ (¬ 𝐷 = 𝐵 → 𝑌 = (𝐹‘𝐷))
137	136	adantl 481	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝑌 = (𝐹‘𝐷))
138		ssid 3986	. . . . . . . . . . . . 13 ⊢ ℂ ⊆ ℂ
139	138	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℂ ⊆ ℂ)
140		eqid 2736	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵))
141		unicntop 24729	. . . . . . . . . . . . . . . 16 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
142	141	restid 17452	. . . . . . . . . . . . . . 15 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld))
143	31, 142	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld)
144	143	eqcomi 2745	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) = ((TopOpen‘ℂ_fld) ↾_t ℂ)
145	17, 140, 144	cncfcn 24859	. . . . . . . . . . . 12 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
146	15, 139, 145	sylancr 587	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
147	9, 146	eleqtrd 2837	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
148	17	cnfldtopon 24726	. . . . . . . . . . . 12 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
149	15	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
150		resttopon 23104	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)))
151	148, 149, 150	sylancr 587	. . . . . . . . . . 11 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)))
152	148	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
153		cncnp 23223	. . . . . . . . . . 11 ⊢ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)) ∧ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)) → (𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))))
154	151, 152, 153	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))))
155	147, 154	mpbid 232	. . . . . . . . 9 ⊢ (𝜑 → (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥)))
156	155	simprd 495	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))
157	156	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))
158	33	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐴 ∈ ℝ^*)
159	35	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐵 ∈ ℝ^*)
160	19	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 ∈ ℝ)
161	32, 22, 19, 63, 20	lelttrd 11398	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 < 𝐷)
162	161	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐴 < 𝐷)
163	34	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐵 ∈ ℝ)
164	62	simprd 495	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ≤ 𝐵)
165	164	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 ≤ 𝐵)
166		neqne 2941	. . . . . . . . . . 11 ⊢ (¬ 𝐷 = 𝐵 → 𝐷 ≠ 𝐵)
167	166	necomd 2988	. . . . . . . . . 10 ⊢ (¬ 𝐷 = 𝐵 → 𝐵 ≠ 𝐷)
168	167	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐵 ≠ 𝐷)
169	160, 163, 165, 168	leneltd 11394	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 < 𝐵)
170	158, 159, 160, 162, 169	eliood 45494	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 ∈ (𝐴(,)𝐵))
171		fveq2 6881	. . . . . . . . 9 ⊢ (𝑥 = 𝐷 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷))
172	171	eleq2d 2821	. . . . . . . 8 ⊢ (𝑥 = 𝐷 → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) ↔ 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷)))
173	172	rspccva 3605	. . . . . . 7 ⊢ ((∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷))
174	157, 170, 173	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷))
175	17, 140	cnplimc 25845	. . . . . . 7 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷))))
176	15, 170, 175	sylancr 587	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷))))
177	174, 176	mpbid 232	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷)))
178	177	simprd 495	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷))
179	137, 178	eqeltrd 2835	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝑌 ∈ (𝐹 lim_ℂ 𝐷))
180	134, 179	sselid 3961	. 2 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))
181	133, 180	pm2.61dan 812	1 ⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2933 ∀wral 3052 Vcvv 3464 ∪ cun 3929 ∩ cin 3930 ⊆ wss 3931 ifcif 4505 {csn 4606 class class class wbr 5124 ran crn 5660 ↾ cres 5661 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ℂcc 11132 ℝcr 11133 +∞cpnf 11271 ℝ^*cxr 11273 < clt 11274 ≤ cle 11275 (,)cioo 13367 (,]cioc 13368 ↾_t crest 17439 TopOpenctopn 17440 topGenctg 17456 ℂ_fldccnfld 21320 Topctop 22836 TopOnctopon 22853 intcnt 22960 Cn ccn 23167 CnP ccnp 23168 –cn→ccncf 24825 lim_ℂ climc 25820

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-pre-sup 11212

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-int 4928 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 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 7867 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8724 df-map 8847 df-pm 8848 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-fi 9428 df-sup 9459 df-inf 9460 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-div 11900 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-7 12313 df-8 12314 df-9 12315 df-n0 12507 df-z 12594 df-dec 12714 df-uz 12858 df-q 12970 df-rp 13014 df-xneg 13133 df-xadd 13134 df-xmul 13135 df-ioo 13371 df-ioc 13372 df-icc 13374 df-fz 13530 df-seq 14025 df-exp 14085 df-cj 15123 df-re 15124 df-im 15125 df-sqrt 15259 df-abs 15260 df-struct 17171 df-slot 17206 df-ndx 17218 df-base 17234 df-plusg 17289 df-mulr 17290 df-starv 17291 df-tset 17295 df-ple 17296 df-ds 17298 df-unif 17299 df-rest 17441 df-topn 17442 df-topgen 17462 df-psmet 21312 df-xmet 21313 df-met 21314 df-bl 21315 df-mopn 21316 df-cnfld 21321 df-top 22837 df-topon 22854 df-topsp 22876 df-bases 22889 df-ntr 22963 df-cn 23170 df-cnp 23171 df-xms 24264 df-ms 24265 df-cncf 24827 df-limc 25824

This theorem is referenced by: fourierdlem49 46151 fourierdlem76 46178 fourierdlem91 46193

W3C validator