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

Theorem ptunimpt 23971
Description: Base set of a product topology given by substitution. (Contributed by Stefan O'Rear, 22-Feb-2015.)
Hypothesis
Ref Expression
ptunimpt.j 𝐽 = (∏t‘(𝑥 ∈ 𝐴 ↦ 𝐾))
Assertion
Ref Expression
ptunimpt ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ 𝐽)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐽(𝑥)   𝐾(𝑥)   𝑉(𝑥)

Proof of Theorem ptunimpt
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqid 2766 . . . . . . . . 9 (𝑥 ∈ 𝐴 ↦ 𝐾) = (𝑥 ∈ 𝐴 ↦ 𝐾)
21fvmpt2 7035 . . . . . . . 8 ((𝑥 ∈ 𝐴 ∧ 𝐾 ∈ Top) → ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥) = 𝐾)
32eqcomd 2772 . . . . . . 7 ((𝑥 ∈ 𝐴 ∧ 𝐾 ∈ Top) → 𝐾 = ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
43unieqd 4884 . . . . . 6 ((𝑥 ∈ 𝐴 ∧ 𝐾 ∈ Top) → ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
54ralimiaa 3105 . . . . 5 (∀𝑥 ∈ 𝐴 𝐾 ∈ Top → ∀𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
65adantl 487 . . . 4 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → ∀𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
7 ixpeq2 8976 . . . 4 (∀𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥) → X𝑥 ∈ 𝐴 ∪ 𝐾 = X𝑥 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
86, 7syl 18 . . 3 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = X𝑥 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
9 nffvmpt1 6926 . . . . 5 Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦)
109nfuni 4878 . . . 4 Ⅎ𝑥∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦)
11 nfcv 2929 . . . 4 Ⅎ𝑦∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)
12 fveq2 6915 . . . . 5 (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
1312unieqd 4884 . . . 4 (𝑦 = 𝑥 → ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥))
1410, 11, 13cbvixp 8979 . . 3 X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = X𝑥 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)
158, 14eqtr4di 2819 . 2 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦))
161fmpt 7141 . . 3 (∀𝑥 ∈ 𝐴 𝐾 ∈ Top ↔ (𝑥 ∈ 𝐴 ↦ 𝐾):𝐴⟶Top)
17 ptunimpt.j . . . 4 𝐽 = (∏t‘(𝑥 ∈ 𝐴 ↦ 𝐾))
1817ptuni 23970 . . 3 ((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ↦ 𝐾):𝐴⟶Top) → X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ∪ 𝐽)
1916, 18sylan2b 606 . 2 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ∪ 𝐽)
2015, 19eqtrd 2801 1 ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ 𝐽)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083  ∪ cuni 4871   ↦ cmpt 5191  ⟶wf 6561  ‘cfv 6565  Xcixp 8962  ∏tcpt 17661  Topctop 23268
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-om 7911  df-1o 8513  df-2o 8514  df-ixp 8963  df-en 9011  df-fin 9014  df-fi 9439  df-topgen 17666  df-pt 17667  df-top 23269  df-bases 23321
This theorem is used by:  pttopon  23972  kelac1  44330  tmachlem-tpbase  48282
  Copyright terms: Public domain W3C validator