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

Theorem ptval 23043
Description: The value of the product topology function. (Contributed by Mario Carneiro, 3-Feb-2015.)
Hypothesis
Ref Expression
ptval.1 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑥 = X𝑦𝐴 (𝑔𝑦))}
Assertion
Ref Expression
ptval ((𝐴𝑉𝐹 Fn 𝐴) → (∏t𝐹) = (topGen‘𝐵))
Distinct variable groups:   𝑥,𝑔,𝑦,𝑧,𝐴   𝑔,𝐹,𝑥,𝑦,𝑧   𝑔,𝑉,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐵(𝑥,𝑦,𝑧,𝑔)

Proof of Theorem ptval
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 df-pt 17377 . 2 t = (𝑓 ∈ V ↦ (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔𝑦))}))
2 simpr 486 . . . . . . . . . . 11 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
32dmeqd 5900 . . . . . . . . . 10 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → dom 𝑓 = dom 𝐹)
4 fndm 6644 . . . . . . . . . . 11 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
54ad2antlr 726 . . . . . . . . . 10 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → dom 𝐹 = 𝐴)
63, 5eqtrd 2773 . . . . . . . . 9 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → dom 𝑓 = 𝐴)
76fneq2d 6635 . . . . . . . 8 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (𝑔 Fn dom 𝑓𝑔 Fn 𝐴))
82fveq1d 6883 . . . . . . . . . 10 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (𝑓𝑦) = (𝐹𝑦))
98eleq2d 2820 . . . . . . . . 9 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → ((𝑔𝑦) ∈ (𝑓𝑦) ↔ (𝑔𝑦) ∈ (𝐹𝑦)))
106, 9raleqbidv 3343 . . . . . . . 8 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ↔ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦)))
116difeq1d 4119 . . . . . . . . . 10 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (dom 𝑓𝑧) = (𝐴𝑧))
128unieqd 4918 . . . . . . . . . . 11 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (𝑓𝑦) = (𝐹𝑦))
1312eqeq2d 2744 . . . . . . . . . 10 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → ((𝑔𝑦) = (𝑓𝑦) ↔ (𝑔𝑦) = (𝐹𝑦)))
1411, 13raleqbidv 3343 . . . . . . . . 9 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦) ↔ ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)))
1514rexbidv 3179 . . . . . . . 8 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦) ↔ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)))
167, 10, 153anbi123d 1437 . . . . . . 7 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → ((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦)) ↔ (𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦))))
176ixpeq1d 8891 . . . . . . . 8 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → X𝑦 ∈ dom 𝑓(𝑔𝑦) = X𝑦𝐴 (𝑔𝑦))
1817eqeq2d 2744 . . . . . . 7 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (𝑥 = X𝑦 ∈ dom 𝑓(𝑔𝑦) ↔ 𝑥 = X𝑦𝐴 (𝑔𝑦)))
1916, 18anbi12d 632 . . . . . 6 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔𝑦)) ↔ ((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑥 = X𝑦𝐴 (𝑔𝑦))))
2019exbidv 1925 . . . . 5 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔𝑦)) ↔ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑥 = X𝑦𝐴 (𝑔𝑦))))
2120abbidv 2802 . . . 4 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑥 = X𝑦𝐴 (𝑔𝑦))})
22 ptval.1 . . . 4 𝐵 = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦𝐴 (𝑔𝑦) ∈ (𝐹𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴𝑧)(𝑔𝑦) = (𝐹𝑦)) ∧ 𝑥 = X𝑦𝐴 (𝑔𝑦))}
2321, 22eqtr4di 2791 . . 3 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔𝑦))} = 𝐵)
2423fveq2d 6885 . 2 (((𝐴𝑉𝐹 Fn 𝐴) ∧ 𝑓 = 𝐹) → (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔𝑦) ∈ (𝑓𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓𝑧)(𝑔𝑦) = (𝑓𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔𝑦))}) = (topGen‘𝐵))
25 fnex 7206 . . 3 ((𝐹 Fn 𝐴𝐴𝑉) → 𝐹 ∈ V)
2625ancoms 460 . 2 ((𝐴𝑉𝐹 Fn 𝐴) → 𝐹 ∈ V)
27 fvexd 6896 . 2 ((𝐴𝑉𝐹 Fn 𝐴) → (topGen‘𝐵) ∈ V)
281, 24, 26, 27fvmptd2 6995 1 ((𝐴𝑉𝐹 Fn 𝐴) → (∏t𝐹) = (topGen‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  w3a 1088   = wceq 1542  wex 1782  wcel 2107  {cab 2710  wral 3062  wrex 3071  Vcvv 3475  cdif 3943   cuni 4904  dom cdm 5672   Fn wfn 6530  cfv 6535  Xcixp 8879  Fincfn 8927  topGenctg 17370  tcpt 17371
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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5281  ax-sep 5295  ax-nul 5302  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3776  df-csb 3892  df-dif 3949  df-un 3951  df-in 3953  df-ss 3963  df-nul 4321  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4905  df-iun 4995  df-br 5145  df-opab 5207  df-mpt 5228  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6487  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-ixp 8880  df-pt 17377
This theorem is referenced by:  pttop  23055  ptopn  23056  ptuni  23067  ptval2  23074  ptpjcn  23084  ptpjopn  23085  ptclsg  23088  ptcnp  23095  prdstopn  23101  xkoptsub  23127  ptcmplem1  23525  tmdgsum2  23569  prdsxmslem2  24007  ptrecube  36393
  Copyright terms: Public domain W3C validator