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

Theorem ptuni 23820
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 2760 . . . 4 {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}
21ptbas 23805 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} ∈ TopBases)
3 unitg 23192 . . 3 ({𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} ∈ TopBases → (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
42, 3syl 18 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
5 ptuni.1 . . . 4 𝐽 = (∏t𝐹)
6 ffn 6702 . . . . 5 (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
71ptval 23796 . . . . 5 ((𝐴𝑉𝐹 Fn 𝐴) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
86, 7sylan2 605 . . . 4 ((𝐴𝑉𝐹:𝐴⟶Top) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
95, 8eqtrid 2807 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
109unieqd 4880 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
111ptuni2 23802 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
124, 10, 113eqtr4rd 2806 1 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = 𝐽)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wex 1812  wcel 2145  {cab 2738  wral 3076  wrex 3086  cdif 3896   cuni 4867   Fn wfn 6528  wf 6529  cfv 6533  Xcixp 8904  Fincfn 8952  topGenctg 17522  tcpt 17523  Topctop 23118  TopBasesctb 23170
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-om 7863  df-1o 8455  df-2o 8456  df-ixp 8905  df-en 8953  df-fin 8956  df-fi 9381  df-topgen 17528  df-pt 17529  df-top 23119  df-bases 23171
This theorem is used by:  ptunimpt  23821  ptval2  23827  ptpjcn  23837  ptcld  23839  ptcn  23853  pthaus  23864  ptrescn  23865  ptuncnv  24033  ptunhmeo  24034  ptcmpfi  24039  ptcmplem1  24278  ptcmpg  24283  ptpconn  35812  ptrest  38368
  Copyright terms: Public domain W3C validator