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

Theorem xkopjcn 23577
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 23605.) (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 2731 . . . . . 6 (𝑆ko 𝑅) = (𝑆ko 𝑅)
21xkotopon 23521 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑆ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
323adant3 1132 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑆ko 𝑅) ∈ (TopOn‘(𝑅 Cn 𝑆)))
4 xkopjcn.1 . . . . . . . . 9 𝑋 = 𝑅
54topopn 22827 . . . . . . . 8 (𝑅 ∈ Top → 𝑋𝑅)
653ad2ant1 1133 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝑋𝑅)
7 fconst6g 6718 . . . . . . . 8 (𝑆 ∈ Top → (𝑋 × {𝑆}):𝑋⟶Top)
873ad2ant2 1134 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑋 × {𝑆}):𝑋⟶Top)
9 pttop 23503 . . . . . . 7 ((𝑋𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
106, 8, 9syl2anc 584 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (∏t‘(𝑋 × {𝑆})) ∈ Top)
11 eqid 2731 . . . . . . . . . 10 𝑆 = 𝑆
124, 11cnf 23167 . . . . . . . . 9 (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓:𝑋 𝑆)
13 uniexg 7679 . . . . . . . . . . 11 (𝑆 ∈ Top → 𝑆 ∈ V)
14133ad2ant2 1134 . . . . . . . . . 10 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝑆 ∈ V)
1514, 6elmapd 8770 . . . . . . . . 9 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ ( 𝑆m 𝑋) ↔ 𝑓:𝑋 𝑆))
1612, 15imbitrrid 246 . . . . . . . 8 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) → 𝑓 ∈ ( 𝑆m 𝑋)))
1716ssrdv 3935 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑅 Cn 𝑆) ⊆ ( 𝑆m 𝑋))
18 simp2 1137 . . . . . . . 8 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝑆 ∈ Top)
19 eqid 2731 . . . . . . . . 9 (∏t‘(𝑋 × {𝑆})) = (∏t‘(𝑋 × {𝑆}))
2019, 11ptuniconst 23519 . . . . . . . 8 ((𝑋𝑅𝑆 ∈ Top) → ( 𝑆m 𝑋) = (∏t‘(𝑋 × {𝑆})))
216, 18, 20syl2anc 584 . . . . . . 7 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ( 𝑆m 𝑋) = (∏t‘(𝑋 × {𝑆})))
2217, 21sseqtrd 3966 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑅 Cn 𝑆) ⊆ (∏t‘(𝑋 × {𝑆})))
23 eqid 2731 . . . . . . 7 (∏t‘(𝑋 × {𝑆})) = (∏t‘(𝑋 × {𝑆}))
2423restuni 23083 . . . . . 6 (((∏t‘(𝑋 × {𝑆})) ∈ Top ∧ (𝑅 Cn 𝑆) ⊆ (∏t‘(𝑋 × {𝑆}))) → (𝑅 Cn 𝑆) = ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)))
2510, 22, 24syl2anc 584 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑅 Cn 𝑆) = ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)))
2625fveq2d 6832 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (TopOn‘(𝑅 Cn 𝑆)) = (TopOn‘ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
273, 26eleqtrd 2833 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑆ko 𝑅) ∈ (TopOn‘ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))))
284, 19xkoptsub 23575 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆ko 𝑅))
29283adant3 1132 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆ko 𝑅))
30 eqid 2731 . . . 4 ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) = ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))
3130cnss1 23197 . . 3 (((𝑆ko 𝑅) ∈ (TopOn‘ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆))) ∧ ((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) ⊆ (𝑆ko 𝑅)) → (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆) ⊆ ((𝑆ko 𝑅) Cn 𝑆))
3227, 29, 31syl2anc 584 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆) ⊆ ((𝑆ko 𝑅) Cn 𝑆))
3322resmptd 5994 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ↾ (𝑅 Cn 𝑆)) = (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓𝐴)))
34 simp3 1138 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → 𝐴𝑋)
3523, 19ptpjcn 23532 . . . . . 6 ((𝑋𝑅 ∧ (𝑋 × {𝑆}):𝑋⟶Top ∧ 𝐴𝑋) → (𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
366, 8, 34, 35syl3anc 1373 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)))
37 fvconst2g 7142 . . . . . . 7 ((𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
38373adant1 1130 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑋 × {𝑆})‘𝐴) = 𝑆)
3938oveq2d 7368 . . . . 5 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((∏t‘(𝑋 × {𝑆})) Cn ((𝑋 × {𝑆})‘𝐴)) = ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
4036, 39eleqtrd 2833 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn 𝑆))
4123cnrest 23206 . . . 4 (((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ∈ ((∏t‘(𝑋 × {𝑆})) Cn 𝑆) ∧ (𝑅 Cn 𝑆) ⊆ (∏t‘(𝑋 × {𝑆}))) → ((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ↾ (𝑅 Cn 𝑆)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
4240, 22, 41syl2anc 584 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → ((𝑓 (∏t‘(𝑋 × {𝑆})) ↦ (𝑓𝐴)) ↾ (𝑅 Cn 𝑆)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
4333, 42eqeltrrd 2832 . 2 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓𝐴)) ∈ (((∏t‘(𝑋 × {𝑆})) ↾t (𝑅 Cn 𝑆)) Cn 𝑆))
4432, 43sseldd 3930 1 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top ∧ 𝐴𝑋) → (𝑓 ∈ (𝑅 Cn 𝑆) ↦ (𝑓𝐴)) ∈ ((𝑆ko 𝑅) Cn 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1541  wcel 2111  Vcvv 3436  wss 3897  {csn 4575   cuni 4858  cmpt 5174   × cxp 5617  cres 5621  wf 6483  cfv 6487  (class class class)co 7352  m cmap 8756  t crest 17330  tcpt 17348  Topctop 22814  TopOnctopon 22831   Cn ccn 23145  ko cxko 23482
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 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674
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 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-iin 4944  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-ord 6315  df-on 6316  df-lim 6317  df-suc 6318  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-f1 6492  df-fo 6493  df-f1o 6494  df-fv 6495  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-1o 8391  df-2o 8392  df-map 8758  df-ixp 8828  df-en 8876  df-dom 8877  df-fin 8879  df-fi 9301  df-rest 17332  df-topgen 17353  df-pt 17354  df-top 22815  df-topon 22832  df-bases 22867  df-cn 23148  df-cmp 23308  df-xko 23484
This theorem is referenced by:  cnmptkp  23601  xkofvcn  23605
  Copyright terms: Public domain W3C validator