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

Theorem ptuni 22745
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 2738 . . . 4 {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}
21ptbas 22730 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))} ∈ TopBases)
3 unitg 22117 . . 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 6600 . . . . 5 (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
71ptval 22721 . . . . 5 ((𝐴𝑉𝐹 Fn 𝐴) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
86, 7sylan2 593 . . . 4 ((𝐴𝑉𝐹:𝐴⟶Top) → (∏t𝐹) = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
95, 8eqtrid 2790 . . 3 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
109unieqd 4853 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))}))
111ptuni2 22727 . 2 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = {𝑘 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑘 = X𝑦𝐴 (𝑔𝑦))})
124, 10, 113eqtr4rd 2789 1 ((𝐴𝑉𝐹:𝐴⟶Top) → X𝑥𝐴 (𝐹𝑥) = 𝐽)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1086   = wceq 1539  wex 1782  wcel 2106  {cab 2715  wral 3064  wrex 3065  cdif 3884   cuni 4839   Fn wfn 6428  wf 6429  cfv 6433  Xcixp 8685  Fincfn 8733  topGenctg 17148  tcpt 17149  Topctop 22042  TopBasesctb 22095
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-om 7713  df-1o 8297  df-er 8498  df-ixp 8686  df-en 8734  df-fin 8737  df-fi 9170  df-topgen 17154  df-pt 17155  df-top 22043  df-bases 22096
This theorem is referenced by:  ptunimpt  22746  ptval2  22752  ptpjcn  22762  ptcld  22764  ptcn  22778  pthaus  22789  ptrescn  22790  ptuncnv  22958  ptunhmeo  22959  ptcmpfi  22964  ptcmplem1  23203  ptcmpg  23208  ptpconn  33195  ptrest  35776
  Copyright terms: Public domain W3C validator