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

Theorem ptuni 23479
Description: The base set for the product topology. (Contributed by Mario Carneiro, 3-Feb-2015.)
Hypothesis
Ref Expression
ptuni.1 𝐽 = (∏t𝐹)
Assertion
Ref Expression
ptuni ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = 𝐽)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝑉
Allowed substitution hint:   𝐽(𝑥)

Proof of Theorem ptuni
Dummy variables 𝑔 𝑘 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2729 . . . 4 {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}
21ptbas 23464 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} ∈ TopBases)
3 unitg 22852 . . 3 ({𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} ∈ TopBases → (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
42, 3syl 17 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
5 ptuni.1 . . . 4 𝐽 = (∏t𝐹)
6 ffn 6652 . . . . 5 (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
71ptval 23455 . . . . 5 ((𝐴𝑉𝐹 Fn 𝐴) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
86, 7sylan2 593 . . . 4 ((𝐴𝑉𝐹:𝐴⟶Top) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
95, 8eqtrid 2776 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
109unieqd 4871 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
111ptuni2 23461 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
124, 10, 113eqtr4rd 2775 1 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = 𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wex 1779  wcel 2109  {cab 2707  wral 3044  wrex 3053  cdif 3900   cuni 4858   Fn wfn 6477  wf 6478  cfv 6482  Xcixp 8824  Fincfn 8872  topGenctg 17341  tcpt 17342  Topctop 22778  TopBasesctb 22830
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 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671
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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  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 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-om 7800  df-1o 8388  df-2o 8389  df-ixp 8825  df-en 8873  df-fin 8876  df-fi 9301  df-topgen 17347  df-pt 17348  df-top 22779  df-bases 22831
This theorem is referenced by:  ptunimpt  23480  ptval2  23486  ptpjcn  23496  ptcld  23498  ptcn  23512  pthaus  23523  ptrescn  23524  ptuncnv  23692  ptunhmeo  23693  ptcmpfi  23698  ptcmplem1  23937  ptcmpg  23942  ptpconn  35206  ptrest  37599
  Copyright terms: Public domain W3C validator