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 26393

Description: Lemma for dvcnvre 26394. (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-1onto𝑌)
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	. . . . 5 ⊢ 𝑇 = (topGen‘ran (,))
2		retop 25135	. . . . 5 ⊢ (topGen‘ran (,)) ∈ Top
3	1, 2	eqeltri 2860	. . . 4 ⊢ 𝑇 ∈ Top
4		dvcnvre.1	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑋⟶1-1onto𝑌)
5		f1ofo 6862	. . . . . 6 ⊢ (𝐹:𝑋⟶1-1onto𝑌 → 𝐹:𝑋⟶onto𝑌)
6		forn 6829	. . . . . 6 ⊢ (𝐹:𝑋⟶onto𝑌 → ran 𝐹 = 𝑌)
7	4, 5, 6	3syl 19	. . . . 5 ⊢ (𝜑 → ran 𝐹 = 𝑌)
8		dvcnvre.f	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝑋–cn→ℝ))
9		cncff 25269	. . . . . 6 ⊢ (𝐹 ∈ (𝑋–cn→ℝ) → 𝐹:𝑋⟶ℝ)
10		frn 6747	. . . . . 6 ⊢ (𝐹:𝑋⟶ℝ → ran 𝐹 ⊆ ℝ)
11	8, 9, 10	3syl 19	. . . . 5 ⊢ (𝜑 → ran 𝐹 ⊆ ℝ)
12	7, 11	eqsstrrd 3948	. . . 4 ⊢ (𝜑 → 𝑌 ⊆ ℝ)
13		imassrn 6216	. . . . 5 ⊢ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ran 𝐹
14	13, 7	sseqtrid 3955	. . . 4 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌)
15		uniretop 25136	. . . . . 6 ⊢ ℝ = ∪ (topGen‘ran (,))
16	1	unieqi 4884	. . . . . 6 ⊢ ∪ 𝑇 = ∪ (topGen‘ran (,))
17	15, 16	eqtr4i 2789	. . . . 5 ⊢ ℝ = ∪ 𝑇
18	17	ntrss 23428	. . . 4 ⊢ ((𝑇 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌) → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘𝑌))
19	3, 12, 14, 18	mp3an2i 1496	. . 3 ⊢ (𝜑 → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘𝑌))
20		dvcnvre.d	. . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐹) = 𝑋)
21		dvcnvre.z	. . . . 5 ⊢ (𝜑 → ¬ 0 ∈ ran (ℝ D 𝐹))
22		dvcnvre.c	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
23		dvcnvre.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ ℝ⁺)
24		dvcnvre.s	. . . . 5 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋)
25	8, 20, 21, 4, 22, 23, 24	dvcnvrelem1 26392	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘(topGen‘ran (,)))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
26	1	fveq2i 6919	. . . . 5 ⊢ (int‘𝑇) = (int‘(topGen‘ran (,)))
27	26	fveq1i 6917	. . . 4 ⊢ ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((int‘(topGen‘ran (,)))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
28	25, 27	eleqtrrdi 2875	. . 3 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
29	19, 28	sseldd 3914	. 2 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘𝑌))
30		f1ocnv 6867	. . . . . . 7 ⊢ (𝐹:𝑋⟶1-1onto𝑌 → ^◡𝐹:𝑌⟶1-1onto𝑋)
31		f1of 6854	. . . . . . 7 ⊢ (^◡𝐹:𝑌⟶1-1onto𝑋 → ^◡𝐹:𝑌⟶𝑋)
32	4, 30, 31	3syl 19	. . . . . 6 ⊢ (𝜑 → ^◡𝐹:𝑌⟶𝑋)
33		ffun 6742	. . . . . 6 ⊢ (^◡𝐹:𝑌⟶𝑋 → Fun ^◡𝐹)
34		funcnvres 6648	. . . . . 6 ⊢ (Fun ^◡𝐹 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
35	32, 33, 34	3syl 19	. . . . 5 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
36		dvbsss 26277	. . . . . . . . . . 11 ⊢ dom (ℝ D 𝐹) ⊆ ℝ
37	20, 36	eqsstrrdi 3958	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ⊆ ℝ)
38		ax-resscn 11296	. . . . . . . . . 10 ⊢ ℝ ⊆ ℂ
39	37, 38	sstrdi 3925	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
40		cncfss 25275	. . . . . . . . 9 ⊢ ((((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋 ∧ 𝑋 ⊆ ℂ) → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
41	24, 39, 40	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
42		f1of1 6853	. . . . . . . . . . 11 ⊢ (𝐹:𝑋⟶1-1onto𝑌 → 𝐹:𝑋⟶1-1𝑌)
43	4, 42	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑋⟶1-1𝑌)
44		f1ores 6869	. . . . . . . . . 10 ⊢ ((𝐹:𝑋⟶1-1𝑌 ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶1-1onto(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
45	43, 24, 44	syl2anc 596	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶1-1onto(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
46		dvcnvre.j	. . . . . . . . . . . . . . 15 ⊢ 𝐽 = (TopOpen‘ℂ_fld)
47	46	tgioo2 25177	. . . . . . . . . . . . . 14 ⊢ (topGen‘ran (,)) = (𝐽 ↾_t ℝ)
48	1, 47	eqtri 2786	. . . . . . . . . . . . 13 ⊢ 𝑇 = (𝐽 ↾_t ℝ)
49	48	oveq1i 7461	. . . . . . . . . . . 12 ⊢ (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
50	46	cnfldtop 25157	. . . . . . . . . . . . 13 ⊢ 𝐽 ∈ Top
51	24, 37	sstrd 3923	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ ℝ)
52		reex 11330	. . . . . . . . . . . . . 14 ⊢ ℝ ∈ V
53	52	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → ℝ ∈ V)
54		restabs 23538	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ ℝ ∧ ℝ ∈ V) → ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
55	50, 51, 53, 54	mp3an2i 1496	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐽 ↾_t ℝ) ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
56	49, 55	eqtrid 2810	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
57	37, 22	sseldd 3914	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐶 ∈ ℝ)
58	23	rpred 13204	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ ℝ)
59	57, 58	resubcld 11783	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 − 𝑅) ∈ ℝ)
60	57, 58	readdcld 11377	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 + 𝑅) ∈ ℝ)
61		eqid 2763	. . . . . . . . . . . . 13 ⊢ (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
62	1, 61	icccmp 25200	. . . . . . . . . . . 12 ⊢ (((𝐶 − 𝑅) ∈ ℝ ∧ (𝐶 + 𝑅) ∈ ℝ) → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
63	59, 60, 62	syl2anc 596	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑇 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
64	56, 63	eqeltrrd 2865	. . . . . . . . . 10 ⊢ (𝜑 → (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp)
65		f1of 6854	. . . . . . . . . . . 12 ⊢ ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶1-1onto(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
66	45, 65	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
67	11, 38	sstrdi 3925	. . . . . . . . . . . . 13 ⊢ (𝜑 → ran 𝐹 ⊆ ℂ)
68	13, 67	sstrid 3924	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ)
69		rescncf 25273	. . . . . . . . . . . . 13 ⊢ (((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ 𝑋 → (𝐹 ∈ (𝑋–cn→ℝ) → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ)))
70	24, 8, 69	sylc 66	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ))
71		cncfcdm 25274	. . . . . . . . . . . 12 ⊢ (((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ ∧ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→ℝ)) → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ↔ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
72	68, 70, 71	syl2anc 596	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ↔ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
73	66, 72	mpbird 260	. . . . . . . . . 10 ⊢ (𝜑 → (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
74		eqid 2763	. . . . . . . . . . 11 ⊢ (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = (𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
75	46, 74	cncfcnvcn 25301	. . . . . . . . . 10 ⊢ (((𝐽 ↾_t ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ Comp ∧ (𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐶 − 𝑅)[,](𝐶 + 𝑅))–cn→(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))) → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶1-1onto(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ↔ ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
76	64, 73, 75	syl2anc 596	. . . . . . . . 9 ⊢ (𝜑 → ((𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))):((𝐶 − 𝑅)[,](𝐶 + 𝑅))⟶1-1onto(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ↔ ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
77	45, 76	mpbid 235	. . . . . . . 8 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
78	41, 77	sseldd 3914	. . . . . . 7 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋))
79		eqid 2763	. . . . . . . . 9 ⊢ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
80		dvcnvre.m	. . . . . . . . 9 ⊢ 𝑀 = (𝐽 ↾_t 𝑋)
81	46, 79, 80	cncfcn 25286	. . . . . . . 8 ⊢ (((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ ∧ 𝑋 ⊆ ℂ) → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
82	68, 39, 81	syl2anc 596	. . . . . . 7 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))–cn→𝑋) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
83	78, 82	eleqtrd 2866	. . . . . 6 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀))
84	57, 23	ltsubrpd 13236	. . . . . . . . . 10 ⊢ (𝜑 → (𝐶 − 𝑅) < 𝐶)
85	59, 57, 84	ltled 11497	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 − 𝑅) ≤ 𝐶)
86	57, 23	ltaddrpd 13237	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶 < (𝐶 + 𝑅))
87	57, 60, 86	ltled 11497	. . . . . . . . 9 ⊢ (𝜑 → 𝐶 ≤ (𝐶 + 𝑅))
88		elicc2 13582	. . . . . . . . . 10 ⊢ (((𝐶 − 𝑅) ∈ ℝ ∧ (𝐶 + 𝑅) ∈ ℝ) → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ↔ (𝐶 ∈ ℝ ∧ (𝐶 − 𝑅) ≤ 𝐶 ∧ 𝐶 ≤ (𝐶 + 𝑅))))
89	59, 60, 88	syl2anc 596	. . . . . . . . 9 ⊢ (𝜑 → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ↔ (𝐶 ∈ ℝ ∧ (𝐶 − 𝑅) ≤ 𝐶 ∧ 𝐶 ≤ (𝐶 + 𝑅))))
90	57, 85, 87, 89	mpbir3and 1361	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))
91		ffun 6742	. . . . . . . . . 10 ⊢ (𝐹:𝑋⟶ℝ → Fun 𝐹)
92	8, 9, 91	3syl 19	. . . . . . . . 9 ⊢ (𝜑 → Fun 𝐹)
93		fdm 6749	. . . . . . . . . . 11 ⊢ (𝐹:𝑋⟶ℝ → dom 𝐹 = 𝑋)
94	8, 9, 93	3syl 19	. . . . . . . . . 10 ⊢ (𝜑 → dom 𝐹 = 𝑋)
95	24, 94	sseqtrrd 3950	. . . . . . . . 9 ⊢ (𝜑 → ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ dom 𝐹)
96		funfvima2 7268	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) ⊆ dom 𝐹) → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
97	92, 95, 96	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)) → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
98	90, 97	mpd 16	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
99	46	cnfldtopon 25156	. . . . . . . . 9 ⊢ 𝐽 ∈ (TopOn‘ℂ)
100		resttopon 23534	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℂ) → (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
101	99, 68, 100	sylancr 599	. . . . . . . 8 ⊢ (𝜑 → (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
102		toponuni 23287	. . . . . . . 8 ⊢ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (TopOn‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
103	101, 102	syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
104	98, 103	eleqtrd 2866	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
105		eqid 2763	. . . . . . 7 ⊢ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
106	105	cncnpi 23651	. . . . . 6 ⊢ ((^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) Cn 𝑀) ∧ (𝐹‘𝐶) ∈ ∪ (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))) → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
107	83, 104, 106	syl2anc 596	. . . . 5 ⊢ (𝜑 → ^◡(𝐹 ↾ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
108	35, 107	eqeltrrd 2865	. . . 4 ⊢ (𝜑 → (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
109		dvcnvre.n	. . . . . . . 8 ⊢ 𝑁 = (𝐽 ↾_t 𝑌)
110	109	oveq1i 7461	. . . . . . 7 ⊢ (𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))))
111		ssexg 5288	. . . . . . . . 9 ⊢ ((𝑌 ⊆ ℝ ∧ ℝ ∈ V) → 𝑌 ∈ V)
112	12, 52, 111	sylancl 598	. . . . . . . 8 ⊢ (𝜑 → 𝑌 ∈ V)
113		restabs 23538	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌 ∧ 𝑌 ∈ V) → ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
114	50, 14, 112, 113	mp3an2i 1496	. . . . . . 7 ⊢ (𝜑 → ((𝐽 ↾_t 𝑌) ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
115	110, 114	eqtrid 2810	. . . . . 6 ⊢ (𝜑 → (𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
116	115	oveq1d 7466	. . . . 5 ⊢ (𝜑 → ((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀) = ((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀))
117	116	fveq1d 6918	. . . 4 ⊢ (𝜑 → (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)) = (((𝐽 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
118	108, 117	eleqtrrd 2867	. . 3 ⊢ (𝜑 → (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶)))
119	12, 38	sstrdi 3925	. . . . . . 7 ⊢ (𝜑 → 𝑌 ⊆ ℂ)
120		resttopon 23534	. . . . . . 7 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝑌 ⊆ ℂ) → (𝐽 ↾_t 𝑌) ∈ (TopOn‘𝑌))
121	99, 119, 120	sylancr 599	. . . . . 6 ⊢ (𝜑 → (𝐽 ↾_t 𝑌) ∈ (TopOn‘𝑌))
122	109, 121	eqeltrid 2868	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (TopOn‘𝑌))
123		topontop 23286	. . . . 5 ⊢ (𝑁 ∈ (TopOn‘𝑌) → 𝑁 ∈ Top)
124	122, 123	syl 18	. . . 4 ⊢ (𝜑 → 𝑁 ∈ Top)
125		toponuni 23287	. . . . . 6 ⊢ (𝑁 ∈ (TopOn‘𝑌) → 𝑌 = ∪ 𝑁)
126	122, 125	syl 18	. . . . 5 ⊢ (𝜑 → 𝑌 = ∪ 𝑁)
127	14, 126	sseqtrd 3949	. . . 4 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ∪ 𝑁)
128	14, 12	sstrd 3923	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ℝ)
129		difssd 4076	. . . . . . . . 9 ⊢ (𝜑 → (ℝ ∖ 𝑌) ⊆ ℝ)
130	128, 129	unssd 4193	. . . . . . . 8 ⊢ (𝜑 → ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)) ⊆ ℝ)
131		ssun1 4179	. . . . . . . . 9 ⊢ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))
132	131	a1i 11	. . . . . . . 8 ⊢ (𝜑 → (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)))
133	17	ntrss 23428	. . . . . . . 8 ⊢ ((𝑇 ∈ Top ∧ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌)) ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
134	3, 130, 132, 133	mp3an2i 1496	. . . . . . 7 ⊢ (𝜑 → ((int‘𝑇)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ⊆ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
135	134, 28	sseldd 3914	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))))
136		f1of 6854	. . . . . . . 8 ⊢ (𝐹:𝑋⟶1-1onto𝑌 → 𝐹:𝑋⟶𝑌)
137	4, 136	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝑋⟶𝑌)
138	137, 22	ffvelcdmd 7117	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐶) ∈ 𝑌)
139	135, 138	elind 4100	. . . . 5 ⊢ (𝜑 → (𝐹‘𝐶) ∈ (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
140		eqid 2763	. . . . . . . 8 ⊢ (𝑇 ↾_t 𝑌) = (𝑇 ↾_t 𝑌)
141	17, 140	restntr 23555	. . . . . . 7 ⊢ ((𝑇 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ 𝑌) → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
142	3, 12, 14, 141	mp3an2i 1496	. . . . . 6 ⊢ (𝜑 → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌))
143		restabs 23538	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑌 ⊆ ℝ ∧ ℝ ∈ V) → ((𝐽 ↾_t ℝ) ↾_t 𝑌) = (𝐽 ↾_t 𝑌))
144	50, 12, 53, 143	mp3an2i 1496	. . . . . . . . 9 ⊢ (𝜑 → ((𝐽 ↾_t ℝ) ↾_t 𝑌) = (𝐽 ↾_t 𝑌))
145	48	oveq1i 7461	. . . . . . . . 9 ⊢ (𝑇 ↾_t 𝑌) = ((𝐽 ↾_t ℝ) ↾_t 𝑌)
146	144, 145, 109	3eqtr4g 2823	. . . . . . . 8 ⊢ (𝜑 → (𝑇 ↾_t 𝑌) = 𝑁)
147	146	fveq2d 6920	. . . . . . 7 ⊢ (𝜑 → (int‘(𝑇 ↾_t 𝑌)) = (int‘𝑁))
148	147	fveq1d 6918	. . . . . 6 ⊢ (𝜑 → ((int‘(𝑇 ↾_t 𝑌))‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) = ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
149	142, 148	eqtr3d 2800	. . . . 5 ⊢ (𝜑 → (((int‘𝑇)‘((𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ∪ (ℝ ∖ 𝑌))) ∩ 𝑌) = ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
150	139, 149	eleqtrd 2866	. . . 4 ⊢ (𝜑 → (𝐹‘𝐶) ∈ ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))))
151	126	feq2d 6723	. . . . . 6 ⊢ (𝜑 → (^◡𝐹:𝑌⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶𝑋))
152	32, 151	mpbid 235	. . . . 5 ⊢ (𝜑 → ^◡𝐹:∪ 𝑁⟶𝑋)
153		resttopon 23534	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝑋 ⊆ ℂ) → (𝐽 ↾_t 𝑋) ∈ (TopOn‘𝑋))
154	99, 39, 153	sylancr 599	. . . . . . 7 ⊢ (𝜑 → (𝐽 ↾_t 𝑋) ∈ (TopOn‘𝑋))
155	80, 154	eqeltrid 2868	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (TopOn‘𝑋))
156		toponuni 23287	. . . . . 6 ⊢ (𝑀 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑀)
157		feq3 6719	. . . . . 6 ⊢ (𝑋 = ∪ 𝑀 → (^◡𝐹:∪ 𝑁⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶∪ 𝑀))
158	155, 156, 157	3syl 19	. . . . 5 ⊢ (𝜑 → (^◡𝐹:∪ 𝑁⟶𝑋 ↔ ^◡𝐹:∪ 𝑁⟶∪ 𝑀))
159	152, 158	mpbid 235	. . . 4 ⊢ (𝜑 → ^◡𝐹:∪ 𝑁⟶∪ 𝑀)
160		eqid 2763	. . . . 5 ⊢ ∪ 𝑁 = ∪ 𝑁
161		eqid 2763	. . . . 5 ⊢ ∪ 𝑀 = ∪ 𝑀
162	160, 161	cnprest 23662	. . . 4 ⊢ (((𝑁 ∈ Top ∧ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅))) ⊆ ∪ 𝑁) ∧ ((𝐹‘𝐶) ∈ ((int‘𝑁)‘(𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∧ ^◡𝐹:∪ 𝑁⟶∪ 𝑀)) → (^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)) ↔ (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶))))
163	124, 127, 150, 159, 162	syl22anc 852	. . 3 ⊢ (𝜑 → (^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)) ↔ (^◡𝐹 ↾ (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) ∈ (((𝑁 ↾_t (𝐹 “ ((𝐶 − 𝑅)[,](𝐶 + 𝑅)))) CnP 𝑀)‘(𝐹‘𝐶))))
164	118, 163	mpbird 260	. 2 ⊢ (𝜑 → ^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶)))
165	29, 164	jca 521	1 ⊢ (𝜑 → ((𝐹‘𝐶) ∈ ((int‘𝑇)‘𝑌) ∧ ^◡𝐹 ∈ ((𝑁 CnP 𝑀)‘(𝐹‘𝐶))))

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 2147 Vcvv 3454 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 ∪ cun 4152 ∪ cuni 4872 class class class wbr 5108 ^◡ccnv 5657 dom cdm 5658 ran crn 5659 ↾ cres 5660 “ cima 5661 Fun wfun 6560 ⟶wf 6562 ⟶1-1wf1 6563 ⟶ontowfo 6564 ⟶1-1ontowf1o 6565 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 ℝcr 11238 0cc0 11239 + caddc 11242 ≤ cle 11383 − cmin 11580 ℝ⁺crp 13160 (,)cioo 13516 [,]cicc 13519 ↾_t crest 17641 TopOpenctopn 17642 topGenctg 17658 ℂ_fldccnfld 21729 Topctop 23266 TopOnctopon 23283 intcnt 23390 Cn ccn 23597 CnP ccnp 23598 Compccmp 23759 –cn→ccncf 25252 D cdv 26238

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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 ax-addf 11318

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 df-om 7912 df-1st 8035 df-2nd 8036 df-supp 8215 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-er 8755 df-map 8887 df-pm 8888 df-ixp 8964 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-fsupp 9392 df-fi 9440 df-sup 9471 df-inf 9472 df-oi 9541 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-q 13116 df-rp 13161 df-xneg 13281 df-xadd 13282 df-xmul 13283 df-ioo 13520 df-ico 13522 df-icc 13523 df-fz 13680 df-fzo 13829 df-seq 14185 df-exp 14245 df-hash 14516 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-starv 17488 df-sca 17489 df-vsca 17490 df-ip 17491 df-tset 17492 df-ple 17493 df-ds 17495 df-unif 17496 df-hom 17497 df-cco 17498 df-euf 17499 df-rest 17643 df-topn 17644 df-0g 17662 df-gsum 17663 df-topgen 17664 df-pt 17665 df-prds 17668 df-xrs 17724 df-qtop 17729 df-imas 17730 df-xps 17732 df-mre 17806 df-mrc 17807 df-acs 17809 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-submnd 19029 df-mulg 19328 df-cntz 19582 df-cmn 20047 df-psmet 21721 df-xmet 21722 df-met 21723 df-bl 21724 df-mopn 21725 df-fbas 21726 df-fg 21727 df-cnfld 21730 df-top 23267 df-topon 23284 df-topsp 23306 df-bases 23319 df-cld 23392 df-ntr 23393 df-cls 23394 df-nei 23471 df-lp 23509 df-perf 23510 df-cn 23600 df-cnp 23601 df-haus 23688 df-cmp 23760 df-tx 23936 df-hmeo 24129 df-fil 24220 df-fm 24312 df-flim 24313 df-flf 24314 df-xms 24694 df-ms 24695 df-tms 24696 df-cncf 25254 df-limc 26241 df-dv 26242

This theorem is used by: dvcnvre 26394

W3C validator