MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  xkopjcn Structured version   Visualization version   GIF version

Theorem xkopjcn 23621
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 23649.) (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
StepHypRef Expression
1 eqid 2736 . . . . . 6 (𝑆ko 𝑅) = (𝑆ko 𝑅)
21xkotopon 23565 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
323adant3 1133 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑆ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
4 xkopjcn.1 . . . . . . . . 9 𝑋 = 𝑅
54topopn 22871 . . . . . . . 8 (𝑅 ∈ Top → 𝑋𝑅)
653ad2ant1 1134 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝑋𝑅)
7 fconst6g 6729 . . . . . . . 8 (𝑆 ∈ Top → (𝑋 × {𝑆}):𝑋⟶Top)
873ad2ant2 1135 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑋 × {𝑆}):𝑋⟶Top)
9 pttop 23547 . . . . . . 7 ((𝑋𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
106, 8, 9syl2anc 585 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
11 eqid 2736 . . . . . . . . . 10 𝑆 = 𝑆
124, 11cnf 23211 . . . . . . . . 9 (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓:𝑋 𝑆)
13 uniexg 7694 . . . . . . . . . . 11 (𝑆 ∈ Top → 𝑆 ∈ V)
14133ad2ant2 1135 . . . . . . . . . 10 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝑆 ∈ V)
1514, 6elmapd 8787 . . . . . . . . 9 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ ( 𝑆m 𝑋) ↔ 𝑓:𝑋 𝑆))
1612, 15imbitrrid 246 . . . . . . . 8 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓 ∈ ( 𝑆m 𝑋)))
1716ssrdv 3927 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑅 Cn 𝑆) ⊆ ( 𝑆m 𝑋))
18 simp2 1138 . . . . . . . 8 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝑆 ∈ Top)
19 eqid 2736 . . . . . . . . 9 (∏t‘(𝑋 × {𝑆})) = (∏t‘(𝑋 × {𝑆}))
2019, 11ptuniconst 23563 . . . . . . . 8 ((𝑋𝑅𝑆 ∈ Top) → ( 𝑆m 𝑋) = (∏t‘(𝑋 × {𝑆})))
216, 18, 20syl2anc 585 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ( 𝑆m 𝑋) = (∏t‘(𝑋 × {𝑆})))
2217, 21sseqtrd 3958 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑅 Cn 𝑆) ⊆ (∏t‘(𝑋 × {𝑆})))
23 eqid 2736 . . . . . . 7 (∏t‘(𝑋 × {𝑆})) = (∏t‘(𝑋 × {𝑆}))
2423restuni 23127 . . . . . 6 (((∏t‘(𝑋 × {𝑆})) ∈ Top ∧ (𝑅 Cn 𝑆) ⊆ (∏t‘(𝑋 × {𝑆}))) → (𝑅 Cn 𝑆) = ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)))
2510, 22, 24syl2anc 585 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑅 Cn 𝑆) = ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)))
2625fveq2d 6844 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (TopOn‘(𝑅 Cn 𝑆)) = (TopOn‘ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
273, 26eleqtrd 2838 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑆ko 𝑅) ∈ (TopOn‘ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
284, 19xkoptsub 23619 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆ko 𝑅))
29283adant3 1133 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆ko 𝑅))
30 eqid 2736 . . . 4 ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) = ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))
3130cnss1 23241 . . 3 (((𝑆ko 𝑅) ∈ (TopOn‘ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))) ∧ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆ko 𝑅)) → (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆) ⊆ ((𝑆ko 𝑅) Cn 𝑆))
3227, 29, 31syl2anc 585 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆) ⊆ ((𝑆ko 𝑅) Cn 𝑆))
3322resmptd 6005 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ↾ (𝑅 Cn 𝑆)) = (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓𝐴)))
34 simp3 1139 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝐴𝑋)
3523, 19ptpjcn 23576 . . . . . 6 ((𝑋𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top ∧ 𝐴𝑋) → (𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
366, 8, 34, 35syl3anc 1374 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
37 fvconst2g 7157 . . . . . . 7 ((𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
38373adant1 1131 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
3938oveq2d 7383 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)) = ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
4036, 39eleqtrd 2838 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
4123cnrest 23250 . . . 4 (((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn 𝑆) ∧ (𝑅 Cn 𝑆) ⊆ (∏t‘(𝑋 × {𝑆}))) → ((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ↾ (𝑅 Cn 𝑆)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
4240, 22, 41syl2anc 585 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ↾ (𝑅 Cn 𝑆)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
4333, 42eqeltrrd 2837 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓𝐴)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
4432, 43sseldd 3922 1 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓𝐴)) ∈ ((𝑆ko 𝑅) Cn 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1087   = wceq 1542  wcel 2114  Vcvv 3429  wss 3889  {csn 4567   cuni 4850  cmpt 5166   × cxp 5629  cres 5633  wf 6494  cfv 6498  (class class class)co 7367  m cmap 8773  t crest 17383  tcpt 17401  Topctop 22858  TopOnctopon 22875   Cn ccn 23189  ko cxko 23526
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  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 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-1o 8405  df-2o 8406  df-map 8775  df-ixp 8846  df-en 8894  df-dom 8895  df-fin 8897  df-fi 9324  df-rest 17385  df-topgen 17406  df-pt 17407  df-top 22859  df-topon 22876  df-bases 22911  df-cn 23192  df-cmp 23352  df-xko 23528
This theorem is referenced by:  cnmptkp  23645  xkofvcn  23649
  Copyright terms: Public domain W3C validator