Theorem xkopjcn 23599

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 23627.) (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 2736	. . . . . 6 ⊢ (𝑆 ↑ko 𝑅) = (𝑆 ↑ko 𝑅)
2	1	xkotopon 23543	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆 ↑ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
3	2	3adant3 1132	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑆 ↑ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
4		xkopjcn.1	. . . . . . . . 9 ⊢ 𝑋 = ∪ 𝑅
5	4	topopn 22849	. . . . . . . 8 ⊢ (𝑅 ∈ Top → 𝑋 ∈ 𝑅)
6	5	3ad2ant1 1133	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → 𝑋 ∈ 𝑅)
7		fconst6g 6772	. . . . . . . 8 ⊢ (𝑆 ∈ Top → (𝑋 × {𝑆}):𝑋⟶Top)
8	7	3ad2ant2 1134	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑋 × {𝑆}):𝑋⟶Top)
9		pttop 23525	. . . . . . 7 ⊢ ((𝑋 ∈ 𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
10	6, 8, 9	syl2anc 584	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
11		eqid 2736	. . . . . . . . . 10 ⊢ ∪ 𝑆 = ∪ 𝑆
12	4, 11	cnf 23189	. . . . . . . . 9 ⊢ (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓:𝑋⟶∪ 𝑆)
13		uniexg 7739	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Top → ∪ 𝑆 ∈ V)
14	13	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ∪ 𝑆 ∈ V)
15	14, 6	elmapd 8859	. . . . . . . . 9 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (∪ 𝑆 ↑m 𝑋) ↔ 𝑓:𝑋⟶∪ 𝑆))
16	12, 15	imbitrrid 246	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓 ∈ (∪ 𝑆 ↑m 𝑋)))
17	16	ssrdv 3969	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑅 Cn 𝑆) ⊆ (∪ 𝑆 ↑m 𝑋))
18		simp2 1137	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → 𝑆 ∈ Top)
19		eqid 2736	. . . . . . . . 9 ⊢ (∏t‘(𝑋 × {𝑆})) = (∏t‘(𝑋 × {𝑆}))
20	19, 11	ptuniconst 23541	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝑅 ∧ 𝑆 ∈ Top) → (∪ 𝑆 ↑m 𝑋) = ∪ (∏t‘(𝑋 × {𝑆})))
21	6, 18, 20	syl2anc 584	. . . . . . 7 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (∪ 𝑆 ↑m 𝑋) = ∪ (∏t‘(𝑋 × {𝑆})))
22	17, 21	sseqtrd 4000	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑅 Cn 𝑆) ⊆ ∪ (∏t‘(𝑋 × {𝑆})))
23		eqid 2736	. . . . . . 7 ⊢ ∪ (∏t‘(𝑋 × {𝑆})) = ∪ (∏t‘(𝑋 × {𝑆}))
24	23	restuni 23105	. . . . . 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 6885	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (TopOn‘(𝑅 Cn 𝑆)) = (TopOn‘∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
27	3, 26	eleqtrd 2837	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑆 ↑ko 𝑅) ∈ (TopOn‘∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
28	4, 19	xkoptsub 23597	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆 ↑ko 𝑅))
29	28	3adant3 1132	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆 ↑ko 𝑅))
30		eqid 2736	. . . 4 ⊢ ∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) = ∪ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))
31	30	cnss1 23219	. . 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 6032	. . 3 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ↾ (𝑅 Cn 𝑆)) = (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓‘𝐴)))
34		simp3 1138	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
35	23, 19	ptpjcn 23554	. . . . . 6 ⊢ ((𝑋 ∈ 𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
36	6, 8, 34, 35	syl3anc 1373	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
37		fvconst2g 7199	. . . . . . 7 ⊢ ((𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
38	37	3adant1 1130	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
39	38	oveq2d 7426	. . . . 5 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)) = ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
40	36, 39	eleqtrd 2837	. . . 4 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ ∪ (∏t‘(𝑋 × {𝑆})) ↦ (𝑓‘𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
41	23	cnrest 23228	. . . 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 2836	. 2 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓‘𝐴)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
44	32, 43	sseldd 3964	1 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴 ∈ 𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓‘𝐴)) ∈ ((𝑆 ↑ko 𝑅) Cn 𝑆))

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  Vcvv 3464   ⊆ wss 3931  {csn 4606  ∪ cuni 4888   ↦ cmpt 5206   × cxp 5657   ↾ cres 5661  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ↑_m cmap 8845   ↾_t crest 17439  ∏_tcpt 17457  Topctop 22836  TopOnctopon 22853   Cn ccn 23167   ↑_ko cxko 23504

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 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-iun 4974  df-iin 4975  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7867  df-1st 7993  df-2nd 7994  df-1o 8485  df-2o 8486  df-map 8847  df-ixp 8917  df-en 8965  df-dom 8966  df-fin 8968  df-fi 9428  df-rest 17441  df-topgen 17462  df-pt 17463  df-top 22837  df-topon 22854  df-bases 22889  df-cn 23170  df-cmp 23330  df-xko 23506

This theorem is referenced by:  cnmptkp  23623  xkofvcn  23627