cncfiooicclem1 - Mathbox for Glauco Siliprandi

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

Theorem cncfiooicclem1 46590

Description: A continuous function 𝐹 on an open interval (𝐴(,)𝐵) can be extended to a continuous function 𝐺 on the corresponding closed interval, if it has a finite right limit 𝑅 in 𝐴 and a finite left limit 𝐿 in 𝐵. 𝐹 can be complex-valued. This lemma assumes 𝐴 < 𝐵, the invoking theorem drops this assumption. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

**Hypotheses**
Ref	Expression
cncfiooicclem1.x	⊢ Ⅎ𝑥𝜑
cncfiooicclem1.g	⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))))
cncfiooicclem1.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
cncfiooicclem1.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
cncfiooicclem1.altb	⊢ (𝜑 → 𝐴 < 𝐵)
cncfiooicclem1.f	⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
cncfiooicclem1.l	⊢ (𝜑 → 𝐿 ∈ (𝐹 lim_ℂ 𝐵))
cncfiooicclem1.r	⊢ (𝜑 → 𝑅 ∈ (𝐹 lim_ℂ 𝐴))

**Assertion**
Ref	Expression
cncfiooicclem1	⊢ (𝜑 → 𝐺 ∈ ((𝐴[,]𝐵)–cn→ℂ))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 𝑥,𝐹 𝑥,𝐿 𝑥,𝑅 Allowed substitution hints: 𝜑(𝑥) 𝐺(𝑥)

Proof of Theorem cncfiooicclem1 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cncfiooicclem1.x	. . . 4 ⊢ Ⅎ𝑥𝜑
2		limccl 26015	. . . . . . 7 ⊢ (𝐹 lim_ℂ 𝐴) ⊆ ℂ
3		cncfiooicclem1.r	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ (𝐹 lim_ℂ 𝐴))
4	2, 3	sselid 3936	. . . . . 6 ⊢ (𝜑 → 𝑅 ∈ ℂ)
5	4	ad2antrr 738	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ 𝑥 = 𝐴) → 𝑅 ∈ ℂ)
6		limccl 26015	. . . . . . . 8 ⊢ (𝐹 lim_ℂ 𝐵) ⊆ ℂ
7		cncfiooicclem1.l	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ (𝐹 lim_ℂ 𝐵))
8	6, 7	sselid 3936	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ ℂ)
9	8	ad3antrrr 742	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ 𝑥 = 𝐵) → 𝐿 ∈ ℂ)
10		simplll 786	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝜑)
11		orel1 901	. . . . . . . . . . 11 ⊢ (¬ 𝑥 = 𝐴 → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑥 = 𝐵))
12	11	con3dimp 413	. . . . . . . . . 10 ⊢ ((¬ 𝑥 = 𝐴 ∧ ¬ 𝑥 = 𝐵) → ¬ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
13		vex 3459	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
14	13	elpr 4615	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐴, 𝐵} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
15	12, 14	sylnibr 332	. . . . . . . . 9 ⊢ ((¬ 𝑥 = 𝐴 ∧ ¬ 𝑥 = 𝐵) → ¬ 𝑥 ∈ {𝐴, 𝐵})
16	15	adantll 726	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → ¬ 𝑥 ∈ {𝐴, 𝐵})
17		simpllr 787	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ (𝐴[,]𝐵))
18		cncfiooicclem1.a	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ ℝ)
19	18	rexrd 11260	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
20	10, 19	syl 18	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝐴 ∈ ℝ^*)
21		cncfiooicclem1.b	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ∈ ℝ)
22	21	rexrd 11260	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
23	10, 22	syl 18	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝐵 ∈ ℝ^*)
24		cncfiooicclem1.altb	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 < 𝐵)
25	18, 21, 24	ltled 11359	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ≤ 𝐵)
26	10, 25	syl 18	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝐴 ≤ 𝐵)
27		prunioo 13509	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵))
28	20, 23, 26, 27	syl3anc 1398	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵))
29	17, 28	eleqtrrd 2866	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}))
30		elun 4108	. . . . . . . . 9 ⊢ (𝑥 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝑥 ∈ (𝐴(,)𝐵) ∨ 𝑥 ∈ {𝐴, 𝐵}))
31	29, 30	sylib 221	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → (𝑥 ∈ (𝐴(,)𝐵) ∨ 𝑥 ∈ {𝐴, 𝐵}))
32		orel2 903	. . . . . . . 8 ⊢ (¬ 𝑥 ∈ {𝐴, 𝐵} → ((𝑥 ∈ (𝐴(,)𝐵) ∨ 𝑥 ∈ {𝐴, 𝐵}) → 𝑥 ∈ (𝐴(,)𝐵)))
33	16, 31, 32	sylc 66	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ (𝐴(,)𝐵))
34		cncfiooicclem1.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
35		cncff 25033	. . . . . . . . 9 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
36	34, 35	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
37	36	ffvelcdmda 7081	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐹‘𝑥) ∈ ℂ)
38	10, 33, 37	syl2anc 595	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → (𝐹‘𝑥) ∈ ℂ)
39	9, 38	ifclda 4524	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) ∈ ℂ)
40	5, 39	ifclda 4524	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℂ)
41		cncfiooicclem1.g	. . . 4 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))))
42	1, 40, 41	fmptdf 7114	. . 3 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℂ)
43		elun 4108	. . . . . . 7 ⊢ (𝑦 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ (𝑦 ∈ (𝐴(,)𝐵) ∨ 𝑦 ∈ {𝐴, 𝐵}))
44	19, 22, 25, 27	syl3anc 1398	. . . . . . . 8 ⊢ (𝜑 → ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) = (𝐴[,]𝐵))
45	44	eleq2d 2849	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ ((𝐴(,)𝐵) ∪ {𝐴, 𝐵}) ↔ 𝑦 ∈ (𝐴[,]𝐵)))
46	43, 45	bitr3id 288	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ (𝐴(,)𝐵) ∨ 𝑦 ∈ {𝐴, 𝐵}) ↔ 𝑦 ∈ (𝐴[,]𝐵)))
47	46	biimpar 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → (𝑦 ∈ (𝐴(,)𝐵) ∨ 𝑦 ∈ {𝐴, 𝐵}))
48		ioossicc 13461	. . . . . . . . . . . . 13 ⊢ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵)
49		fssres 6746	. . . . . . . . . . . . 13 ⊢ ((𝐺:(𝐴[,]𝐵)⟶ℂ ∧ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵)) → (𝐺 ↾ (𝐴(,)𝐵)):(𝐴(,)𝐵)⟶ℂ)
50	42, 48, 49	sylancl 597	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐺 ↾ (𝐴(,)𝐵)):(𝐴(,)𝐵)⟶ℂ)
51	50	feqmptd 6951	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺 ↾ (𝐴(,)𝐵)) = (𝑦 ∈ (𝐴(,)𝐵) ↦ ((𝐺 ↾ (𝐴(,)𝐵))‘𝑦)))
52		nfmpt1 5211	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥(𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))))
53	41, 52	nfcxfr 2923	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥𝐺
54		nfcv 2925	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥(𝐴(,)𝐵)
55	53, 54	nfres 5982	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥(𝐺 ↾ (𝐴(,)𝐵))
56		nfcv 2925	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥𝑦
57	55, 56	nffv 6893	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥((𝐺 ↾ (𝐴(,)𝐵))‘𝑦)
58		nfcv 2925	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦(𝐺 ↾ (𝐴(,)𝐵))
59		nfcv 2925	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑦𝑥
60	58, 59	nffv 6893	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑦((𝐺 ↾ (𝐴(,)𝐵))‘𝑥)
61		fveq2 6883	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑥 → ((𝐺 ↾ (𝐴(,)𝐵))‘𝑦) = ((𝐺 ↾ (𝐴(,)𝐵))‘𝑥))
62	57, 60, 61	cbvmpt 5214	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ ((𝐺 ↾ (𝐴(,)𝐵))‘𝑦)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ ((𝐺 ↾ (𝐴(,)𝐵))‘𝑥))
63	62	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑦 ∈ (𝐴(,)𝐵) ↦ ((𝐺 ↾ (𝐴(,)𝐵))‘𝑦)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ ((𝐺 ↾ (𝐴(,)𝐵))‘𝑥)))
64		fvres 6902	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → ((𝐺 ↾ (𝐴(,)𝐵))‘𝑥) = (𝐺‘𝑥))
65	64	adantl 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → ((𝐺 ↾ (𝐴(,)𝐵))‘𝑥) = (𝐺‘𝑥))
66		simpr 489	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝑥 ∈ (𝐴(,)𝐵))
67	48, 66	sselid 3936	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝑥 ∈ (𝐴[,]𝐵))
68	4	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝑅 ∈ ℂ)
69	8	ad2antrr 738	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) ∧ 𝑥 = 𝐵) → 𝐿 ∈ ℂ)
70	37	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) ∧ ¬ 𝑥 = 𝐵) → (𝐹‘𝑥) ∈ ℂ)
71	69, 70	ifclda 4524	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) ∈ ℂ)
72	68, 71	ifcld 4535	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℂ)
73	41	fvmpt2 7003	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ (𝐴[,]𝐵) ∧ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℂ) → (𝐺‘𝑥) = if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))))
74	67, 72, 73	syl2anc 595	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → (𝐺‘𝑥) = if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))))
75		elioo4g 13434	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ (𝐴(,)𝐵) ↔ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ ℝ) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
76	75	biimpi 219	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ ℝ) ∧ (𝐴 < 𝑥 ∧ 𝑥 < 𝐵)))
77	76	simpld 499	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ ℝ))
78	77	simp1d 1160	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 ∈ ℝ^*)
79		elioore 13403	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 ∈ ℝ)
80	79	rexrd 11260	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 ∈ ℝ^*)
81		eliooord 13433	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 < 𝑥 ∧ 𝑥 < 𝐵))
82	81	simpld 499	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝐴 < 𝑥)
83		xrltne 13189	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝑥 ∈ ℝ^* ∧ 𝐴 < 𝑥) → 𝑥 ≠ 𝐴)
84	78, 80, 82, 83	syl3anc 1398	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 ≠ 𝐴)
85	84	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → 𝑥 ≠ 𝐴)
86	85	neneqd 2963	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → ¬ 𝑥 = 𝐴)
87	86	iffalsed 4499	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)))
88	81	simprd 500	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 < 𝐵)
89	79, 88	ltned 11347	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → 𝑥 ≠ 𝐵)
90	89	neneqd 2963	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → ¬ 𝑥 = 𝐵)
91	90	iffalsed 4499	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥))
92	91	adantl 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥))
93	87, 92	eqtrd 2798	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝑥))
94	65, 74, 93	3eqtrd 2802	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴(,)𝐵)) → ((𝐺 ↾ (𝐴(,)𝐵))‘𝑥) = (𝐹‘𝑥))
95	1, 94	mpteq2da 5204	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ (𝐴(,)𝐵) ↦ ((𝐺 ↾ (𝐴(,)𝐵))‘𝑥)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)))
96	51, 63, 95	3eqtrd 2802	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺 ↾ (𝐴(,)𝐵)) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)))
97	36	feqmptd 6951	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)))
98		ioosscn 13436	. . . . . . . . . . . . 13 ⊢ (𝐴(,)𝐵) ⊆ ℂ
99	98	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
100		ssid 3960	. . . . . . . . . . . 12 ⊢ ℂ ⊆ ℂ
101		eqid 2763	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
102		eqid 2763	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵))
103	101	cnfldtop 24921	. . . . . . . . . . . . . . 15 ⊢ (TopOpen‘ℂ_fld) ∈ Top
104		unicntop 24923	. . . . . . . . . . . . . . . 16 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
105	104	restid 17487	. . . . . . . . . . . . . . 15 ⊢ ((TopOpen‘ℂ_fld) ∈ Top → ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld))
106	103, 105	ax-mp 5	. . . . . . . . . . . . . 14 ⊢ ((TopOpen‘ℂ_fld) ↾_t ℂ) = (TopOpen‘ℂ_fld)
107	106	eqcomi 2772	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) = ((TopOpen‘ℂ_fld) ↾_t ℂ)
108	101, 102, 107	cncfcn 25050	. . . . . . . . . . . 12 ⊢ (((𝐴(,)𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
109	99, 100, 108	sylancl 597	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐴(,)𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
110	34, 97, 109	3eltr3d 2877	. . . . . . . . . 10 ⊢ (𝜑 → (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
111	96, 110	eqeltrd 2863	. . . . . . . . 9 ⊢ (𝜑 → (𝐺 ↾ (𝐴(,)𝐵)) ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)))
112	104	restuni 23300	. . . . . . . . . . 11 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴(,)𝐵) ⊆ ℂ) → (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)))
113	103, 98, 112	mp2an 704	. . . . . . . . . 10 ⊢ (𝐴(,)𝐵) = ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵))
114	113	cncnpi 23416	. . . . . . . . 9 ⊢ (((𝐺 ↾ (𝐴(,)𝐵)) ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) Cn (TopOpen‘ℂ_fld)) ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐺 ↾ (𝐴(,)𝐵)) ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
115	111, 114	sylan 591	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐺 ↾ (𝐴(,)𝐵)) ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
116	103	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (TopOpen‘ℂ_fld) ∈ Top)
117	48	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵))
118		ovex 7445	. . . . . . . . . . . . 13 ⊢ (𝐴[,]𝐵) ∈ V
119	118	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴[,]𝐵) ∈ V)
120		restabs 23303	. . . . . . . . . . . 12 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵) ∧ (𝐴[,]𝐵) ∈ V) → (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)))
121	116, 117, 119, 120	syl3anc 1398	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)))
122	121	eqcomd 2769	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) = (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)))
123	122	oveq1d 7427	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld)) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld)))
124	123	fveq1d 6885	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((((TopOpen‘ℂ_fld) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦) = (((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
125	115, 124	eleqtrd 2865	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐺 ↾ (𝐴(,)𝐵)) ∈ (((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
126		resttop 23298	. . . . . . . . . 10 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,]𝐵) ∈ V) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ∈ Top)
127	103, 118, 126	mp2an 704	. . . . . . . . 9 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ∈ Top
128	127	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ∈ Top)
129	48	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵))
130	18, 21	iccssred 13462	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ)
131		ax-resscn 11158	. . . . . . . . . . . 12 ⊢ ℝ ⊆ ℂ
132	130, 131	sstrdi 3950	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℂ)
133	104	restuni 23300	. . . . . . . . . . 11 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,]𝐵) ⊆ ℂ) → (𝐴[,]𝐵) = ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
134	103, 132, 133	sylancr 598	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴[,]𝐵) = ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
135	129, 134	sseqtrd 3974	. . . . . . . . 9 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
136	135	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
137		retop 24899	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) ∈ Top
138	137	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (topGen‘ran (,)) ∈ Top)
139		ioossre 13435	. . . . . . . . . . . . . . 15 ⊢ (𝐴(,)𝐵) ⊆ ℝ
140		difss 4091	. . . . . . . . . . . . . . 15 ⊢ (ℝ ∖ (𝐴[,]𝐵)) ⊆ ℝ
141	139, 140	unssi 4145	. . . . . . . . . . . . . 14 ⊢ ((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵))) ⊆ ℝ
142	141	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵))) ⊆ ℝ)
143		ssun1 4132	. . . . . . . . . . . . . 14 ⊢ (𝐴(,)𝐵) ⊆ ((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))
144	143	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴(,)𝐵) ⊆ ((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵))))
145		uniretop 24900	. . . . . . . . . . . . . 14 ⊢ ℝ = ∪ (topGen‘ran (,))
146	145	ntrss 23193	. . . . . . . . . . . . 13 ⊢ (((topGen‘ran (,)) ∈ Top ∧ ((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵))) ⊆ ℝ ∧ (𝐴(,)𝐵) ⊆ ((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))) → ((int‘(topGen‘ran (,)))‘(𝐴(,)𝐵)) ⊆ ((int‘(topGen‘ran (,)))‘((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))))
147	138, 142, 144, 146	syl3anc 1398	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((int‘(topGen‘ran (,)))‘(𝐴(,)𝐵)) ⊆ ((int‘(topGen‘ran (,)))‘((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))))
148		simpr 489	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ (𝐴(,)𝐵))
149		ioontr 46210	. . . . . . . . . . . . 13 ⊢ ((int‘(topGen‘ran (,)))‘(𝐴(,)𝐵)) = (𝐴(,)𝐵)
150	148, 149	eleqtrrdi 2874	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ((int‘(topGen‘ran (,)))‘(𝐴(,)𝐵)))
151	147, 150	sseldd 3939	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ((int‘(topGen‘ran (,)))‘((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))))
152	48, 148	sselid 3936	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ (𝐴[,]𝐵))
153	151, 152	elind 4154	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ (((int‘(topGen‘ran (,)))‘((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))) ∩ (𝐴[,]𝐵)))
154	130	adantr 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐴[,]𝐵) ⊆ ℝ)
155		eqid 2763	. . . . . . . . . . . 12 ⊢ ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) = ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵))
156	145, 155	restntr 23320	. . . . . . . . . . 11 ⊢ (((topGen‘ran (,)) ∈ Top ∧ (𝐴[,]𝐵) ⊆ ℝ ∧ (𝐴(,)𝐵) ⊆ (𝐴[,]𝐵)) → ((int‘((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)) = (((int‘(topGen‘ran (,)))‘((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))) ∩ (𝐴[,]𝐵)))
157	138, 154, 117, 156	syl3anc 1398	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((int‘((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)) = (((int‘(topGen‘ran (,)))‘((𝐴(,)𝐵) ∪ (ℝ ∖ (𝐴[,]𝐵)))) ∩ (𝐴[,]𝐵)))
158	153, 157	eleqtrrd 2866	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ((int‘((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)))
159		tgioo4 24943	. . . . . . . . . . . . . . 15 ⊢ (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ)
160	159	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (topGen‘ran (,)) = ((TopOpen‘ℂ_fld) ↾_t ℝ))
161	160	oveq1d 7427	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) = (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,]𝐵)))
162	103	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (TopOpen‘ℂ_fld) ∈ Top)
163		reex 11192	. . . . . . . . . . . . . . 15 ⊢ ℝ ∈ V
164	163	a1i 11	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ℝ ∈ V)
165		restabs 23303	. . . . . . . . . . . . . 14 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ (𝐴[,]𝐵) ⊆ ℝ ∧ ℝ ∈ V) → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
166	162, 130, 164, 165	syl3anc 1398	. . . . . . . . . . . . 13 ⊢ (𝜑 → (((TopOpen‘ℂ_fld) ↾_t ℝ) ↾_t (𝐴[,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
167	161, 166	eqtrd 2798	. . . . . . . . . . . 12 ⊢ (𝜑 → ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))
168	167	fveq2d 6887	. . . . . . . . . . 11 ⊢ (𝜑 → (int‘((topGen‘ran (,)) ↾_t (𝐴[,]𝐵))) = (int‘((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))))
169	168	fveq1d 6885	. . . . . . . . . 10 ⊢ (𝜑 → ((int‘((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)) = ((int‘((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)))
170	169	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → ((int‘((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)) = ((int‘((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)))
171	158, 170	eleqtrd 2865	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝑦 ∈ ((int‘((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)))
172	134	feq2d 6691	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺:(𝐴[,]𝐵)⟶ℂ ↔ 𝐺:∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))⟶ℂ))
173	42, 172	mpbid 235	. . . . . . . . 9 ⊢ (𝜑 → 𝐺:∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))⟶ℂ)
174	173	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐺:∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))⟶ℂ)
175		eqid 2763	. . . . . . . . 9 ⊢ ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) = ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))
176	175, 104	cnprest 23427	. . . . . . . 8 ⊢ (((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ∈ Top ∧ (𝐴(,)𝐵) ⊆ ∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))) ∧ (𝑦 ∈ ((int‘((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)))‘(𝐴(,)𝐵)) ∧ 𝐺:∪ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))⟶ℂ)) → (𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦) ↔ (𝐺 ↾ (𝐴(,)𝐵)) ∈ (((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦)))
177	128, 136, 171, 174, 176	syl22anc 851	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → (𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦) ↔ (𝐺 ↾ (𝐴(,)𝐵)) ∈ (((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ↾_t (𝐴(,)𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦)))
178	125, 177	mpbird 260	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴(,)𝐵)) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
179		elpri 4614	. . . . . . 7 ⊢ (𝑦 ∈ {𝐴, 𝐵} → (𝑦 = 𝐴 ∨ 𝑦 = 𝐵))
180		iftrue 4494	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝐴 → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = 𝑅)
181		lbicc2 13492	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ (𝐴[,]𝐵))
182	19, 22, 25, 181	syl3anc 1398	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ∈ (𝐴[,]𝐵))
183	41, 180, 182, 3	fvmptd3 7015	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐺‘𝐴) = 𝑅)
184	97	eqcomd 2769	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑥 ∈ (𝐴(,)𝐵) ↦ (𝐹‘𝑥)) = 𝐹)
185	96, 184	eqtr2d 2799	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹 = (𝐺 ↾ (𝐴(,)𝐵)))
186	185	oveq1d 7427	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐴) = ((𝐺 ↾ (𝐴(,)𝐵)) lim_ℂ 𝐴))
187	3, 186	eleqtrd 2865	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ ((𝐺 ↾ (𝐴(,)𝐵)) lim_ℂ 𝐴))
188	18, 21, 24, 42	limciccioolb 46320	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐺 ↾ (𝐴(,)𝐵)) lim_ℂ 𝐴) = (𝐺 lim_ℂ 𝐴))
189	187, 188	eleqtrd 2865	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ (𝐺 lim_ℂ 𝐴))
190	183, 189	eqeltrd 2863	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺‘𝐴) ∈ (𝐺 lim_ℂ 𝐴))
191		eqid 2763	. . . . . . . . . . . . 13 ⊢ ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) = ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵))
192	101, 191	cnplimc 26027	. . . . . . . . . . . 12 ⊢ (((𝐴[,]𝐵) ⊆ ℂ ∧ 𝐴 ∈ (𝐴[,]𝐵)) → (𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐴) ↔ (𝐺:(𝐴[,]𝐵)⟶ℂ ∧ (𝐺‘𝐴) ∈ (𝐺 lim_ℂ 𝐴))))
193	132, 182, 192	syl2anc 595	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐴) ↔ (𝐺:(𝐴[,]𝐵)⟶ℂ ∧ (𝐺‘𝐴) ∈ (𝐺 lim_ℂ 𝐴))))
194	42, 190, 193	mpbir2and 725	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐴))
195	194	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐴))
196		fveq2 6883	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐴 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐴))
197	196	eqcomd 2769	. . . . . . . . . 10 ⊢ (𝑦 = 𝐴 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐴) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
198	197	adantl 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐴) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
199	195, 198	eleqtrd 2865	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 = 𝐴) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
200	180	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = 𝐵 ∧ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = 𝑅)
201		eqtr2 2784	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = 𝐵 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐴)
202		iftrue 4494	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐵 = 𝐴 → if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))) = 𝑅)
203	202	eqcomd 2769	. . . . . . . . . . . . . . . . 17 ⊢ (𝐵 = 𝐴 → 𝑅 = if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))))
204	201, 203	syl 18	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = 𝐵 ∧ 𝑥 = 𝐴) → 𝑅 = if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))))
205	200, 204	eqtrd 2798	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 = 𝐵 ∧ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))))
206		iffalse 4497	. . . . . . . . . . . . . . . . 17 ⊢ (¬ 𝑥 = 𝐴 → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)))
207	206	adantl 486	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = 𝐵 ∧ ¬ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)))
208		iftrue 4494	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = 𝐿)
209	208	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = 𝐵 ∧ ¬ 𝑥 = 𝐴) → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = 𝐿)
210		df-ne 2959	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ≠ 𝐴 ↔ ¬ 𝑥 = 𝐴)
211		pm13.18 3039	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑥 = 𝐵 ∧ 𝑥 ≠ 𝐴) → 𝐵 ≠ 𝐴)
212	210, 211	sylan2br 606	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 = 𝐵 ∧ ¬ 𝑥 = 𝐴) → 𝐵 ≠ 𝐴)
213	212	neneqd 2963	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 = 𝐵 ∧ ¬ 𝑥 = 𝐴) → ¬ 𝐵 = 𝐴)
214	213	iffalsed 4499	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = 𝐵 ∧ ¬ 𝑥 = 𝐴) → if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))) = if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵)))
215		eqid 2763	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐵 = 𝐵
216	215	iftruei 4495	. . . . . . . . . . . . . . . . 17 ⊢ if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵)) = 𝐿
217	214, 216	eqtr2di 2815	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = 𝐵 ∧ ¬ 𝑥 = 𝐴) → 𝐿 = if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))))
218	207, 209, 217	3eqtrd 2802	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 = 𝐵 ∧ ¬ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))))
219	205, 218	pm2.61dan 824	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))))
220	21	leidd 11781	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ≤ 𝐵)
221	18, 21, 21, 25, 220	eliccd 46203	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ (𝐴[,]𝐵))
222	216, 8	eqeltrid 2867	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵)) ∈ ℂ)
223	4, 222	ifcld 4535	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))) ∈ ℂ)
224	41, 219, 221, 223	fvmptd3 7015	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐺‘𝐵) = if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))))
225	18, 24	gtned 11346	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐵 ≠ 𝐴)
226	225	neneqd 2963	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ¬ 𝐵 = 𝐴)
227	226	iffalsed 4499	. . . . . . . . . . . . 13 ⊢ (𝜑 → if(𝐵 = 𝐴, 𝑅, if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵))) = if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵)))
228	216	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → if(𝐵 = 𝐵, 𝐿, (𝐹‘𝐵)) = 𝐿)
229	224, 227, 228	3eqtrd 2802	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐺‘𝐵) = 𝐿)
230	185	oveq1d 7427	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐵) = ((𝐺 ↾ (𝐴(,)𝐵)) lim_ℂ 𝐵))
231	7, 230	eleqtrd 2865	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐿 ∈ ((𝐺 ↾ (𝐴(,)𝐵)) lim_ℂ 𝐵))
232	18, 21, 24, 42	limcicciooub 46334	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐺 ↾ (𝐴(,)𝐵)) lim_ℂ 𝐵) = (𝐺 lim_ℂ 𝐵))
233	231, 232	eleqtrd 2865	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐿 ∈ (𝐺 lim_ℂ 𝐵))
234	229, 233	eqeltrd 2863	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺‘𝐵) ∈ (𝐺 lim_ℂ 𝐵))
235	101, 191	cnplimc 26027	. . . . . . . . . . . 12 ⊢ (((𝐴[,]𝐵) ⊆ ℂ ∧ 𝐵 ∈ (𝐴[,]𝐵)) → (𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐵) ↔ (𝐺:(𝐴[,]𝐵)⟶ℂ ∧ (𝐺‘𝐵) ∈ (𝐺 lim_ℂ 𝐵))))
236	132, 221, 235	syl2anc 595	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐵) ↔ (𝐺:(𝐴[,]𝐵)⟶ℂ ∧ (𝐺‘𝐵) ∈ (𝐺 lim_ℂ 𝐵))))
237	42, 234, 236	mpbir2and 725	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐵))
238	237	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = 𝐵) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐵))
239		fveq2 6883	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐵 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐵))
240	239	eqcomd 2769	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐵) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
241	240	adantl 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 = 𝐵) → ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝐵) = ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
242	238, 241	eleqtrd 2865	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 = 𝐵) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
243	199, 242	jaodan 972	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 = 𝐴 ∨ 𝑦 = 𝐵)) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
244	179, 243	sylan2 604	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ {𝐴, 𝐵}) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
245	178, 244	jaodan 972	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ (𝐴(,)𝐵) ∨ 𝑦 ∈ {𝐴, 𝐵})) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
246	47, 245	syldan 602	. . . 4 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐴[,]𝐵)) → 𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
247	246	ralrimiva 3157	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ (𝐴[,]𝐵)𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))
248	101	cnfldtopon 24920	. . . . 5 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
249		resttopon 23299	. . . . 5 ⊢ (((TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ) ∧ (𝐴[,]𝐵) ⊆ ℂ) → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ∈ (TopOn‘(𝐴[,]𝐵)))
250	248, 132, 249	sylancr 598	. . . 4 ⊢ (𝜑 → ((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ∈ (TopOn‘(𝐴[,]𝐵)))
251		cncnp 23418	. . . 4 ⊢ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) ∈ (TopOn‘(𝐴[,]𝐵)) ∧ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)) → (𝐺 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐺:(𝐴[,]𝐵)⟶ℂ ∧ ∀𝑦 ∈ (𝐴[,]𝐵)𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))))
252	250, 248, 251	sylancl 597	. . 3 ⊢ (𝜑 → (𝐺 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)) ↔ (𝐺:(𝐴[,]𝐵)⟶ℂ ∧ ∀𝑦 ∈ (𝐴[,]𝐵)𝐺 ∈ ((((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) CnP (TopOpen‘ℂ_fld))‘𝑦))))
253	42, 247, 252	mpbir2and 725	. 2 ⊢ (𝜑 → 𝐺 ∈ (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)))
254	101, 191, 107	cncfcn 25050	. . 3 ⊢ (((𝐴[,]𝐵) ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴[,]𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)))
255	132, 100, 254	sylancl 597	. 2 ⊢ (𝜑 → ((𝐴[,]𝐵)–cn→ℂ) = (((TopOpen‘ℂ_fld) ↾_t (𝐴[,]𝐵)) Cn (TopOpen‘ℂ_fld)))
256	253, 255	eleqtrrd 2866	1 ⊢ (𝜑 → 𝐺 ∈ ((𝐴[,]𝐵)–cn→ℂ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1103 = wceq 1570 Ⅎwnf 1813 ∈ wcel 2143 ≠ wne 2958 ∀wral 3079 Vcvv 3455 ∖ cdif 3903 ∪ cun 3904 ∩ cin 3905 ⊆ wss 3906 ifcif 4488 {cpr 4592 ∪ cuni 4873 class class class wbr 5110 ↦ cmpt 5193 ran crn 5664 ↾ cres 5665 ⟶wf 6534 ‘cfv 6538 (class class class)co 7412 ℂcc 11099 ℝcr 11100 ℝ^*cxr 11243 < clt 11244 ≤ cle 11245 (,)cioo 13373 [,]cicc 13376 ↾_t crest 17474 TopOpenctopn 17475 topGenctg 17491 ℂ_fldccnfld 21503 Topctop 23031 TopOnctopon 23048 intcnt 23155 Cn ccn 23362 CnP ccnp 23363 –cn→ccncf 25016 lim_ℂ climc 26002

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 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 ax-pre-sup 11179

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 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-tp 4595 df-op 4597 df-uni 4874 df-int 4914 df-iun 4959 df-iin 4960 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-er 8695 df-map 8827 df-pm 8828 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-fi 9372 df-sup 9403 df-inf 9404 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-div 11873 df-nn 12235 df-2 12304 df-3 12305 df-4 12306 df-5 12307 df-6 12308 df-7 12309 df-8 12310 df-9 12311 df-n0 12506 df-z 12593 df-dec 12713 df-uz 12864 df-q 12974 df-rp 13018 df-xneg 13138 df-xadd 13139 df-xmul 13140 df-ioo 13377 df-ioc 13378 df-ico 13379 df-icc 13380 df-fz 13537 df-seq 14040 df-exp 14100 df-cj 15152 df-re 15153 df-im 15154 df-sqrt 15288 df-abs 15289 df-struct 17208 df-slot 17243 df-ndx 17255 df-base 17271 df-plusg 17324 df-mulr 17325 df-starv 17326 df-tset 17330 df-ple 17331 df-ds 17333 df-unif 17334 df-rest 17476 df-topn 17477 df-topgen 17497 df-psmet 21495 df-xmet 21496 df-met 21497 df-bl 21498 df-mopn 21499 df-cnfld 21504 df-top 23032 df-topon 23049 df-topsp 23071 df-bases 23084 df-cld 23157 df-ntr 23158 df-cls 23159 df-cn 23365 df-cnp 23366 df-xms 24458 df-ms 24459 df-cncf 25018 df-limc 26006

This theorem is referenced by: cncfiooicc 46591

W3C validator