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 47149

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 486	. . 3 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐿 ∈ (𝐹 lim_ℂ 𝐵))
3		fourierdlem33.y	. . . . 5 ⊢ 𝑌 = if(𝐷 = 𝐵, 𝐿, (𝐹‘𝐷))
4		iftrue 4488	. . . . 5 ⊢ (𝐷 = 𝐵 → if(𝐷 = 𝐵, 𝐿, (𝐹‘𝐷)) = 𝐿)
5	3, 4	eqtr2id 2809	. . . 4 ⊢ (𝐷 = 𝐵 → 𝐿 = 𝑌)
6	5	adantl 487	. . 3 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐿 = 𝑌)
7		oveq2 7428	. . . . 5 ⊢ (𝐷 = 𝐵 → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐵))
8	7	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐵))
9		fourierdlem33.4	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
10		cncff 25214	. . . . . . 7 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
11	9, 10	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
12	11	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
13		fourierdlem33.ss	. . . . . 6 ⊢ (𝜑 → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
14	13	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,)𝐷) ⊆ (𝐴(,)𝐵))
15		ioosscn 13539	. . . . . 6 ⊢ (𝐴(,)𝐵) ⊆ ℂ
16	15	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐴(,)𝐵) ⊆ ℂ)
17		eqid 2761	. . . . 5 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
18		fourierdlem33.10	. . . . 5 ⊢ 𝐽 = ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵}))
19		fourierdlem33.7	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ ℝ)
20		fourierdlem33.8	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 < 𝐷)
21	19	leidd 11882	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ≤ 𝐷)
22		fourierdlem33.6	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐶 ∈ ℝ)
23	22	rexrd 11359	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 ∈ ℝ^*)
24		elioc2 13540	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐷 ∈ ℝ) → (𝐷 ∈ (𝐶(,]𝐷) ↔ (𝐷 ∈ ℝ ∧ 𝐶 < 𝐷 ∧ 𝐷 ≤ 𝐷)))
25	23, 19, 24	syl2anc 596	. . . . . . . . 9 ⊢ (𝜑 → (𝐷 ∈ (𝐶(,]𝐷) ↔ (𝐷 ∈ ℝ ∧ 𝐶 < 𝐷 ∧ 𝐷 ≤ 𝐷)))
26	19, 20, 21, 25	mpbir3and 1361	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ (𝐶(,]𝐷))
27	26	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐷 ∈ (𝐶(,]𝐷))
28		eqcom 2768	. . . . . . . 8 ⊢ (𝐷 = 𝐵 ↔ 𝐵 = 𝐷)
29	28	bilani 510	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐵 = 𝐷)
30	17	cnfldtop 25102	. . . . . . . . . . 11 ⊢ (TopOpen‘ℂ_fld) ∈ Top
31		fourierdlem33.1	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐴 ∈ ℝ)
32	31	rexrd 11359	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
33		fourierdlem33.2	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ ℝ)
34	33	rexrd 11359	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
35		fourierdlem33.3	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 < 𝐵)
36		ioounsn 13608	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 < 𝐵) → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵))
37	32, 34, 35, 36	syl3anc 1398	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐴(,)𝐵) ∪ {𝐵}) = (𝐴(,]𝐵))
38		ovex 7453	. . . . . . . . . . . . 13 ⊢ (𝐴(,]𝐵) ∈ V
39	38	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴(,]𝐵) ∈ V)
40	37, 39	eqeltrd 2861	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵) ∪ {𝐵}) ∈ V)
41		resttop 23478	. . . . . . . . . . 11 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ ((𝐴(,)𝐵) ∪ {𝐵}) ∈ V) → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})) ∈ Top)
42	30, 40, 41	sylancr 599	. . . . . . . . . 10 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})) ∈ Top)
43	18, 42	eqeltrid 2865	. . . . . . . . 9 ⊢ (𝜑 → 𝐽 ∈ Top)
44	43	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐽 ∈ Top)
45		oveq2 7428	. . . . . . . . . . 11 ⊢ (𝐷 = 𝐵 → (𝐶(,]𝐷) = (𝐶(,]𝐵))
46	45	adantl 487	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) = (𝐶(,]𝐵))
47	23	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐶 ∈ ℝ^*)
48		pnfxr 11363	. . . . . . . . . . . . . . . . 17 ⊢ +∞ ∈ ℝ^*
49	48	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → +∞ ∈ ℝ^*)
50		simpr 490	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ (𝐶(,]𝐵))
51	33	adantr 486	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐵 ∈ ℝ)
52		elioc2 13540	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐶(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
53	47, 51, 52	syl2anc 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → (𝑥 ∈ (𝐶(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
54	50, 53	mpbid 235	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵))
55	54	simp1d 1160	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ ℝ)
56	54	simp2d 1161	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐶 < 𝑥)
57	55	ltpnfd 13250	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 < +∞)
58	47, 49, 55, 56, 57	eliood 46509	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ (𝐶(,)+∞))
59	31	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 ∈ ℝ)
60	22	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐶 ∈ ℝ)
61	31, 33, 22, 19, 20, 13	fourierdlem10 47126	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝐴 ≤ 𝐶 ∧ 𝐷 ≤ 𝐵))
62	61	simpld 500	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ≤ 𝐶)
63	62	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 ≤ 𝐶)
64	59, 60, 55, 63, 56	lelttrd 11468	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 < 𝑥)
65	54	simp3d 1162	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ≤ 𝐵)
66	32	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝐴 ∈ ℝ^*)
67		elioc2 13540	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
68	66, 51, 67	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
69	55, 64, 65, 68	mpbir3and 1361	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ (𝐴(,]𝐵))
70	58, 69	elind 4146	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐶(,]𝐵)) → 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)))
71		elinel1 4147	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) → 𝑥 ∈ (𝐶(,)+∞))
72		elioore 13506	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ (𝐶(,)+∞) → 𝑥 ∈ ℝ)
73	71, 72	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) → 𝑥 ∈ ℝ)
74	73	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ ℝ)
75	23	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐶 ∈ ℝ^*)
76	48	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → +∞ ∈ ℝ^*)
77	71	adantl 487	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ (𝐶(,)+∞))
78		ioogtlb 46506	. . . . . . . . . . . . . . . 16 ⊢ ((𝐶 ∈ ℝ^* ∧ +∞ ∈ ℝ^* ∧ 𝑥 ∈ (𝐶(,)+∞)) → 𝐶 < 𝑥)
79	75, 76, 77, 78	syl3anc 1398	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐶 < 𝑥)
80		elinel2 4148	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) → 𝑥 ∈ (𝐴(,]𝐵))
81	80	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ (𝐴(,]𝐵))
82	32	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐴 ∈ ℝ^*)
83	33	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝐵 ∈ ℝ)
84	82, 83, 67	syl2anc 596	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → (𝑥 ∈ (𝐴(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
85	81, 84	mpbid 235	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → (𝑥 ∈ ℝ ∧ 𝐴 < 𝑥 ∧ 𝑥 ≤ 𝐵))
86	85	simp3d 1162	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ≤ 𝐵)
87	75, 83, 52	syl2anc 596	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → (𝑥 ∈ (𝐶(,]𝐵) ↔ (𝑥 ∈ ℝ ∧ 𝐶 < 𝑥 ∧ 𝑥 ≤ 𝐵)))
88	74, 79, 86, 87	mpbir3and 1361	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))) → 𝑥 ∈ (𝐶(,]𝐵))
89	70, 88	impbida 813	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ (𝐶(,]𝐵) ↔ 𝑥 ∈ ((𝐶(,)+∞) ∩ (𝐴(,]𝐵))))
90	89	eqrdv 2759	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶(,]𝐵) = ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)))
91		retop 25080	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) ∈ Top
92	91	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (topGen‘ran (,)) ∈ Top)
93		iooretop 25084	. . . . . . . . . . . . . 14 ⊢ (𝐶(,)+∞) ∈ (topGen‘ran (,))
94	93	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐶(,)+∞) ∈ (topGen‘ran (,)))
95		elrestr 17599	. . . . . . . . . . . . 13 ⊢ (((topGen‘ran (,)) ∈ Top ∧ (𝐴(,]𝐵) ∈ V ∧ (𝐶(,)+∞) ∈ (topGen‘ran (,))) → ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
96	92, 39, 94, 95	syl3anc 1398	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐶(,)+∞) ∩ (𝐴(,]𝐵)) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
97	90, 96	eqeltrd 2861	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐶(,]𝐵) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
98	97	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐵) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
99	46, 98	eqeltrd 2861	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) ∈ ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
100	18	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 = ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})))
101	37	oveq2d 7436	. . . . . . . . . . 11 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t ((𝐴(,)𝐵) ∪ {𝐵})) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)))
102	30	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ Top)
103		iocssre 13558	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝐴(,]𝐵) ⊆ ℝ)
104	32, 33, 103	syl2anc 596	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴(,]𝐵) ⊆ ℝ)
105		reex 11291	. . . . . . . . . . . . . 14 ⊢ ℝ ∈ V
106	105	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ∈ V)
107		restabs 23483	. . . . . . . . . . . . 13 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴(,]𝐵) ⊆ ℝ ∧ ℝ ∈ V) → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴(,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)))
108	102, 104, 106, 107	syl3anc 1398	. . . . . . . . . . . 12 ⊢ (𝜑 → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴(,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)))
109		tgioo4 25124	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
110	109	eqcomi 2770	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℝ) = (topGen‘ran (,))
111	110	oveq1i 7430	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴(,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵))
112	108, 111	eqtr3di 2811	. . . . . . . . . . 11 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)))
113	100, 101, 112	3eqtrrd 2801	. . . . . . . . . 10 ⊢ (𝜑 → ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)) = 𝐽)
114	113	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((topGen‘ran (,)) ↾_t (𝐴(,]𝐵)) = 𝐽)
115	99, 114	eleqtrd 2863	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) ∈ 𝐽)
116		isopn3i 23400	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ (𝐶(,]𝐷) ∈ 𝐽) → ((int‘𝐽)‘(𝐶(,]𝐷)) = (𝐶(,]𝐷))
117	44, 115, 116	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((int‘𝐽)‘(𝐶(,]𝐷)) = (𝐶(,]𝐷))
118	27, 29, 117	3eltr4d 2876	. . . . . 6 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐵 ∈ ((int‘𝐽)‘(𝐶(,]𝐷)))
119		sneq 4594	. . . . . . . . . . 11 ⊢ (𝐷 = 𝐵 → {𝐷} = {𝐵})
120	119	eqcomd 2767	. . . . . . . . . 10 ⊢ (𝐷 = 𝐵 → {𝐵} = {𝐷})
121	120	uneq2d 4115	. . . . . . . . 9 ⊢ (𝐷 = 𝐵 → ((𝐶(,)𝐷) ∪ {𝐵}) = ((𝐶(,)𝐷) ∪ {𝐷}))
122	121	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐶(,)𝐷) ∪ {𝐵}) = ((𝐶(,)𝐷) ∪ {𝐷}))
123	19	rexrd 11359	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ∈ ℝ^*)
124		ioounsn 13608	. . . . . . . . . 10 ⊢ ((𝐶 ∈ ℝ^* ∧ 𝐷 ∈ ℝ^* ∧ 𝐶 < 𝐷) → ((𝐶(,)𝐷) ∪ {𝐷}) = (𝐶(,]𝐷))
125	23, 123, 20, 124	syl3anc 1398	. . . . . . . . 9 ⊢ (𝜑 → ((𝐶(,)𝐷) ∪ {𝐷}) = (𝐶(,]𝐷))
126	125	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐶(,)𝐷) ∪ {𝐷}) = (𝐶(,]𝐷))
127	122, 126	eqtr2d 2797	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐶(,]𝐷) = ((𝐶(,)𝐷) ∪ {𝐵}))
128	127	fveq2d 6889	. . . . . 6 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((int‘𝐽)‘(𝐶(,]𝐷)) = ((int‘𝐽)‘((𝐶(,)𝐷) ∪ {𝐵})))
129	118, 128	eleqtrd 2863	. . . . 5 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝐵 ∈ ((int‘𝐽)‘((𝐶(,)𝐷) ∪ {𝐵})))
130	12, 14, 16, 17, 18, 129	limcres 26206	. . . 4 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐵) = (𝐹 lim_ℂ 𝐵))
131	8, 130	eqtr2d 2797	. . 3 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → (𝐹 lim_ℂ 𝐵) = ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))
132	2, 6, 131	3eltr3d 2875	. 2 ⊢ ((𝜑 ∧ 𝐷 = 𝐵) → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))
133		limcresi 26205	. . 3 ⊢ (𝐹 lim_ℂ 𝐷) ⊆ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷)
134		iffalse 4491	. . . . . 6 ⊢ (¬ 𝐷 = 𝐵 → if(𝐷 = 𝐵, 𝐿, (𝐹‘𝐷)) = (𝐹‘𝐷))
135	3, 134	eqtrid 2808	. . . . 5 ⊢ (¬ 𝐷 = 𝐵 → 𝑌 = (𝐹‘𝐷))
136	135	adantl 487	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝑌 = (𝐹‘𝐷))
137		ssid 3953	. . . . . . . . . . . . 13 ⊢ ℂ ⊆ ℂ
138	137	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → ℂ ⊆ ℂ)
139		eqid 2761	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵))
140		unicntop 25104	. . . . . . . . . . . . . . . 16 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
141	140	restid 17604	. . . . . . . . . . . . . . 15 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld))
142	30, 141	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld)
143	142	eqcomi 2770	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) = ((TopOpen‘ℂ_fld) ↾_t ℂ)
144	17, 139, 143	cncfcn 25231	. . . . . . . . . . . 12 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
145	15, 138, 144	sylancr 599	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
146	9, 145	eleqtrd 2863	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
147	17	cnfldtopon 25101	. . . . . . . . . . . 12 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
148	15	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
149		resttopon 23479	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ (𝐴(,)𝐵) ⊆ ℂ) → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)))
150	147, 148, 149	sylancr 599	. . . . . . . . . . 11 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)))
151	147	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ))
152		cncnp 23598	. . . . . . . . . . 11 ⊢ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) ∈ (TopOn‘(𝐴(,)𝐵)) ∧ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)) → (𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))))
153	150, 151, 152	syl2anc 596	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))))
154	146, 153	mpbid 235	. . . . . . . . 9 ⊢ (𝜑 → (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥)))
155	154	simprd 501	. . . . . . . 8 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))
156	155	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → ∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥))
157	32	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐴 ∈ ℝ^*)
158	34	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐵 ∈ ℝ^*)
159	19	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 ∈ ℝ)
160	31, 22, 19, 62, 20	lelttrd 11468	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 < 𝐷)
161	160	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐴 < 𝐷)
162	33	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐵 ∈ ℝ)
163	61	simprd 501	. . . . . . . . . 10 ⊢ (𝜑 → 𝐷 ≤ 𝐵)
164	163	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 ≤ 𝐵)
165		neqne 2964	. . . . . . . . . . 11 ⊢ (¬ 𝐷 = 𝐵 → 𝐷 ≠ 𝐵)
166	165	necomd 3011	. . . . . . . . . 10 ⊢ (¬ 𝐷 = 𝐵 → 𝐵 ≠ 𝐷)
167	166	adantl 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐵 ≠ 𝐷)
168	159, 162, 164, 167	leneltd 11464	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 < 𝐵)
169	157, 158, 159, 161, 168	eliood 46509	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐷 ∈ (𝐴(,)𝐵))
170		fveq2 6885	. . . . . . . . 9 ⊢ (𝑥 = 𝐷 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷))
171	170	eleq2d 2847	. . . . . . . 8 ⊢ (𝑥 = 𝐷 → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) ↔ 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷)))
172	171	rspccva 3576	. . . . . . 7 ⊢ ((∀𝑥 ∈ (𝐴(,)𝐵)𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑥) ∧ 𝐷 ∈ (𝐴(,)𝐵)) → 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷))
173	156, 169, 172	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷))
174	17, 139	cnplimc 26207	. . . . . . 7 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ 𝐷 ∈ (𝐴(,)𝐵)) → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷))))
175	15, 169, 174	sylancr 599	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → (𝐹 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐷) ↔ (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷))))
176	173, 175	mpbid 235	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → (𝐹:(𝐴(,)𝐵)⟶ℂ ∧ (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷)))
177	176	simprd 501	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → (𝐹‘𝐷) ∈ (𝐹 lim_ℂ 𝐷))
178	136, 177	eqeltrd 2861	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝑌 ∈ (𝐹 lim_ℂ 𝐷))
179	133, 178	sselid 3929	. 2 ⊢ ((𝜑 ∧ ¬ 𝐷 = 𝐵) → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))
180	132, 179	pm2.61dan 825	1 ⊢ (𝜑 → 𝑌 ∈ ((𝐹 ↾ (𝐶(,)𝐷)) lim_ℂ 𝐷))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 Vcvv 3451 ∪ cun 3897 ∩ cin 3898 ⊆ wss 3899 ifcif 4482 {csn 4584 class class class wbr 5103 ran crn 5652 ↾ cres 5653 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ℂcc 11198 ℝcr 11199 +∞cpnf 11340 ℝ^*cxr 11342 < clt 11343 ≤ cle 11344 (,)cioo 13476 (,]cioc 13477 ↾_t crest 17591 TopOpenctopn 17592 topGenctg 17608 ℂ_fldccnfld 21678 Topctop 23211 TopOnctopon 23228 intcnt 23335 Cn ccn 23542 CnP ccnp 23543 –cn→ccncf 25197 lim_ℂ climc 26182

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-map 8849 df-pm 8850 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-fi 9403 df-sup 9434 df-inf 9435 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-q 13076 df-rp 13121 df-xneg 13241 df-xadd 13242 df-xmul 13243 df-ioo 13480 df-ioc 13481 df-icc 13483 df-fz 13640 df-seq 14145 df-exp 14205 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-struct 17325 df-slot 17360 df-ndx 17372 df-base 17388 df-plusg 17441 df-mulr 17442 df-starv 17443 df-tset 17447 df-ple 17448 df-ds 17450 df-unif 17451 df-rest 17593 df-topn 17594 df-topgen 17614 df-psmet 21670 df-xmet 21671 df-met 21672 df-bl 21673 df-mopn 21674 df-cnfld 21679 df-top 23212 df-topon 23229 df-topsp 23251 df-bases 23264 df-ntr 23338 df-cn 23545 df-cnp 23546 df-xms 24639 df-ms 24640 df-cncf 25199 df-limc 26186

This theorem is used by: fourierdlem49 47164 fourierdlem76 47191 fourierdlem91 47206

W3C validator