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 23585

Description: Lemma for dvcnvre 23586. (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 22375	. . . . . 6 ⊢ (topGen‘ran (,)) ∈ Top
3	1, 2	eqeltri 2684	. . . . 5 ⊢ 𝑇 ∈ Top
4	3	a1i 11	. . . 4 ⊢ (𝜑 → 𝑇 ∈ Top)
5		dvcnvre.1	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑋–1-1-onto→𝑌)
6		f1ofo 6057	. . . . . 6 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋–onto→𝑌)
7		forn 6031	. . . . . 6 ⊢ (𝐹:𝑋–onto→𝑌 → ran 𝐹 = 𝑌)
8	5, 6, 7	3syl 18	. . . . 5 ⊢ (𝜑 → ran 𝐹 = 𝑌)
9		dvcnvre.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝑋–cn→ℝ))
10		cncff 22504	. . . . . 6 ⊢ (𝐹 ∈ (𝑋–cn→ℝ) → 𝐹:𝑋⟶ℝ)
11		frn 5966	. . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → ran 𝐹 ⊆ ℝ)
12	9, 10, 11	3syl 18	. . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
13	8, 12	eqsstr3d 3603	. . . 4 ⊢ (𝜑 → 𝑌 ⊆ ℝ)
14		imassrn 5396	. . . . 5 ⊢ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ran 𝐹
15	14, 8	syl5sseq 3616	. . . 4 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌)
16		uniretop 22376	. . . . . 6 ⊢ ℝ = ∪ (topGen‘ran (,))
17	1	unieqi 4381	. . . . . 6 ⊢ ∪ 𝑇 = ∪ (topGen‘ran (,))
18	16, 17	eqtr4i 2635	. . . . 5 ⊢ ℝ = ∪ 𝑇
19	18	ntrss 20669	. . . 4 ⊢ ((𝑇 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌) → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘𝑌))
20	4, 13, 15, 19	syl3anc 1318	. . 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 23584	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘(topGen‘ran (,)))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
27	1	fveq2i 6106	. . . . 5 ⊢ (int‘𝑇) = (int‘(topGen‘ran (,)))
28	27	fveq1i 6104	. . . 4 ⊢ ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((int‘(topGen‘ran (,)))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
29	26, 28	syl6eleqr 2699	. . 3 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
30	20, 29	sseldd 3569	. 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘𝑌))
31		f1ocnv 6062	. . . . . . 7 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → ^◡𝐹:𝑌–1-1-onto→𝑋)
32		f1of 6050	. . . . . . 7 ⊢ (^◡𝐹:𝑌–1-1-onto→𝑋 → ^◡𝐹:𝑌⟶𝑋)
33	5, 31, 32	3syl 18	. . . . . 6 ⊢ (𝜑 → ^◡𝐹:𝑌⟶𝑋)
34		ffun 5961	. . . . . 6 ⊢ (^◡𝐹:𝑌⟶𝑋 → Fun ^◡𝐹)
35		funcnvres 5881	. . . . . 6 ⊢ (Fun ^◡𝐹 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
36	33, 34, 35	3syl 18	. . . . 5 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
37		dvbsss 23472	. . . . . . . . . . 11 ⊢ dom (ℝ D 𝐹) ⊆ ℝ
38	21, 37	syl6eqssr 3619	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ⊆ ℝ)
39		ax-resscn 9872	. . . . . . . . . 10 ⊢ ℝ ⊆ ℂ
40	38, 39	syl6ss 3580	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
41		cncfss 22510	. . . . . . . . 9 ⊢ ((((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋 ∧ 𝑋 ⊆ ℂ) → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
42	25, 40, 41	syl2anc 691	. . . . . . . 8 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
43		f1of1 6049	. . . . . . . . . . 11 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋–1-1→𝑌)
44	5, 43	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑋–1-1→𝑌)
45		f1ores 6064	. . . . . . . . . 10 ⊢ ((𝐹:𝑋–1-1→𝑌 ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
46	44, 25, 45	syl2anc 691	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
47		dvcnvre.j	. . . . . . . . . . . . . . 15 ⊢ 𝐽 = (TopOpen‘ℂ_fld)
48	47	tgioo2 22414	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = (𝐽 ↾_t ℝ)
49	1, 48	eqtri 2632	. . . . . . . . . . . . 13 ⊢ 𝑇 = (𝐽 ↾_t ℝ)
50	49	oveq1i 6559	. . . . . . . . . . . 12 ⊢ (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
51	47	cnfldtop 22397	. . . . . . . . . . . . . 14 ⊢ 𝐽 ∈ Top
52	51	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐽 ∈ Top)
53	25, 38	sstrd 3578	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ ℝ)
54		reex 9906	. . . . . . . . . . . . . 14 ⊢ ℝ ∈ V
55	54	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ∈ V)
56		restabs 20779	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ ℝ ∧ ℝ ∈ V) → ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
57	52, 53, 55, 56	syl3anc 1318	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
58	50, 57	syl5eq 2656	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
59	38, 23	sseldd 3569	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℝ)
60	24	rpred 11748	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ ℝ)
61	59, 60	resubcld 10337	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 − 𝑅) ∈ ℝ)
62	59, 60	readdcld 9948	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 + 𝑅) ∈ ℝ)
63		eqid 2610	. . . . . . . . . . . . 13 ⊢ (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
64	1, 63	icccmp 22436	. . . . . . . . . . . 12 ⊢ (((𝐶 − 𝑅) ∈ ℝ ∧ (𝐶 + 𝑅) ∈ ℝ) → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
65	61, 62, 64	syl2anc 691	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
66	58, 65	eqeltrrd 2689	. . . . . . . . . 10 ⊢ (𝜑 → (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
67		f1of 6050	. . . . . . . . . . . 12 ⊢ ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
68	46, 67	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
69	12, 39	syl6ss 3580	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝐹 ⊆ ℂ)
70	14, 69	syl5ss 3579	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ)
71		rescncf 22508	. . . . . . . . . . . . 13 ⊢ (((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋 → (𝐹 ∈ (𝑋–cn→ℝ) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ)))
72	25, 9, 71	sylc 63	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ))
73		cncffvrn 22509	. . . . . . . . . . . 12 ⊢ (((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ ∧ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ)) → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ↔ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
74	70, 72, 73	syl2anc 691	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ↔ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
75	68, 74	mpbird 246	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
76		eqid 2610	. . . . . . . . . . 11 ⊢ (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
77	47, 76	cncfcnvcn 22532	. . . . . . . . . 10 ⊢ (((𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp ∧ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))) → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ↔ ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
78	66, 75, 77	syl2anc 691	. . . . . . . . 9 ⊢ (𝜑 → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))–1-1-onto→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ↔ ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
79	46, 78	mpbid 221	. . . . . . . 8 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
80	42, 79	sseldd 3569	. . . . . . 7 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
81		eqid 2610	. . . . . . . . 9 ⊢ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
82		dvcnvre.m	. . . . . . . . 9 ⊢ 𝑀 = (𝐽 ↾_t 𝑋)
83	47, 81, 82	cncfcn 22520	. . . . . . . 8 ⊢ (((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ ∧ 𝑋 ⊆ ℂ) → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
84	70, 40, 83	syl2anc 691	. . . . . . 7 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
85	80, 84	eleqtrd 2690	. . . . . 6 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
86	59, 24	ltsubrpd 11780	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶 − 𝑅) < 𝐶)
87	61, 59, 86	ltled 10064	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 − 𝑅) ≤ 𝐶)
88	59, 24	ltaddrpd 11781	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 < (𝐶 + 𝑅))
89	59, 62, 88	ltled 10064	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≤ (𝐶 + 𝑅))
90		elicc2 12109	. . . . . . . . . 10 ⊢ (((𝐶 − 𝑅) ∈ ℝ ∧ (𝐶 + 𝑅) ∈ ℝ) → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ↔ (𝐶 ∈ ℝ ∧ (𝐶 − 𝑅) ≤ 𝐶 ∧ 𝐶 ≤ (𝐶 + 𝑅))))
91	61, 62, 90	syl2anc 691	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ↔ (𝐶 ∈ ℝ ∧ (𝐶 − 𝑅) ≤ 𝐶 ∧ 𝐶 ≤ (𝐶 + 𝑅))))
92	59, 87, 89, 91	mpbir3and 1238	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
93		ffun 5961	. . . . . . . . . 10 ⊢ (𝐹:𝑋⟶ℝ → Fun 𝐹)
94	9, 10, 93	3syl 18	. . . . . . . . 9 ⊢ (𝜑 → Fun 𝐹)
95		fdm 5964	. . . . . . . . . . 11 ⊢ (𝐹:𝑋⟶ℝ → dom 𝐹 = 𝑋)
96	9, 10, 95	3syl 18	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐹 = 𝑋)
97	25, 96	sseqtr4d 3605	. . . . . . . . 9 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ dom 𝐹)
98		funfvima2 6397	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ dom 𝐹) → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
99	94, 97, 98	syl2anc 691	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
100	92, 99	mpd 15	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
101	47	cnfldtopon 22396	. . . . . . . . 9 ⊢ 𝐽 ∈ (TopOn‘ℂ)
102		resttopon 20775	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ) → (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
103	101, 70, 102	sylancr 694	. . . . . . . 8 ⊢ (𝜑 → (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
104		toponuni 20542	. . . . . . . 8 ⊢ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
105	103, 104	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
106	100, 105	eleqtrd 2690	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
107		eqid 2610	. . . . . . 7 ⊢ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
108	107	cncnpi 20892	. . . . . 6 ⊢ ((^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀) ∧ (𝐹‘𝐶) ∈ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))) → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
109	85, 106, 108	syl2anc 691	. . . . 5 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
110	36, 109	eqeltrrd 2689	. . . 4 ⊢ (𝜑 → (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
111		dvcnvre.n	. . . . . . . 8 ⊢ 𝑁 = (𝐽 ↾_t 𝑌)
112	111	oveq1i 6559	. . . . . . 7 ⊢ (𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
113		ssexg 4732	. . . . . . . . 9 ⊢ ((𝑌 ⊆ ℝ ∧ ℝ ∈ V) → 𝑌 ∈ V)
114	13, 54, 113	sylancl 693	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ V)
115		restabs 20779	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌 ∧ 𝑌 ∈ V) → ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
116	52, 15, 114, 115	syl3anc 1318	. . . . . . 7 ⊢ (𝜑 → ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
117	112, 116	syl5eq 2656	. . . . . 6 ⊢ (𝜑 → (𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
118	117	oveq1d 6564	. . . . 5 ⊢ (𝜑 → ((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀))
119	118	fveq1d 6105	. . . 4 ⊢ (𝜑 → (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)) = (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
120	110, 119	eleqtrrd 2691	. . 3 ⊢ (𝜑 → (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
121	13, 39	syl6ss 3580	. . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ ℂ)
122		resttopon 20775	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝑌 ⊆ ℂ) → (𝐽 ↾_t 𝑌) ∈ (TopOn‘𝑌))
123	101, 121, 122	sylancr 694	. . . . . 6 ⊢ (𝜑 → (𝐽 ↾_t 𝑌) ∈ (TopOn‘𝑌))
124	111, 123	syl5eqel 2692	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (TopOn‘𝑌))
125		topontop 20541	. . . . 5 ⊢ (𝑁 ∈ (TopOn‘𝑌) → 𝑁 ∈ Top)
126	124, 125	syl 17	. . . 4 ⊢ (𝜑 → 𝑁 ∈ Top)
127		toponuni 20542	. . . . . 6 ⊢ (𝑁 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝑁)
128	124, 127	syl 17	. . . . 5 ⊢ (𝜑 → 𝑌 = ∪ 𝑁)
129	15, 128	sseqtrd 3604	. . . 4 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ∪ 𝑁)
130	15, 13	sstrd 3578	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℝ)
131		difssd 3700	. . . . . . . . 9 ⊢ (𝜑 → (ℝ ∖ 𝑌) ⊆ ℝ)
132	130, 131	unssd 3751	. . . . . . . 8 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)) ⊆ ℝ)
133		ssun1 3738	. . . . . . . . 9 ⊢ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))
134	133	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)))
135	18	ntrss 20669	. . . . . . . 8 ⊢ ((𝑇 ∈ Top ∧ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)) ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
136	4, 132, 134, 135	syl3anc 1318	. . . . . . 7 ⊢ (𝜑 → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
137	136, 29	sseldd 3569	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
138		f1of 6050	. . . . . . . 8 ⊢ (𝐹:𝑋–1-1-onto→𝑌 → 𝐹:𝑋⟶𝑌)
139	5, 138	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌)
140	139, 23	ffvelrnd 6268	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑌)
141	137, 140	elind 3760	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
142		eqid 2610	. . . . . . . 8 ⊢ (𝑇 ↾_t 𝑌) = (𝑇 ↾_t 𝑌)
143	18, 142	restntr 20796	. . . . . . 7 ⊢ ((𝑇 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌) → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
144	4, 13, 15, 143	syl3anc 1318	. . . . . 6 ⊢ (𝜑 → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
145		restabs 20779	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ ℝ ∈ V) → ((𝐽 ↾_t ℝ) ↾_t 𝑌) = (𝐽 ↾_t 𝑌))
146	52, 13, 55, 145	syl3anc 1318	. . . . . . . . 9 ⊢ (𝜑 → ((𝐽 ↾_t ℝ) ↾_t 𝑌) = (𝐽 ↾_t 𝑌))
147	49	oveq1i 6559	. . . . . . . . 9 ⊢ (𝑇 ↾_t 𝑌) = ((𝐽 ↾_t ℝ) ↾_t 𝑌)
148	146, 147, 111	3eqtr4g 2669	. . . . . . . 8 ⊢ (𝜑 → (𝑇 ↾_t 𝑌) = 𝑁)
149	148	fveq2d 6107	. . . . . . 7 ⊢ (𝜑 → (int‘(𝑇 ↾_t 𝑌)) = (int‘𝑁))
150	149	fveq1d 6105	. . . . . 6 ⊢ (𝜑 → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
151	144, 150	eqtr3d 2646	. . . . 5 ⊢ (𝜑 → (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌) = ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
152	141, 151	eleqtrd 2690	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
153	128	feq2d 5944	. . . . . 6 ⊢ (𝜑 → (^◡𝐹:𝑌⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶𝑋))
154	33, 153	mpbid 221	. . . . 5 ⊢ (𝜑 → ^◡𝐹:∪ 𝑁⟶𝑋)
155		resttopon 20775	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝑋 ⊆ ℂ) → (𝐽 ↾_t 𝑋) ∈ (TopOn‘𝑋))
156	101, 40, 155	sylancr 694	. . . . . . 7 ⊢ (𝜑 → (𝐽 ↾_t 𝑋) ∈ (TopOn‘𝑋))
157	82, 156	syl5eqel 2692	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (TopOn‘𝑋))
158		toponuni 20542	. . . . . 6 ⊢ (𝑀 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑀)
159		feq3 5941	. . . . . 6 ⊢ (𝑋 = ∪ 𝑀 → (^◡𝐹:∪ 𝑁⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶∪ 𝑀))
160	157, 158, 159	3syl 18	. . . . 5 ⊢ (𝜑 → (^◡𝐹:∪ 𝑁⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶∪ 𝑀))
161	154, 160	mpbid 221	. . . 4 ⊢ (𝜑 → ^◡𝐹:∪ 𝑁⟶∪ 𝑀)
162		eqid 2610	. . . . 5 ⊢ ∪ 𝑁 = ∪ 𝑁
163		eqid 2610	. . . . 5 ⊢ ∪ 𝑀 = ∪ 𝑀
164	162, 163	cnprest 20903	. . . 4 ⊢ (((𝑁 ∈ Top ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ∪ 𝑁) ∧ ((𝐹‘𝐶) ∈ ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∧ ^◡𝐹:∪ 𝑁⟶∪ 𝑀)) → (^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)) ↔ (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶))))
165	126, 129, 152, 161, 164	syl22anc 1319	. . 3 ⊢ (𝜑 → (^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)) ↔ (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶))))
166	120, 165	mpbird 246	. 2 ⊢ (𝜑 → ^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)))
167	30, 166	jca 553	1 ⊢ (𝜑 → ((𝐹‘𝐶) ∈ ((int‘𝑇)‘𝑌) ∧ ^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ∖ cdif 3537 ∪ cun 3538 ∩ cin 3539 ⊆ wss 3540 ∪ cuni 4372 class class class wbr 4583 ^◡ccnv 5037 dom cdm 5038 ran crn 5039 ↾ cres 5040 “ cima 5041 Fun wfun 5798 ⟶wf 5800 –1-1→wf1 5801 –onto→wfo 5802 –1-1-onto→wf1o 5803 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 + caddc 9818 ≤ cle 9954 − cmin 10145 ℝ⁺crp 11708 (,)cioo 12046 [,]cicc 12049 ↾_t crest 15904 TopOpenctopn 15905 topGenctg 15921 ℂ_fldccnfld 19567 Topctop 20517 TopOnctopon 20518 intcnt 20631 Cn ccn 20838 CnP ccnp 20839 Compccmp 20999 –cn→ccncf 22487 D cdv 23433

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 ax-addf 9894 ax-mulf 9895

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-iin 4458 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-om 6958 df-1st 7059 df-2nd 7060 df-supp 7183 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-er 7629 df-map 7746 df-pm 7747 df-ixp 7795 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-fsupp 8159 df-fi 8200 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-dec 11370 df-uz 11564 df-q 11665 df-rp 11709 df-xneg 11822 df-xadd 11823 df-xmul 11824 df-ioo 12050 df-ico 12052 df-icc 12053 df-fz 12198 df-fzo 12335 df-seq 12664 df-exp 12723 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-mulr 15782 df-starv 15783 df-sca 15784 df-vsca 15785 df-ip 15786 df-tset 15787 df-ple 15788 df-ds 15791 df-unif 15792 df-hom 15793 df-cco 15794 df-rest 15906 df-topn 15907 df-0g 15925 df-gsum 15926 df-topgen 15927 df-pt 15928 df-prds 15931 df-xrs 15985 df-qtop 15990 df-imas 15991 df-xps 15993 df-mre 16069 df-mrc 16070 df-acs 16072 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-submnd 17159 df-mulg 17364 df-cntz 17573 df-cmn 18018 df-psmet 19559 df-xmet 19560 df-met 19561 df-bl 19562 df-mopn 19563 df-fbas 19564 df-fg 19565 df-cnfld 19568 df-top 20521 df-bases 20522 df-topon 20523 df-topsp 20524 df-cld 20633 df-ntr 20634 df-cls 20635 df-nei 20712 df-lp 20750 df-perf 20751 df-cn 20841 df-cnp 20842 df-haus 20929 df-cmp 21000 df-tx 21175 df-hmeo 21368 df-fil 21460 df-fm 21552 df-flim 21553 df-flf 21554 df-xms 21935 df-ms 21936 df-tms 21937 df-cncf 22489 df-limc 23436 df-dv 23437

This theorem is referenced by: dvcnvre 23586

W3C validator