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

Theorem prdstset 17387
Description: Structure product topology. (Contributed by Mario Carneiro, 15-Aug-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Revised by Zhi Wang, 18-Aug-2024.)
Hypotheses
Ref Expression
prdsbas.p 𝑃 = (𝑆Xs𝑅)
prdsbas.s (𝜑𝑆𝑉)
prdsbas.r (𝜑𝑅𝑊)
prdsbas.b 𝐵 = (Base‘𝑃)
prdsbas.i (𝜑 → dom 𝑅 = 𝐼)
prdstset.l 𝑂 = (TopSet‘𝑃)
Assertion
Ref Expression
prdstset (𝜑𝑂 = (∏t‘(TopOpen ∘ 𝑅)))

Proof of Theorem prdstset
Dummy variables 𝑎 𝑐 𝑑 𝑒 𝑓 𝑔 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prdsbas.p . . 3 𝑃 = (𝑆Xs𝑅)
2 eqid 2737 . . 3 (Base‘𝑆) = (Base‘𝑆)
3 prdsbas.i . . 3 (𝜑 → dom 𝑅 = 𝐼)
4 prdsbas.s . . . 4 (𝜑𝑆𝑉)
5 prdsbas.r . . . 4 (𝜑𝑅𝑊)
6 prdsbas.b . . . 4 𝐵 = (Base‘𝑃)
71, 4, 5, 6, 3prdsbas 17378 . . 3 (𝜑𝐵 = X𝑥𝐼 (Base‘(𝑅𝑥)))
8 eqid 2737 . . . 4 (+g𝑃) = (+g𝑃)
91, 4, 5, 6, 3, 8prdsplusg 17379 . . 3 (𝜑 → (+g𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(+g‘(𝑅𝑥))(𝑔𝑥)))))
10 eqid 2737 . . . 4 (.r𝑃) = (.r𝑃)
111, 4, 5, 6, 3, 10prdsmulr 17380 . . 3 (𝜑 → (.r𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑥𝐼 ↦ ((𝑓𝑥)(.r‘(𝑅𝑥))(𝑔𝑥)))))
12 eqid 2737 . . . 4 ( ·𝑠𝑃) = ( ·𝑠𝑃)
131, 4, 5, 6, 3, 2, 12prdsvsca 17381 . . 3 (𝜑 → ( ·𝑠𝑃) = (𝑓 ∈ (Base‘𝑆), 𝑔𝐵 ↦ (𝑥𝐼 ↦ (𝑓( ·𝑠 ‘(𝑅𝑥))(𝑔𝑥)))))
14 eqidd 2738 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥))))))
15 eqidd 2738 . . 3 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) = (∏t‘(TopOpen ∘ 𝑅)))
16 eqid 2737 . . . 4 (le‘𝑃) = (le‘𝑃)
171, 4, 5, 6, 3, 16prdsle 17383 . . 3 (𝜑 → (le‘𝑃) = {⟨𝑓, 𝑔⟩ ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥𝐼 (𝑓𝑥)(le‘(𝑅𝑥))(𝑔𝑥))})
18 eqid 2737 . . . 4 (dist‘𝑃) = (dist‘𝑃)
191, 4, 5, 6, 3, 18prdsds 17385 . . 3 (𝜑 → (dist‘𝑃) = (𝑓𝐵, 𝑔𝐵 ↦ sup((ran (𝑥𝐼 ↦ ((𝑓𝑥)(dist‘(𝑅𝑥))(𝑔𝑥))) ∪ {0}), ℝ*, < )))
20 eqidd 2738 . . 3 (𝜑 → (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))) = (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥))))
21 eqidd 2738 . . 3 (𝜑 → (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))) = (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥))))))
221, 2, 3, 7, 9, 11, 13, 14, 15, 17, 19, 20, 21, 4, 5prdsval 17376 . 2 (𝜑𝑃 = (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), ( ·𝑠𝑃)⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})))
23 prdstset.l . 2 𝑂 = (TopSet‘𝑃)
24 tsetid 17274 . 2 TopSet = Slot (TopSet‘ndx)
25 fvexd 6847 . 2 (𝜑 → (∏t‘(TopOpen ∘ 𝑅)) ∈ V)
26 snsstp1 4760 . . . 4 {⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩} ⊆ {⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩}
27 ssun1 4119 . . . 4 {⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ⊆ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})
2826, 27sstri 3932 . . 3 {⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩} ⊆ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩})
29 ssun2 4120 . . 3 ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}) ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), ( ·𝑠𝑃)⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
3028, 29sstri 3932 . 2 {⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩} ⊆ (({⟨(Base‘ndx), 𝐵⟩, ⟨(+g‘ndx), (+g𝑃)⟩, ⟨(.r‘ndx), (.r𝑃)⟩} ∪ {⟨(Scalar‘ndx), 𝑆⟩, ⟨( ·𝑠 ‘ndx), ( ·𝑠𝑃)⟩, ⟨(·𝑖‘ndx), (𝑓𝐵, 𝑔𝐵 ↦ (𝑆 Σg (𝑥𝐼 ↦ ((𝑓𝑥)(·𝑖‘(𝑅𝑥))(𝑔𝑥)))))⟩}) ∪ ({⟨(TopSet‘ndx), (∏t‘(TopOpen ∘ 𝑅))⟩, ⟨(le‘ndx), (le‘𝑃)⟩, ⟨(dist‘ndx), (dist‘𝑃)⟩} ∪ {⟨(Hom ‘ndx), (𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))⟩, ⟨(comp‘ndx), (𝑎 ∈ (𝐵 × 𝐵), 𝑐𝐵 ↦ (𝑑 ∈ ((2nd𝑎)(𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))𝑐), 𝑒 ∈ ((𝑓𝐵, 𝑔𝐵X𝑥𝐼 ((𝑓𝑥)(Hom ‘(𝑅𝑥))(𝑔𝑥)))‘𝑎) ↦ (𝑥𝐼 ↦ ((𝑑𝑥)(⟨((1st𝑎)‘𝑥), ((2nd𝑎)‘𝑥)⟩(comp‘(𝑅𝑥))(𝑐𝑥))(𝑒𝑥)))))⟩}))
3122, 23, 24, 25, 30prdsbaslem 17374 1 (𝜑𝑂 = (∏t‘(TopOpen ∘ 𝑅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3430  cun 3888  {csn 4568  {cpr 4570  {ctp 4572  cop 4574  cmpt 5167   × cxp 5620  dom cdm 5622  ccom 5626  cfv 6490  (class class class)co 7358  cmpo 7360  1st c1st 7931  2nd c2nd 7932  Xcixp 8836  ndxcnx 17121  Basecbs 17137  +gcplusg 17178  .rcmulr 17179  Scalarcsca 17181   ·𝑠 cvsca 17182  ·𝑖cip 17183  TopSetcts 17184  lecple 17185  distcds 17187  Hom chom 17189  compcco 17190  TopOpenctopn 17342  tcpt 17359   Σg cgsu 17361  Xscprds 17366
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 2709  ax-sep 5231  ax-nul 5241  ax-pow 5300  ax-pr 5368  ax-un 7680  ax-cnex 11083  ax-resscn 11084  ax-1cn 11085  ax-icn 11086  ax-addcl 11087  ax-addrcl 11088  ax-mulcl 11089  ax-mulrcl 11090  ax-mulcom 11091  ax-addass 11092  ax-mulass 11093  ax-distr 11094  ax-i2m1 11095  ax-1ne0 11096  ax-1rid 11097  ax-rnegex 11098  ax-rrecex 11099  ax-cnre 11100  ax-pre-lttri 11101  ax-pre-lttrn 11102  ax-pre-ltadd 11103  ax-pre-mulgt0 11104
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-1o 8396  df-er 8634  df-map 8766  df-ixp 8837  df-en 8885  df-dom 8886  df-sdom 8887  df-fin 8888  df-sup 9346  df-pnf 11169  df-mnf 11170  df-xr 11171  df-ltxr 11172  df-le 11173  df-sub 11367  df-neg 11368  df-nn 12147  df-2 12209  df-3 12210  df-4 12211  df-5 12212  df-6 12213  df-7 12214  df-8 12215  df-9 12216  df-n0 12403  df-z 12490  df-dec 12609  df-uz 12753  df-fz 13425  df-struct 17075  df-slot 17110  df-ndx 17122  df-base 17138  df-plusg 17191  df-mulr 17192  df-sca 17194  df-vsca 17195  df-ip 17196  df-tset 17197  df-ple 17198  df-ds 17200  df-hom 17202  df-cco 17203  df-prds 17368
This theorem is referenced by:  prdshom  17388  prdsco  17389  prdstopn  23571  prdstps  23572
  Copyright terms: Public domain W3C validator