Theorem xkopjcn 23571

Description: Continuity of a projection map from the space of continuous functions. (This theorem can be strengthened, to joint continuity in both 𝑓 and 𝐴 as a function on (𝑆 ↑_ko 𝑅) ×_t 𝑅, but not without stronger assumptions on 𝑅; see xkofvcn 23599.) (Contributed by Mario Carneiro, 3-Feb-2015.) (Revised by Mario Carneiro, 22-Aug-2015.)

Hypothesis

Ref	Expression
xkopjcn.1	⊢ 𝑋 = ∪ 𝑅

Assertion

Ref	Expression
xkopjcn	⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓‘𝐴)) ∈ ((𝑆 ↑ko 𝑅) Cn 𝑆))

Distinct variable groups:   𝐴,𝑓   𝑅,𝑓   𝑆,𝑓   𝑓,𝑋

Proof of Theorem xkopjcn

Step	Hyp	Ref	Expression
1		eqid 2731	. . . . . 6 ⊢ (𝑆 ↑ko 𝑅) = (𝑆 ↑ko 𝑅)
2	1	xkotopon 23515	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ↑ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
3	2	3adant3 1132	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑆 ↑ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
4		xkopjcn.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝑅
5	4	topopn 22821	. . . . . . . 8 ⊢ (𝑅 ∈ Top → 𝑋 ∈ 𝑅)
6	5	3ad2ant1 1133	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → 𝑋 ∈ 𝑅)
7		fconst6g 6712	. . . . . . . 8 ⊢ (𝑆 ∈ Top → (𝑋 × {𝑆}):𝑋⟶Top)
8	7	3ad2ant2 1134	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑋 × {𝑆}):𝑋⟶Top)
9		pttop 23497	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
10	6, 8, 9	syl2anc 584	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
11		eqid 2731	. . . . . . . . . 10 ⊢ ∪ 𝑆 = ∪ 𝑆
12	4, 11	cnf 23161	. . . . . . . . 9 ⊢ (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓:𝑋⟶∪ 𝑆)
13		uniexg 7673	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Top → ∪ 𝑆 ∈ V)
14	13	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ∪ 𝑆 ∈ V)
15	14, 6	elmapd 8764	. . . . . . . . 9 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (∪ 𝑆 ↑m 𝑋) ↔ 𝑓:𝑋⟶∪ 𝑆))
16	12, 15	imbitrrid 246	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓 ∈ (∪ 𝑆 ↑m 𝑋)))
17	16	ssrdv 3935	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑅 Cn 𝑆) ⊆ (∪ 𝑆 ↑m 𝑋))
18		simp2 1137	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → 𝑆 ∈ Top)
19		eqid 2731	. . . . . . . . 9 ⊢ (∏t‘(𝑋 × {𝑆})) = (∏t‘(𝑋 × {𝑆}))
20	19, 11	ptuniconst 23513	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑅 ∧ 𝑆 ∈ Top) → (∪ 𝑆 ↑m 𝑋) = ∪ (∏t‘(𝑋 × {𝑆})))
21	6, 18, 20	syl2anc 584	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (∪ 𝑆 ↑m 𝑋) = ∪ (∏t‘(𝑋 × {𝑆})))
22	17, 21	sseqtrd 3966	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑅 Cn 𝑆) ⊆ ∪ (∏t‘(𝑋 × {𝑆})))
23		eqid 2731	. . . . . . 7 ⊢ ∪ (∏t‘(𝑋 × {𝑆})) = ∪ (∏t‘(𝑋 × {𝑆}))
24	23	restuni 23077	. . . . . 6 ⊢ (((∏t‘(𝑋 × {𝑆})) ∈ Top ∧ (𝑅 Cn 𝑆) ⊆ ∪ (∏t‘(𝑋 × {𝑆}))) → (𝑅 Cn 𝑆) = ∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)))
25	10, 22, 24	syl2anc 584	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑅 Cn 𝑆) = ∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)))
26	25	fveq2d 6826	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (TopOn‘(𝑅 Cn 𝑆)) = (TopOn‘∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
27	3, 26	eleqtrd 2833	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑆 ↑ko 𝑅) ∈ (TopOn‘∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
28	4, 19	xkoptsub 23569	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆 ↑ko 𝑅))
29	28	3adant3 1132	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆 ↑ko 𝑅))
30		eqid 2731	. . . 4 ⊢ ∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) = ∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))
31	30	cnss1 23191	. . 3 ⊢ (((𝑆 ↑ko 𝑅) ∈ (TopOn‘∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))) ∧ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆 ↑ko 𝑅)) → (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆) ⊆ ((𝑆 ↑ko 𝑅) Cn 𝑆))
32	27, 29, 31	syl2anc 584	. 2 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆) ⊆ ((𝑆 ↑ko 𝑅) Cn 𝑆))
33	22	resmptd 5988	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ↾ (𝑅 Cn 𝑆)) = (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓‘𝐴)))
34		simp3 1138	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
35	23, 19	ptpjcn 23526	. . . . . 6 ⊢ ((𝑋 ∈ 𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
36	6, 8, 34, 35	syl3anc 1373	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
37		fvconst2g 7136	. . . . . . 7 ⊢ ((𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
38	37	3adant1 1130	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
39	38	oveq2d 7362	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)) = ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
40	36, 39	eleqtrd 2833	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
41	23	cnrest 23200	. . . 4 ⊢ (((𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn 𝑆) ∧ (𝑅 Cn 𝑆) ⊆ ∪ (∏t‘(𝑋 × {𝑆}))) → ((𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ↾ (𝑅 Cn 𝑆)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
42	40, 22, 41	syl2anc 584	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ↾ (𝑅 Cn 𝑆)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
43	33, 42	eqeltrrd 2832	. 2 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓‘𝐴)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
44	32, 43	sseldd 3930	1 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓‘𝐴)) ∈ ((𝑆 ↑ko 𝑅) Cn 𝑆))

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111  Vcvv 3436   ⊆ wss 3897  {csn 4573  ∪ cuni 4856   ↦ cmpt 5170   × cxp 5612   ↾ cres 5616  ⟶wf 6477  ‘cfv 6481  (class class class)co 7346   ↑_m cmap 8750   ↾_t crest 17324  ∏_tcpt 17342  Topctop 22808  TopOnctopon 22825   Cn ccn 23139   ↑_ko cxko 23476

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-int 4896  df-iun 4941  df-iin 4942  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-1o 8385  df-2o 8386  df-map 8752  df-ixp 8822  df-en 8870  df-dom 8871  df-fin 8873  df-fi 9295  df-rest 17326  df-topgen 17347  df-pt 17348  df-top 22809  df-topon 22826  df-bases 22861  df-cn 23142  df-cmp 23302  df-xko 23478

This theorem is referenced by:  cnmptkp  23595  xkofvcn  23599