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

Theorem ptuni 23536
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 2734 . . . 4 {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}
21ptbas 23521 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} ∈ TopBases)
3 unitg 22909 . . 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 6660 . . . . 5 (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
71ptval 23512 . . . . 5 ((𝐴𝑉𝐹 Fn 𝐴) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
86, 7sylan2 593 . . . 4 ((𝐴𝑉𝐹:𝐴⟶Top) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
95, 8eqtrid 2781 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
109unieqd 4874 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
111ptuni2 23518 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
124, 10, 113eqtr4rd 2780 1 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = 𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1541  wex 1780  wcel 2113  {cab 2712  wral 3049  wrex 3058  cdif 3896   cuni 4861   Fn wfn 6485  wf 6486  cfv 6490  Xcixp 8833  Fincfn 8881  topGenctg 17355  tcpt 17356  Topctop 22835  TopBasesctb 22887
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
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 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-int 4901  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-tr 5204  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-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-om 7807  df-1o 8395  df-2o 8396  df-ixp 8834  df-en 8882  df-fin 8885  df-fi 9312  df-topgen 17361  df-pt 17362  df-top 22836  df-bases 22888
This theorem is referenced by:  ptunimpt  23537  ptval2  23543  ptpjcn  23553  ptcld  23555  ptcn  23569  pthaus  23580  ptrescn  23581  ptuncnv  23749  ptunhmeo  23750  ptcmpfi  23755  ptcmplem1  23994  ptcmpg  23999  ptpconn  35376  ptrest  37759
  Copyright terms: Public domain W3C validator