Theorem imasncls 23721

Description: If a relation graph is closed, then an image set of a singleton is also closed. Corollary of Proposition 4 of [BourbakiTop1] p. I.26. (Contributed by Thierry Arnoux, 14-Jan-2018.)

Hypotheses

Ref	Expression
imasnopn.1	⊢ 𝑋 = ∪ 𝐽
imasnopn.2	⊢ 𝑌 = ∪ 𝐾

Assertion

Ref	Expression
imasncls	⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) ⊆ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))

Proof of Theorem imasncls

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		imasnopn.2	. . . . . . 7 ⊢ 𝑌 = ∪ 𝐾
2	1	toptopon 22944	. . . . . 6 ⊢ (𝐾 ∈ Top ↔ 𝐾 ∈ (TopOn‘𝑌))
3	2	biimpi 216	. . . . 5 ⊢ (𝐾 ∈ Top → 𝐾 ∈ (TopOn‘𝑌))
4	3	ad2antlr 726	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → 𝐾 ∈ (TopOn‘𝑌))
5		imasnopn.1	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
6	5	toptopon 22944	. . . . . . 7 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
7	6	biimpi 216	. . . . . 6 ⊢ (𝐽 ∈ Top → 𝐽 ∈ (TopOn‘𝑋))
8	7	ad2antrr 725	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → 𝐽 ∈ (TopOn‘𝑋))
9		simprr 772	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → 𝐴 ∈ 𝑋)
10	4, 8, 9	cnmptc 23691	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ 𝑌 ↦ 𝐴) ∈ (𝐾 Cn 𝐽))
11	4	cnmptid 23690	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ 𝑌 ↦ 𝑦) ∈ (𝐾 Cn 𝐾))
12	4, 10, 11	cnmpt1t 23694	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)))
13		simprl 770	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ⊆ (𝑋 × 𝑌))
14	5, 1	txuni 23621	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝑋 × 𝑌) = ∪ (𝐽 ×t 𝐾))
15	14	adantr 480	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑋 × 𝑌) = ∪ (𝐽 ×t 𝐾))
16	13, 15	sseqtrd 4049	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → 𝑅 ⊆ ∪ (𝐽 ×t 𝐾))
17		eqid 2740	. . . 4 ⊢ ∪ (𝐽 ×t 𝐾) = ∪ (𝐽 ×t 𝐾)
18	17	cncls2i 23299	. . 3 ⊢ (((𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) ∈ (𝐾 Cn (𝐽 ×t 𝐾)) ∧ 𝑅 ⊆ ∪ (𝐽 ×t 𝐾)) → ((cls‘𝐾)‘(◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)) ⊆ (◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
19	12, 16, 18	syl2anc 583	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((cls‘𝐾)‘(◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)) ⊆ (◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
20		nfv 1913	. . . . 5 ⊢ Ⅎ𝑦((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋))
21		nfcv 2908	. . . . 5 ⊢ Ⅎ𝑦(𝑅 “ {𝐴})
22		nfrab1 3464	. . . . 5 ⊢ Ⅎ𝑦{𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
23		imass1 6131	. . . . . . . . . . 11 ⊢ (𝑅 ⊆ (𝑋 × 𝑌) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
24	13, 23	syl 17	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
25		xpimasn 6216	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑋 → ((𝑋 × 𝑌) “ {𝐴}) = 𝑌)
26	25	ad2antll 728	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((𝑋 × 𝑌) “ {𝐴}) = 𝑌)
27	24, 26	sseqtrd 4049	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) ⊆ 𝑌)
28	27	sseld 4007	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) → 𝑦 ∈ 𝑌))
29	28	pm4.71rd 562	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 ∈ 𝑌 ∧ 𝑦 ∈ (𝑅 “ {𝐴}))))
30		elimasng 6118	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝑦 ∈ V) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
31	30	elvd 3494	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑋 → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
32	31	ad2antll 728	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
33	32	anbi2d 629	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((𝑦 ∈ 𝑌 ∧ 𝑦 ∈ (𝑅 “ {𝐴})) ↔ (𝑦 ∈ 𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
34	29, 33	bitrd 279	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ (𝑦 ∈ 𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅)))
35		rabid 3465	. . . . . 6 ⊢ (𝑦 ∈ {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅} ↔ (𝑦 ∈ 𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ 𝑅))
36	34, 35	bitr4di 289	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (𝑅 “ {𝐴}) ↔ 𝑦 ∈ {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}))
37	20, 21, 22, 36	eqrd 4028	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) = {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅})
38		eqid 2740	. . . . 5 ⊢ (𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) = (𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩)
39	38	mptpreima 6269	. . . 4 ⊢ (◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅) = {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ 𝑅}
40	37, 39	eqtr4di 2798	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑅 “ {𝐴}) = (◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅))
41	40	fveq2d 6924	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) = ((cls‘𝐾)‘(◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ 𝑅)))
42		nfcv 2908	. . . 4 ⊢ Ⅎ𝑦(((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴})
43		nfrab1 3464	. . . 4 ⊢ Ⅎ𝑦{𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}
44		txtop 23598	. . . . . . . . . . . . 13 ⊢ ((𝐽 ∈ Top ∧ 𝐾 ∈ Top) → (𝐽 ×t 𝐾) ∈ Top)
45	44	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝐽 ×t 𝐾) ∈ Top)
46	17	clsss3 23088	. . . . . . . . . . . 12 ⊢ (((𝐽 ×t 𝐾) ∈ Top ∧ 𝑅 ⊆ ∪ (𝐽 ×t 𝐾)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ ∪ (𝐽 ×t 𝐾))
47	45, 16, 46	syl2anc 583	. . . . . . . . . . 11 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ ∪ (𝐽 ×t 𝐾))
48	47, 15	sseqtrrd 4050	. . . . . . . . . 10 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝑋 × 𝑌))
49		imass1 6131	. . . . . . . . . 10 ⊢ (((cls‘(𝐽 ×t 𝐾))‘𝑅) ⊆ (𝑋 × 𝑌) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
50	48, 49	syl 17	. . . . . . . . 9 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ ((𝑋 × 𝑌) “ {𝐴}))
51	50, 26	sseqtrd 4049	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ⊆ 𝑌)
52	51	sseld 4007	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) → 𝑦 ∈ 𝑌))
53	52	pm4.71rd 562	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ (𝑦 ∈ 𝑌 ∧ 𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))))
54		elimasng 6118	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝑦 ∈ V) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
55	54	elvd 3494	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑋 → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
56	55	ad2antll 728	. . . . . . 7 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
57	56	anbi2d 629	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((𝑦 ∈ 𝑌 ∧ 𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴})) ↔ (𝑦 ∈ 𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅))))
58	53, 57	bitrd 279	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ (𝑦 ∈ 𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅))))
59		rabid 3465	. . . . 5 ⊢ (𝑦 ∈ {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)} ↔ (𝑦 ∈ 𝑌 ∧ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
60	58, 59	bitr4di 289	. . . 4 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (𝑦 ∈ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) ↔ 𝑦 ∈ {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}))
61	20, 42, 43, 60	eqrd 4028	. . 3 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) = {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)})
62	38	mptpreima 6269	. . 3 ⊢ (◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)) = {𝑦 ∈ 𝑌 ∣ ⟨𝐴, 𝑦⟩ ∈ ((cls‘(𝐽 ×t 𝐾))‘𝑅)}
63	61, 62	eqtr4di 2798	. 2 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}) = (◡(𝑦 ∈ 𝑌 ↦ ⟨𝐴, 𝑦⟩) “ ((cls‘(𝐽 ×t 𝐾))‘𝑅)))
64	19, 41, 63	3sstr4d 4056	1 ⊢ (((𝐽 ∈ Top ∧ 𝐾 ∈ Top) ∧ (𝑅 ⊆ (𝑋 × 𝑌) ∧ 𝐴 ∈ 𝑋)) → ((cls‘𝐾)‘(𝑅 “ {𝐴})) ⊆ (((cls‘(𝐽 ×t 𝐾))‘𝑅) “ {𝐴}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  {crab 3443  Vcvv 3488   ⊆ wss 3976  {csn 4648  ⟨cop 4654  ∪ cuni 4931   ↦ cmpt 5249   × cxp 5698  ^◡ccnv 5699   “ cima 5703  ‘cfv 6573  (class class class)co 7448  Topctop 22920  TopOnctopon 22937  clsccl 23047   Cn ccn 23253   ×_t ctx 23589

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-iin 5018  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-map 8886  df-topgen 17503  df-top 22921  df-topon 22938  df-bases 22974  df-cld 23048  df-cls 23050  df-cn 23256  df-cnp 23257  df-tx 23591

This theorem is referenced by:  utopreg  24282