Theorem cnpresti 23621

Description: One direction of cnprest 23622 under the weaker condition that the point is in the subset rather than the interior of the subset. (Contributed by Mario Carneiro, 9-Feb-2015.) (Revised by Mario Carneiro, 1-May-2015.)

Hypothesis

Ref	Expression
cnprest.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
cnpresti	⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾t 𝐴) CnP 𝐾)‘𝑃))

Proof of Theorem cnpresti

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cnprest.1	. . . . 5 ⊢ 𝑋 = ∪ 𝐽
2		eqid 2763	. . . . 5 ⊢ ∪ 𝐾 = ∪ 𝐾
3	1, 2	cnpf 23580	. . . 4 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐹:𝑋⟶∪ 𝐾)
4	3	3ad2ant3 1153	. . 3 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐹:𝑋⟶∪ 𝐾)
5		simp1 1154	. . 3 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 ⊆ 𝑋)
6	4, 5	fssresd 6760	. 2 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹 ↾ 𝐴):𝐴⟶∪ 𝐾)
7		simpl2 1211	. . . . . 6 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦 ∈ 𝐾) → 𝑃 ∈ 𝐴)
8	7	fvresd 6916	. . . . 5 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦 ∈ 𝐾) → ((𝐹 ↾ 𝐴)‘𝑃) = (𝐹‘𝑃))
9	8	eleq1d 2849	. . . 4 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦 ∈ 𝐾) → (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 ↔ (𝐹‘𝑃) ∈ 𝑦))
10		cnpimaex 23589	. . . . . . 7 ⊢ ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑦 ∈ 𝐾 ∧ (𝐹‘𝑃) ∈ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦))
11	10	3expia 1139	. . . . . 6 ⊢ ((𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) ∧ 𝑦 ∈ 𝐾) → ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
12	11	3ad2antl3 1206	. . . . 5 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦 ∈ 𝐾) → ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦)))
13		idd 25	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃 ∈ 𝑥 → 𝑃 ∈ 𝑥))
14		simp2 1155	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝑃 ∈ 𝐴)
15	13, 14	jctird 536	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃 ∈ 𝑥 → (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ 𝐴)))
16		elin 4096	. . . . . . . . . 10 ⊢ (𝑃 ∈ (𝑥 ∩ 𝐴) ↔ (𝑃 ∈ 𝑥 ∧ 𝑃 ∈ 𝐴))
17	15, 16	imbitrrdi 255	. . . . . . . . 9 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑃 ∈ 𝑥 → 𝑃 ∈ (𝑥 ∩ 𝐴)))
18		inss1 4136	. . . . . . . . . . 11 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝑥
19		imass2 6061	. . . . . . . . . . 11 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝑥 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥))
20	18, 19	ax-mp 5	. . . . . . . . . 10 ⊢ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ (𝐹 “ 𝑥)
21		id 23	. . . . . . . . . 10 ⊢ ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ 𝑥) ⊆ 𝑦)
22	20, 21	sstrid 3924	. . . . . . . . 9 ⊢ ((𝐹 “ 𝑥) ⊆ 𝑦 → (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)
23	17, 22	anim12d1 622	. . . . . . . 8 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ((𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → (𝑃 ∈ (𝑥 ∩ 𝐴) ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
24	23	reximdv 3181	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑥 ∈ 𝐽 (𝑃 ∈ (𝑥 ∩ 𝐴) ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
25		vex 3458	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
26	25	inex1 5281	. . . . . . . . 9 ⊢ (𝑥 ∩ 𝐴) ∈ V
27	26	a1i 11	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ 𝐴) ∈ V)
28		cnptop1 23575	. . . . . . . . . 10 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐽 ∈ Top)
29	28	3ad2ant3 1153	. . . . . . . . 9 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ Top)
30	29	uniexd 7769	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ∪ 𝐽 ∈ V)
31	5, 1	sseqtrdi 3953	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 ⊆ ∪ 𝐽)
32	30, 31	ssexd 5290	. . . . . . . . 9 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐴 ∈ V)
33		elrest 17613	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝑧 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
34	29, 32, 33	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝑧 ∈ (𝐽 ↾t 𝐴) ↔ ∃𝑥 ∈ 𝐽 𝑧 = (𝑥 ∩ 𝐴)))
35		simpr 490	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → 𝑧 = (𝑥 ∩ 𝐴))
36	35	eleq2d 2850	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (𝑃 ∈ 𝑧 ↔ 𝑃 ∈ (𝑥 ∩ 𝐴)))
37	35	imaeq2d 6058	. . . . . . . . . . 11 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)))
38		inss2 4137	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝐴) ⊆ 𝐴
39		resima2 6063	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝐴) ⊆ 𝐴 → ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴)))
40	38, 39	ax-mp 5	. . . . . . . . . . 11 ⊢ ((𝐹 ↾ 𝐴) “ (𝑥 ∩ 𝐴)) = (𝐹 “ (𝑥 ∩ 𝐴))
41	37, 40	eqtrdi 2814	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝐹 ↾ 𝐴) “ 𝑧) = (𝐹 “ (𝑥 ∩ 𝐴)))
42	41	sseq1d 3944	. . . . . . . . 9 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → (((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦 ↔ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦))
43	36, 42	anbi12d 644	. . . . . . . 8 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑧 = (𝑥 ∩ 𝐴)) → ((𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ (𝑃 ∈ (𝑥 ∩ 𝐴) ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
44	27, 34, 43	rexxfr2d 5377	. . . . . . 7 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦) ↔ ∃𝑥 ∈ 𝐽 (𝑃 ∈ (𝑥 ∩ 𝐴) ∧ (𝐹 “ (𝑥 ∩ 𝐴)) ⊆ 𝑦)))
45	24, 44	sylibrd 262	. . . . . 6 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
46	45	adantr 486	. . . . 5 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦 ∈ 𝐾) → (∃𝑥 ∈ 𝐽 (𝑃 ∈ 𝑥 ∧ (𝐹 “ 𝑥) ⊆ 𝑦) → ∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
47	12, 46	syld 48	. . . 4 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦 ∈ 𝐾) → ((𝐹‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
48	9, 47	sylbid 243	. . 3 ⊢ (((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) ∧ 𝑦 ∈ 𝐾) → (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
49	48	ralrimiva 3158	. 2 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))
50	1	toptopon 23250	. . . . 5 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
51	29, 50	sylib 221	. . . 4 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐽 ∈ (TopOn‘𝑋))
52		resttopon 23494	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾t 𝐴) ∈ (TopOn‘𝐴))
53	51, 5, 52	syl2anc 596	. . 3 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐽 ↾t 𝐴) ∈ (TopOn‘𝐴))
54		cnptop2 23576	. . . . 5 ⊢ (𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃) → 𝐾 ∈ Top)
55	54	3ad2ant3 1153	. . . 4 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ Top)
56	2	toptopon 23250	. . . 4 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘∪ 𝐾))
57	55, 56	sylib 221	. . 3 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → 𝐾 ∈ (TopOn‘∪ 𝐾))
58		iscnp 23570	. . 3 ⊢ (((𝐽 ↾t 𝐴) ∈ (TopOn‘𝐴) ∧ 𝐾 ∈ (TopOn‘∪ 𝐾) ∧ 𝑃 ∈ 𝐴) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
59	53, 57, 14, 58	syl3anc 1398	. 2 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → ((𝐹 ↾ 𝐴) ∈ (((𝐽 ↾t 𝐴) CnP 𝐾)‘𝑃) ↔ ((𝐹 ↾ 𝐴):𝐴⟶∪ 𝐾 ∧ ∀𝑦 ∈ 𝐾 (((𝐹 ↾ 𝐴)‘𝑃) ∈ 𝑦 → ∃𝑧 ∈ (𝐽 ↾t 𝐴)(𝑃 ∈ 𝑧 ∧ ((𝐹 ↾ 𝐴) “ 𝑧) ⊆ 𝑦)))))
60	6, 49, 59	mpbir2and 726	1 ⊢ ((𝐴 ⊆ 𝑋 ∧ 𝑃 ∈ 𝐴 ∧ 𝐹 ∈ ((𝐽 CnP 𝐾)‘𝑃)) → (𝐹 ↾ 𝐴) ∈ (((𝐽 ↾t 𝐴) CnP 𝐾)‘𝑃))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∪ cuni 4870   ↾ cres 5657   “ cima 5658  ⟶wf 6543  ‘cfv 6547  (class class class)co 7430   ↾_t crest 17606  Topctop 23226  TopOnctopon 23243   CnP ccnp 23558

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  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-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-1st 8011  df-2nd 8012  df-map 8863  df-en 8988  df-fin 8991  df-fi 9416  df-rest 17608  df-topgen 17629  df-top 23227  df-topon 23244  df-bases 23279  df-cnp 23561

This theorem is used by:  efrlim  27312  cvmlift2lem11  36202