cncfiooiccre - Mathbox for Glauco Siliprandi

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

Theorem cncfiooiccre 44909

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 𝐵. 𝐹 is assumed to be real-valued. (Contributed by Glauco Siliprandi, 11-Dec-2019.)

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

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

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

**Proof of Theorem cncfiooiccre**
Step	Hyp	Ref	Expression
1		iftrue 4533	. . . . . . 7 ⊢ (𝑥 = 𝐴 → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = 𝑅)
2	1	adantl 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = 𝑅)
3		cncfiooiccre.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℝ))
4		cncff 24633	. . . . . . . . 9 ⊢ (𝐹 ∈ ((𝐴(,)𝐵)–cn→ℝ) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
5	3, 4	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
6		ioosscn 13390	. . . . . . . . 9 ⊢ (𝐴(,)𝐵) ⊆ ℂ
7	6	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝐴(,)𝐵) ⊆ ℂ)
8		eqid 2730	. . . . . . . . 9 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
9		cncfiooiccre.b	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℝ)
10	9	rexrd 11268	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
11		cncfiooiccre.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ)
12		cncfiooiccre.altb	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 < 𝐵)
13	8, 10, 11, 12	lptioo1cn 44660	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(𝐴(,)𝐵)))
14		cncfiooiccre.r	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ (𝐹 lim_ℂ 𝐴))
15	5, 7, 13, 14	limcrecl 44643	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ ℝ)
16	15	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑅 ∈ ℝ)
17	2, 16	eqeltrd 2831	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℝ)
18	17	adantlr 711	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℝ)
19		iffalse 4536	. . . . . . . . 9 ⊢ (¬ 𝑥 = 𝐴 → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)))
20		iftrue 4533	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = 𝐿)
21	19, 20	sylan9eq 2790	. . . . . . . 8 ⊢ ((¬ 𝑥 = 𝐴 ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = 𝐿)
22	21	adantll 710	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑥 = 𝐴) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = 𝐿)
23	11	rexrd 11268	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
24	8, 23, 9, 12	lptioo2cn 44659	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ((limPt‘(TopOpen‘ℂ_fld))‘(𝐴(,)𝐵)))
25		cncfiooiccre.l	. . . . . . . . 9 ⊢ (𝜑 → 𝐿 ∈ (𝐹 lim_ℂ 𝐵))
26	5, 7, 24, 25	limcrecl 44643	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ ℝ)
27	26	ad2antrr 722	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑥 = 𝐴) ∧ 𝑥 = 𝐵) → 𝐿 ∈ ℝ)
28	22, 27	eqeltrd 2831	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑥 = 𝐴) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℝ)
29	28	adantllr 715	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℝ)
30		iffalse 4536	. . . . . . . 8 ⊢ (¬ 𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥)) = (𝐹‘𝑥))
31	19, 30	sylan9eq 2790	. . . . . . 7 ⊢ ((¬ 𝑥 = 𝐴 ∧ ¬ 𝑥 = 𝐵) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝑥))
32	31	adantll 710	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) = (𝐹‘𝑥))
33	5	ad3antrrr 726	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
34	23	ad3antrrr 726	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝐴 ∈ ℝ^*)
35	10	ad3antrrr 726	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝐵 ∈ ℝ^*)
36	11	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ∈ ℝ)
37	9	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐵 ∈ ℝ)
38		simpr 483	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ (𝐴[,]𝐵))
39		eliccre 44516	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ ℝ)
40	36, 37, 38, 39	syl3anc 1369	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ∈ ℝ)
41	40	ad2antrr 722	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ ℝ)
42	11	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝐴 ∈ ℝ)
43	40	adantr 479	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝑥 ∈ ℝ)
44	23	ad2antrr 722	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝐴 ∈ ℝ^*)
45	10	ad2antrr 722	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝐵 ∈ ℝ^*)
46	38	adantr 479	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝑥 ∈ (𝐴[,]𝐵))
47		iccgelb 13384	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝐴 ≤ 𝑥)
48	44, 45, 46, 47	syl3anc 1369	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝐴 ≤ 𝑥)
49		neqne 2946	. . . . . . . . . . 11 ⊢ (¬ 𝑥 = 𝐴 → 𝑥 ≠ 𝐴)
50	49	adantl 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝑥 ≠ 𝐴)
51	42, 43, 48, 50	leneltd 11372	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → 𝐴 < 𝑥)
52	51	adantr 479	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝐴 < 𝑥)
53	40	adantr 479	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ ℝ)
54	9	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝐵 ∈ ℝ)
55	23	ad2antrr 722	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝐴 ∈ ℝ^*)
56	10	ad2antrr 722	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝐵 ∈ ℝ^*)
57	38	adantr 479	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ (𝐴[,]𝐵))
58		iccleub 13383	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝑥 ∈ (𝐴[,]𝐵)) → 𝑥 ≤ 𝐵)
59	55, 56, 57, 58	syl3anc 1369	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ≤ 𝐵)
60		neqne 2946	. . . . . . . . . . . 12 ⊢ (¬ 𝑥 = 𝐵 → 𝑥 ≠ 𝐵)
61	60	necomd 2994	. . . . . . . . . . 11 ⊢ (¬ 𝑥 = 𝐵 → 𝐵 ≠ 𝑥)
62	61	adantl 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝐵 ≠ 𝑥)
63	53, 54, 59, 62	leneltd 11372	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐵) → 𝑥 < 𝐵)
64	63	adantlr 711	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝑥 < 𝐵)
65	34, 35, 41, 52, 64	eliood 44509	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ (𝐴(,)𝐵))
66	33, 65	ffvelcdmd 7086	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → (𝐹‘𝑥) ∈ ℝ)
67	32, 66	eqeltrd 2831	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) ∧ ¬ 𝑥 = 𝐵) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℝ)
68	29, 67	pm2.61dan 809	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) ∧ ¬ 𝑥 = 𝐴) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℝ)
69	18, 68	pm2.61dan 809	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴[,]𝐵)) → if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))) ∈ ℝ)
70		cncfiooiccre.g	. . 3 ⊢ 𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹‘𝑥))))
71	69, 70	fmptd 7114	. 2 ⊢ (𝜑 → 𝐺:(𝐴[,]𝐵)⟶ℝ)
72		ax-resscn 11169	. . 3 ⊢ ℝ ⊆ ℂ
73		cncfiooiccre.x	. . . 4 ⊢ Ⅎ𝑥𝜑
74		ssid 4003	. . . . . 6 ⊢ ℂ ⊆ ℂ
75		cncfss 24639	. . . . . 6 ⊢ ((ℝ ⊆ ℂ ∧ ℂ ⊆ ℂ) → ((𝐴(,)𝐵)–cn→ℝ) ⊆ ((𝐴(,)𝐵)–cn→ℂ))
76	72, 74, 75	mp2an 688	. . . . 5 ⊢ ((𝐴(,)𝐵)–cn→ℝ) ⊆ ((𝐴(,)𝐵)–cn→ℂ)
77	76, 3	sselid 3979	. . . 4 ⊢ (𝜑 → 𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))
78	73, 70, 11, 9, 77, 25, 14	cncfiooicc 44908	. . 3 ⊢ (𝜑 → 𝐺 ∈ ((𝐴[,]𝐵)–cn→ℂ))
79		cncfcdm 24638	. . 3 ⊢ ((ℝ ⊆ ℂ ∧ 𝐺 ∈ ((𝐴[,]𝐵)–cn→ℂ)) → (𝐺 ∈ ((𝐴[,]𝐵)–cn→ℝ) ↔ 𝐺:(𝐴[,]𝐵)⟶ℝ))
80	72, 78, 79	sylancr 585	. 2 ⊢ (𝜑 → (𝐺 ∈ ((𝐴[,]𝐵)–cn→ℝ) ↔ 𝐺:(𝐴[,]𝐵)⟶ℝ))
81	71, 80	mpbird 256	1 ⊢ (𝜑 → 𝐺 ∈ ((𝐴[,]𝐵)–cn→ℝ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1539 Ⅎwnf 1783 ∈ wcel 2104 ≠ wne 2938 ⊆ wss 3947 ifcif 4527 class class class wbr 5147 ↦ cmpt 5230 ⟶wf 6538 ‘cfv 6542 (class class class)co 7411 ℂcc 11110 ℝcr 11111 ℝ^*cxr 11251 < clt 11252 ≤ cle 11253 (,)cioo 13328 [,]cicc 13331 TopOpenctopn 17371 ℂ_fldccnfld 21144 –cn→ccncf 24616 lim_ℂ climc 25611

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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-map 8824 df-pm 8825 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fi 9408 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-7 12284 df-8 12285 df-9 12286 df-n0 12477 df-z 12563 df-dec 12682 df-uz 12827 df-q 12937 df-rp 12979 df-xneg 13096 df-xadd 13097 df-xmul 13098 df-ioo 13332 df-ioc 13333 df-ico 13334 df-icc 13335 df-fz 13489 df-seq 13971 df-exp 14032 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-struct 17084 df-slot 17119 df-ndx 17131 df-base 17149 df-plusg 17214 df-mulr 17215 df-starv 17216 df-tset 17220 df-ple 17221 df-ds 17223 df-unif 17224 df-rest 17372 df-topn 17373 df-topgen 17393 df-psmet 21136 df-xmet 21137 df-met 21138 df-bl 21139 df-mopn 21140 df-cnfld 21145 df-top 22616 df-topon 22633 df-topsp 22655 df-bases 22669 df-cld 22743 df-ntr 22744 df-cls 22745 df-nei 22822 df-lp 22860 df-cn 22951 df-cnp 22952 df-xms 24046 df-ms 24047 df-cncf 24618 df-limc 25615

This theorem is referenced by: (None)

W3C validator