dvcnvrelem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > dvcnvrelem2		Structured version Visualization version GIF version

Theorem dvcnvrelem2 24001

Description: Lemma for dvcnvre 24002. (Contributed by Mario Carneiro, 19-Feb-2015.) (Revised by Mario Carneiro, 8-Sep-2015.)

**Hypotheses**
Ref	Expression
dvcnvre.f	⊢ (𝜑 → 𝐹 ∈ (𝑋–cn→ℝ))
dvcnvre.d	⊢ (𝜑 → dom (ℝ D 𝐹) = 𝑋)
dvcnvre.z	⊢ (𝜑 → ¬ 0 ∈ ran (ℝ D 𝐹))
dvcnvre.1	⊢ (𝜑 → 𝐹:𝑋–1-1-onto→𝑌)
dvcnvre.c	⊢ (𝜑 → 𝐶 ∈ 𝑋)
dvcnvre.r	⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
dvcnvre.s	⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋)
dvcnvre.t	⊢ 𝑇 = (topGen‘ran (,))
dvcnvre.j	⊢ 𝐽 = (TopOpen‘ℂ_fld)
dvcnvre.m	⊢ 𝑀 = (𝐽 ↾_t 𝑋)
dvcnvre.n	⊢ 𝑁 = (𝐽 ↾_t 𝑌)

**Assertion**
Ref	Expression
dvcnvrelem2	⊢ (𝜑 → ((𝐹‘𝐶) ∈ ((int‘𝑇)‘𝑌) ∧ ^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶))))

**Proof of Theorem dvcnvrelem2**
Step	Hyp	Ref	Expression
1		dvcnvre.t	. . . . . 6 ⊢ 𝑇 = (topGen‘ran (,))
2		retop 22785	. . . . . 6 ⊢ (topGen‘ran (,)) ∈ Top
3	1, 2	eqeltri 2846	. . . . 5 ⊢ 𝑇 ∈ Top
4	3	a1i 11	. . . 4 ⊢ (𝜑 → 𝑇 ∈ Top)
5		dvcnvre.1	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑋–1-1-onto→𝑌)
6		f1ofo 6285	. . . . . 6 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋–onto→𝑌)
7		forn 6259	. . . . . 6 ⊢ (𝐹:𝑋–onto→𝑌 → ran 𝐹 = 𝑌)
8	5, 6, 7	3syl 18	. . . . 5 ⊢ (𝜑 → ran 𝐹 = 𝑌)
9		dvcnvre.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝑋–cn→ℝ))
10		cncff 22916	. . . . . 6 ⊢ (𝐹 ∈ (𝑋–cn→ℝ) → 𝐹:𝑋⟶ℝ)
11		frn 6193	. . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → ran 𝐹 ⊆ ℝ)
12	9, 10, 11	3syl 18	. . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
13	8, 12	eqsstr3d 3789	. . . 4 ⊢ (𝜑 → 𝑌 ⊆ ℝ)
14		imassrn 5618	. . . . 5 ⊢ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ran 𝐹
15	14, 8	syl5sseq 3802	. . . 4 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌)
16		uniretop 22786	. . . . . 6 ⊢ ℝ = ∪ (topGen‘ran (,))
17	1	unieqi 4583	. . . . . 6 ⊢ ∪ 𝑇 = ∪ (topGen‘ran (,))
18	16, 17	eqtr4i 2796	. . . . 5 ⊢ ℝ = ∪ 𝑇
19	18	ntrss 21080	. . . 4 ⊢ ((𝑇 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌) → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘𝑌))
20	4, 13, 15, 19	syl3anc 1476	. . 3 ⊢ (𝜑 → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘𝑌))
21		dvcnvre.d	. . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐹) = 𝑋)
22		dvcnvre.z	. . . . 5 ⊢ (𝜑 → ¬ 0 ∈ ran (ℝ D 𝐹))
23		dvcnvre.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
24		dvcnvre.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
25		dvcnvre.s	. . . . 5 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋)
26	9, 21, 22, 5, 23, 24, 25	dvcnvrelem1 24000	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘(topGen‘ran (,)))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
27	1	fveq2i 6335	. . . . 5 ⊢ (int‘𝑇) = (int‘(topGen‘ran (,)))
28	27	fveq1i 6333	. . . 4 ⊢ ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((int‘(topGen‘ran (,)))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
29	26, 28	syl6eleqr 2861	. . 3 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
30	20, 29	sseldd 3753	. 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘𝑌))
31		f1ocnv 6290	. . . . . . 7 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ^◡𝐹:𝑌–1-1-onto→𝑋)
32		f1of 6278	. . . . . . 7 ⊢ (^◡𝐹:𝑌–1-1-onto→𝑋 → ^◡𝐹:𝑌⟶𝑋)
33	5, 31, 32	3syl 18	. . . . . 6 ⊢ (𝜑 → ^◡𝐹:𝑌⟶𝑋)
34		ffun 6188	. . . . . 6 ⊢ (^◡𝐹:𝑌⟶𝑋 → Fun ^◡𝐹)
35		funcnvres 6107	. . . . . 6 ⊢ (Fun ^◡𝐹 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
36	33, 34, 35	3syl 18	. . . . 5 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
37		dvbsss 23886	. . . . . . . . . . 11 ⊢ dom (ℝ D 𝐹) ⊆ ℝ
38	21, 37	syl6eqssr 3805	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ⊆ ℝ)
39		ax-resscn 10195	. . . . . . . . . 10 ⊢ ℝ ⊆ ℂ
40	38, 39	syl6ss 3764	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
41		cncfss 22922	. . . . . . . . 9 ⊢ ((((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋 ∧ 𝑋 ⊆ ℂ) → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
42	25, 40, 41	syl2anc 573	. . . . . . . 8 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
43		f1of1 6277	. . . . . . . . . . 11 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋–1-1→𝑌)
44	5, 43	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑋–1-1→𝑌)
45		f1ores 6292	. . . . . . . . . 10 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
46	44, 25, 45	syl2anc 573	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
47		dvcnvre.j	. . . . . . . . . . . . . . 15 ⊢ 𝐽 = (TopOpen‘ℂ_fld)
48	47	tgioo2 22826	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = (𝐽 ↾_t ℝ)
49	1, 48	eqtri 2793	. . . . . . . . . . . . 13 ⊢ 𝑇 = (𝐽 ↾_t ℝ)
50	49	oveq1i 6803	. . . . . . . . . . . 12 ⊢ (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
51	47	cnfldtop 22807	. . . . . . . . . . . . . 14 ⊢ 𝐽 ∈ Top
52	51	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐽 ∈ Top)
53	25, 38	sstrd 3762	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ ℝ)
54		reex 10229	. . . . . . . . . . . . . 14 ⊢ ℝ ∈ V
55	54	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ∈ V)
56		restabs 21190	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ ℝ ∧ ℝ ∈ V) → ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
57	52, 53, 55, 56	syl3anc 1476	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
58	50, 57	syl5eq 2817	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
59	38, 23	sseldd 3753	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℝ)
60	24	rpred 12075	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ ℝ)
61	59, 60	resubcld 10660	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 − 𝑅) ∈ ℝ)
62	59, 60	readdcld 10271	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 + 𝑅) ∈ ℝ)
63		eqid 2771	. . . . . . . . . . . . 13 ⊢ (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
64	1, 63	icccmp 22848	. . . . . . . . . . . 12 ⊢ (((𝐶 − 𝑅) ∈ ℝ ∧ (𝐶 + 𝑅) ∈ ℝ) → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
65	61, 62, 64	syl2anc 573	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
66	58, 65	eqeltrrd 2851	. . . . . . . . . 10 ⊢ (𝜑 → (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
67		f1of 6278	. . . . . . . . . . . 12 ⊢ ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
68	46, 67	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
69	12, 39	syl6ss 3764	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝐹 ⊆ ℂ)
70	14, 69	syl5ss 3763	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ)
71		rescncf 22920	. . . . . . . . . . . . 13 ⊢ (((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋 → (𝐹 ∈ (𝑋–cn→ℝ) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ)))
72	25, 9, 71	sylc 65	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ))
73		cncffvrn 22921	. . . . . . . . . . . 12 ⊢ (((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ ∧ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ)) → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ↔ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
74	70, 72, 73	syl2anc 573	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ↔ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
75	68, 74	mpbird 247	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
76		eqid 2771	. . . . . . . . . . 11 ⊢ (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
77	47, 76	cncfcnvcn 22944	. . . . . . . . . 10 ⊢ (((𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp ∧ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))) → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ↔ ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
78	66, 75, 77	syl2anc 573	. . . . . . . . 9 ⊢ (𝜑 → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ↔ ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
79	46, 78	mpbid 222	. . . . . . . 8 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
80	42, 79	sseldd 3753	. . . . . . 7 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
81		eqid 2771	. . . . . . . . 9 ⊢ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
82		dvcnvre.m	. . . . . . . . 9 ⊢ 𝑀 = (𝐽 ↾_t 𝑋)
83	47, 81, 82	cncfcn 22932	. . . . . . . 8 ⊢ (((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ ∧ 𝑋 ⊆ ℂ) → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
84	70, 40, 83	syl2anc 573	. . . . . . 7 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
85	80, 84	eleqtrd 2852	. . . . . 6 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
86	59, 24	ltsubrpd 12107	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶 − 𝑅) < 𝐶)
87	61, 59, 86	ltled 10387	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 − 𝑅) ≤ 𝐶)
88	59, 24	ltaddrpd 12108	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 < (𝐶 + 𝑅))
89	59, 62, 88	ltled 10387	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≤ (𝐶 + 𝑅))
90		elicc2 12443	. . . . . . . . . 10 ⊢ (((𝐶 − 𝑅) ∈ ℝ ∧ (𝐶 + 𝑅) ∈ ℝ) → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ↔ (𝐶 ∈ ℝ ∧ (𝐶 − 𝑅) ≤ 𝐶 ∧ 𝐶 ≤ (𝐶 + 𝑅))))
91	61, 62, 90	syl2anc 573	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ↔ (𝐶 ∈ ℝ ∧ (𝐶 − 𝑅) ≤ 𝐶 ∧ 𝐶 ≤ (𝐶 + 𝑅))))
92	59, 87, 89, 91	mpbir3and 1427	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
93		ffun 6188	. . . . . . . . . 10 ⊢ (𝐹:𝑋⟶ℝ → Fun 𝐹)
94	9, 10, 93	3syl 18	. . . . . . . . 9 ⊢ (𝜑 → Fun 𝐹)
95		fdm 6191	. . . . . . . . . . 11 ⊢ (𝐹:𝑋⟶ℝ → dom 𝐹 = 𝑋)
96	9, 10, 95	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐹 = 𝑋)
97	25, 96	sseqtr4d 3791	. . . . . . . . 9 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ dom 𝐹)
98		funfvima2 6636	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ dom 𝐹) → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
99	94, 97, 98	syl2anc 573	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
100	92, 99	mpd 15	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
101	47	cnfldtopon 22806	. . . . . . . . 9 ⊢ 𝐽 ∈ (TopOn‘ℂ)
102		resttopon 21186	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ) → (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
103	101, 70, 102	sylancr 575	. . . . . . . 8 ⊢ (𝜑 → (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
104		toponuni 20939	. . . . . . . 8 ⊢ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
105	103, 104	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
106	100, 105	eleqtrd 2852	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
107		eqid 2771	. . . . . . 7 ⊢ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
108	107	cncnpi 21303	. . . . . 6 ⊢ ((^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀) ∧ (𝐹‘𝐶) ∈ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))) → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
109	85, 106, 108	syl2anc 573	. . . . 5 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
110	36, 109	eqeltrrd 2851	. . . 4 ⊢ (𝜑 → (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
111		dvcnvre.n	. . . . . . . 8 ⊢ 𝑁 = (𝐽 ↾_t 𝑌)
112	111	oveq1i 6803	. . . . . . 7 ⊢ (𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
113		ssexg 4938	. . . . . . . . 9 ⊢ ((𝑌 ⊆ ℝ ∧ ℝ ∈ V) → 𝑌 ∈ V)
114	13, 54, 113	sylancl 574	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ V)
115		restabs 21190	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌 ∧ 𝑌 ∈ V) → ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
116	52, 15, 114, 115	syl3anc 1476	. . . . . . 7 ⊢ (𝜑 → ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
117	112, 116	syl5eq 2817	. . . . . 6 ⊢ (𝜑 → (𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
118	117	oveq1d 6808	. . . . 5 ⊢ (𝜑 → ((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀))
119	118	fveq1d 6334	. . . 4 ⊢ (𝜑 → (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)) = (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
120	110, 119	eleqtrrd 2853	. . 3 ⊢ (𝜑 → (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
121	13, 39	syl6ss 3764	. . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ ℂ)
122		resttopon 21186	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝑌 ⊆ ℂ) → (𝐽 ↾_t 𝑌) ∈ (TopOn‘𝑌))
123	101, 121, 122	sylancr 575	. . . . . 6 ⊢ (𝜑 → (𝐽 ↾_t 𝑌) ∈ (TopOn‘𝑌))
124	111, 123	syl5eqel 2854	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (TopOn‘𝑌))
125		topontop 20938	. . . . 5 ⊢ (𝑁 ∈ (TopOn‘𝑌) → 𝑁 ∈ Top)
126	124, 125	syl 17	. . . 4 ⊢ (𝜑 → 𝑁 ∈ Top)
127		toponuni 20939	. . . . . 6 ⊢ (𝑁 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝑁)
128	124, 127	syl 17	. . . . 5 ⊢ (𝜑 → 𝑌 = ∪ 𝑁)
129	15, 128	sseqtrd 3790	. . . 4 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ∪ 𝑁)
130	15, 13	sstrd 3762	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℝ)
131		difssd 3889	. . . . . . . . 9 ⊢ (𝜑 → (ℝ ∖ 𝑌) ⊆ ℝ)
132	130, 131	unssd 3940	. . . . . . . 8 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)) ⊆ ℝ)
133		ssun1 3927	. . . . . . . . 9 ⊢ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))
134	133	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)))
135	18	ntrss 21080	. . . . . . . 8 ⊢ ((𝑇 ∈ Top ∧ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)) ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
136	4, 132, 134, 135	syl3anc 1476	. . . . . . 7 ⊢ (𝜑 → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
137	136, 29	sseldd 3753	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
138		f1of 6278	. . . . . . . 8 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋⟶𝑌)
139	5, 138	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌)
140	139, 23	ffvelrnd 6503	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑌)
141	137, 140	elind 3949	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
142		eqid 2771	. . . . . . . 8 ⊢ (𝑇 ↾_t 𝑌) = (𝑇 ↾_t 𝑌)
143	18, 142	restntr 21207	. . . . . . 7 ⊢ ((𝑇 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌) → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
144	4, 13, 15, 143	syl3anc 1476	. . . . . 6 ⊢ (𝜑 → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
145		restabs 21190	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ ℝ ∈ V) → ((𝐽 ↾_t ℝ) ↾_t 𝑌) = (𝐽 ↾_t 𝑌))
146	52, 13, 55, 145	syl3anc 1476	. . . . . . . . 9 ⊢ (𝜑 → ((𝐽 ↾_t ℝ) ↾_t 𝑌) = (𝐽 ↾_t 𝑌))
147	49	oveq1i 6803	. . . . . . . . 9 ⊢ (𝑇 ↾_t 𝑌) = ((𝐽 ↾_t ℝ) ↾_t 𝑌)
148	146, 147, 111	3eqtr4g 2830	. . . . . . . 8 ⊢ (𝜑 → (𝑇 ↾_t 𝑌) = 𝑁)
149	148	fveq2d 6336	. . . . . . 7 ⊢ (𝜑 → (int‘(𝑇 ↾_t 𝑌)) = (int‘𝑁))
150	149	fveq1d 6334	. . . . . 6 ⊢ (𝜑 → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
151	144, 150	eqtr3d 2807	. . . . 5 ⊢ (𝜑 → (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌) = ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
152	141, 151	eleqtrd 2852	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
153	128	feq2d 6171	. . . . . 6 ⊢ (𝜑 → (^◡𝐹:𝑌⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶𝑋))
154	33, 153	mpbid 222	. . . . 5 ⊢ (𝜑 → ^◡𝐹:∪ 𝑁⟶𝑋)
155		resttopon 21186	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝑋 ⊆ ℂ) → (𝐽 ↾_t 𝑋) ∈ (TopOn‘𝑋))
156	101, 40, 155	sylancr 575	. . . . . . 7 ⊢ (𝜑 → (𝐽 ↾_t 𝑋) ∈ (TopOn‘𝑋))
157	82, 156	syl5eqel 2854	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (TopOn‘𝑋))
158		toponuni 20939	. . . . . 6 ⊢ (𝑀 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑀)
159		feq3 6168	. . . . . 6 ⊢ (𝑋 = ∪ 𝑀 → (^◡𝐹:∪ 𝑁⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶∪ 𝑀))
160	157, 158, 159	3syl 18	. . . . 5 ⊢ (𝜑 → (^◡𝐹:∪ 𝑁⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶∪ 𝑀))
161	154, 160	mpbid 222	. . . 4 ⊢ (𝜑 → ^◡𝐹:∪ 𝑁⟶∪ 𝑀)
162		eqid 2771	. . . . 5 ⊢ ∪ 𝑁 = ∪ 𝑁
163		eqid 2771	. . . . 5 ⊢ ∪ 𝑀 = ∪ 𝑀
164	162, 163	cnprest 21314	. . . 4 ⊢ (((𝑁 ∈ Top ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ∪ 𝑁) ∧ ((𝐹‘𝐶) ∈ ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∧ ^◡𝐹:∪ 𝑁⟶∪ 𝑀)) → (^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)) ↔ (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶))))
165	126, 129, 152, 161, 164	syl22anc 1477	. . 3 ⊢ (𝜑 → (^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)) ↔ (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶))))
166	120, 165	mpbird 247	. 2 ⊢ (𝜑 → ^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)))
167	30, 166	jca 501	1 ⊢ (𝜑 → ((𝐹‘𝐶) ∈ ((int‘𝑇)‘𝑌) ∧ ^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 382 ∧ w3a 1071 = wceq 1631 ∈ wcel 2145 Vcvv 3351 ∖ cdif 3720 ∪ cun 3721 ∩ cin 3722 ⊆ wss 3723 ∪ cuni 4574 class class class wbr 4786 ^◡ccnv 5248 dom cdm 5249 ran crn 5250 ↾ cres 5251 “ cima 5252 Fun wfun 6025 ⟶wf 6027 –1-1→wf1 6028 –onto→wfo 6029 –1-1-onto→wf1o 6030 ‘cfv 6031 (class class class)co 6793 ℂcc 10136 ℝcr 10137 0cc0 10138 + caddc 10141 ≤ cle 10277 − cmin 10468 ℝ⁺crp 12035 (,)cioo 12380 [,]cicc 12383 ↾_t crest 16289 TopOpenctopn 16290 topGenctg 16306 ℂ_fldccnfld 19961 Topctop 20918 TopOnctopon 20935 intcnt 21042 Cn ccn 21249 CnP ccnp 21250 Compccmp 21410 –cn→ccncf 22899 D cdv 23847

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pow 4974 ax-pr 5034 ax-un 7096 ax-inf2 8702 ax-cnex 10194 ax-resscn 10195 ax-1cn 10196 ax-icn 10197 ax-addcl 10198 ax-addrcl 10199 ax-mulcl 10200 ax-mulrcl 10201 ax-mulcom 10202 ax-addass 10203 ax-mulass 10204 ax-distr 10205 ax-i2m1 10206 ax-1ne0 10207 ax-1rid 10208 ax-rnegex 10209 ax-rrecex 10210 ax-cnre 10211 ax-pre-lttri 10212 ax-pre-lttrn 10213 ax-pre-ltadd 10214 ax-pre-mulgt0 10215 ax-pre-sup 10216 ax-addf 10217 ax-mulf 10218

This theorem depends on definitions: df-bi 197 df-an 383 df-or 835 df-3or 1072 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4226 df-pw 4299 df-sn 4317 df-pr 4319 df-tp 4321 df-op 4323 df-uni 4575 df-int 4612 df-iun 4656 df-iin 4657 df-br 4787 df-opab 4847 df-mpt 4864 df-tr 4887 df-id 5157 df-eprel 5162 df-po 5170 df-so 5171 df-fr 5208 df-se 5209 df-we 5210 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-pred 5823 df-ord 5869 df-on 5870 df-lim 5871 df-suc 5872 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-isom 6040 df-riota 6754 df-ov 6796 df-oprab 6797 df-mpt2 6798 df-of 7044 df-om 7213 df-1st 7315 df-2nd 7316 df-supp 7447 df-wrecs 7559 df-recs 7621 df-rdg 7659 df-1o 7713 df-2o 7714 df-oadd 7717 df-er 7896 df-map 8011 df-pm 8012 df-ixp 8063 df-en 8110 df-dom 8111 df-sdom 8112 df-fin 8113 df-fsupp 8432 df-fi 8473 df-sup 8504 df-inf 8505 df-oi 8571 df-card 8965 df-cda 9192 df-pnf 10278 df-mnf 10279 df-xr 10280 df-ltxr 10281 df-le 10282 df-sub 10470 df-neg 10471 df-div 10887 df-nn 11223 df-2 11281 df-3 11282 df-4 11283 df-5 11284 df-6 11285 df-7 11286 df-8 11287 df-9 11288 df-n0 11495 df-z 11580 df-dec 11696 df-uz 11889 df-q 11992 df-rp 12036 df-xneg 12151 df-xadd 12152 df-xmul 12153 df-ioo 12384 df-ico 12386 df-icc 12387 df-fz 12534 df-fzo 12674 df-seq 13009 df-exp 13068 df-hash 13322 df-cj 14047 df-re 14048 df-im 14049 df-sqrt 14183 df-abs 14184 df-struct 16066 df-ndx 16067 df-slot 16068 df-base 16070 df-sets 16071 df-ress 16072 df-plusg 16162 df-mulr 16163 df-starv 16164 df-sca 16165 df-vsca 16166 df-ip 16167 df-tset 16168 df-ple 16169 df-ds 16172 df-unif 16173 df-hom 16174 df-cco 16175 df-rest 16291 df-topn 16292 df-0g 16310 df-gsum 16311 df-topgen 16312 df-pt 16313 df-prds 16316 df-xrs 16370 df-qtop 16375 df-imas 16376 df-xps 16378 df-mre 16454 df-mrc 16455 df-acs 16457 df-mgm 17450 df-sgrp 17492 df-mnd 17503 df-submnd 17544 df-mulg 17749 df-cntz 17957 df-cmn 18402 df-psmet 19953 df-xmet 19954 df-met 19955 df-bl 19956 df-mopn 19957 df-fbas 19958 df-fg 19959 df-cnfld 19962 df-top 20919 df-topon 20936 df-topsp 20958 df-bases 20971 df-cld 21044 df-ntr 21045 df-cls 21046 df-nei 21123 df-lp 21161 df-perf 21162 df-cn 21252 df-cnp 21253 df-haus 21340 df-cmp 21411 df-tx 21586 df-hmeo 21779 df-fil 21870 df-fm 21962 df-flim 21963 df-flf 21964 df-xms 22345 df-ms 22346 df-tms 22347 df-cncf 22901 df-limc 23850 df-dv 23851

This theorem is referenced by: dvcnvre 24002

W3C validator