Theorem xkouni 23519

Description: The base set of the compact-open topology. (Contributed by Mario Carneiro, 19-Mar-2015.)

Hypothesis

Ref	Expression
xkouni.1	⊢ 𝐽 = (𝑆 ↑ko 𝑅)

Assertion

Ref	Expression
xkouni	⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = ∪ 𝐽)

Proof of Theorem xkouni

Dummy variables 𝑓 𝑘 𝑣 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ima0 6037	. . . . . . . . 9 ⊢ (𝑓 “ ∅) = ∅
2		0ss 4359	. . . . . . . . 9 ⊢ ∅ ⊆ ∪ 𝑆
3	1, 2	eqsstri 3990	. . . . . . . 8 ⊢ (𝑓 “ ∅) ⊆ ∪ 𝑆
4	3	a1i 11	. . . . . . 7 ⊢ (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ 𝑓 ∈ (𝑅 Cn 𝑆)) → (𝑓 “ ∅) ⊆ ∪ 𝑆)
5	4	ralrimiva 3125	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∀𝑓 ∈ (𝑅 Cn 𝑆)(𝑓 “ ∅) ⊆ ∪ 𝑆)
6		rabid2 3436	. . . . . 6 ⊢ ((𝑅 Cn 𝑆) = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ ∪ 𝑆} ↔ ∀𝑓 ∈ (𝑅 Cn 𝑆)(𝑓 “ ∅) ⊆ ∪ 𝑆)
7	5, 6	sylibr 234	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ ∪ 𝑆})
8		eqid 2729	. . . . . 6 ⊢ ∪ 𝑅 = ∪ 𝑅
9		simpl 482	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑅 ∈ Top)
10		simpr 484	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → 𝑆 ∈ Top)
11		0ss 4359	. . . . . . 7 ⊢ ∅ ⊆ ∪ 𝑅
12	11	a1i 11	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∅ ⊆ ∪ 𝑅)
13		rest0 23089	. . . . . . . 8 ⊢ (𝑅 ∈ Top → (𝑅 ↾t ∅) = {∅})
14	13	adantr 480	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ↾t ∅) = {∅})
15		0cmp 23314	. . . . . . 7 ⊢ {∅} ∈ Comp
16	14, 15	eqeltrdi 2836	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ↾t ∅) ∈ Comp)
17		eqid 2729	. . . . . . . 8 ⊢ ∪ 𝑆 = ∪ 𝑆
18	17	topopn 22826	. . . . . . 7 ⊢ (𝑆 ∈ Top → ∪ 𝑆 ∈ 𝑆)
19	18	adantl 481	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ 𝑆 ∈ 𝑆)
20	8, 9, 10, 12, 16, 19	xkoopn 23509	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ ∅) ⊆ ∪ 𝑆} ∈ (𝑆 ↑ko 𝑅))
21	7, 20	eqeltrd 2828	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ∈ (𝑆 ↑ko 𝑅))
22		xkouni.1	. . . 4 ⊢ 𝐽 = (𝑆 ↑ko 𝑅)
23	21, 22	eleqtrrdi 2839	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ∈ 𝐽)
24		elssuni 4897	. . 3 ⊢ ((𝑅 Cn 𝑆) ∈ 𝐽 → (𝑅 Cn 𝑆) ⊆ ∪ 𝐽)
25	23, 24	syl 17	. 2 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) ⊆ ∪ 𝐽)
26		eqid 2729	. . . . . 6 ⊢ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp} = {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}
27		eqid 2729	. . . . . 6 ⊢ (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})
28	8, 26, 27	xkoval 23507	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ↑ko 𝑅) = (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))))
29	28	unieqd 4880	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ (𝑆 ↑ko 𝑅) = ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))))
30	22	unieqi 4879	. . . 4 ⊢ ∪ 𝐽 = ∪ (𝑆 ↑ko 𝑅)
31		ovex 7402	. . . . . . . 8 ⊢ (𝑅 Cn 𝑆) ∈ V
32	31	pwex 5330	. . . . . . 7 ⊢ 𝒫 (𝑅 Cn 𝑆) ∈ V
33	8, 26, 27	xkotf 23505	. . . . . . . 8 ⊢ (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆)
34		frn 6677	. . . . . . . 8 ⊢ ((𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}):({𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp} × 𝑆)⟶𝒫 (𝑅 Cn 𝑆) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆))
35	33, 34	ax-mp 5	. . . . . . 7 ⊢ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆)
36	32, 35	ssexi 5272	. . . . . 6 ⊢ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ∈ V
37		fiuni 9355	. . . . . 6 ⊢ (ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ∈ V → ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})))
38	36, 37	ax-mp 5	. . . . 5 ⊢ ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
39		fvex 6853	. . . . . 6 ⊢ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})) ∈ V
40		unitg 22887	. . . . . 6 ⊢ ((fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})) ∈ V → ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})))
41	39, 40	ax-mp 5	. . . . 5 ⊢ ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))) = ∪ (fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
42	38, 41	eqtr4i 2755	. . . 4 ⊢ ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) = ∪ (topGen‘(fi‘ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣})))
43	29, 30, 42	3eqtr4g 2789	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ 𝐽 = ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}))
44	35	a1i 11	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆))
45		sspwuni 5059	. . . 4 ⊢ (ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ 𝒫 (𝑅 Cn 𝑆) ↔ ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ (𝑅 Cn 𝑆))
46	44, 45	sylib 218	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ ran (𝑘 ∈ {𝑥 ∈ 𝒫 ∪ 𝑅 ∣ (𝑅 ↾t 𝑥) ∈ Comp}, 𝑣 ∈ 𝑆 ↦ {𝑓 ∈ (𝑅 Cn 𝑆) ∣ (𝑓 “ 𝑘) ⊆ 𝑣}) ⊆ (𝑅 Cn 𝑆))
47	43, 46	eqsstrd 3978	. 2 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ∪ 𝐽 ⊆ (𝑅 Cn 𝑆))
48	25, 47	eqssd 3961	1 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 Cn 𝑆) = ∪ 𝐽)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044  {crab 3402  Vcvv 3444   ⊆ wss 3911  ∅c0 4292  𝒫 cpw 4559  {csn 4585  ∪ cuni 4867   × cxp 5629  ran crn 5632   “ cima 5634  ⟶wf 6495  ‘cfv 6499  (class class class)co 7369   ∈ cmpo 7371  ficfi 9337   ↾_t crest 17359  topGenctg 17376  Topctop 22813   Cn ccn 23144  Compccmp 23306   ↑_ko cxko 23481

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-1o 8411  df-2o 8412  df-en 8896  df-fin 8899  df-fi 9338  df-rest 17361  df-topgen 17382  df-top 22814  df-topon 22831  df-bases 22866  df-cmp 23307  df-xko 23483

This theorem is referenced by:  xkotopon  23520  xkohaus  23573  xkoptsub  23574