| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ptunimpt | Structured version Visualization version GIF version | ||
| Description: Base set of a product topology given by substitution. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
| Ref | Expression |
|---|---|
| ptunimpt.j | ⊢ 𝐽 = (∏t‘(𝑥 ∈ 𝐴 ↦ 𝐾)) |
| Ref | Expression |
|---|---|
| ptunimpt | ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ 𝐽) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2736 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐾) = (𝑥 ∈ 𝐴 ↦ 𝐾) | |
| 2 | 1 | fvmpt2 6959 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐾 ∈ Top) → ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥) = 𝐾) |
| 3 | 2 | eqcomd 2742 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐾 ∈ Top) → 𝐾 = ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) |
| 4 | 3 | unieqd 4863 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐾 ∈ Top) → ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) |
| 5 | 4 | ralimiaa 3073 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐾 ∈ Top → ∀𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) |
| 6 | 5 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → ∀𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) |
| 7 | ixpeq2 8859 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥) → X𝑥 ∈ 𝐴 ∪ 𝐾 = X𝑥 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) | |
| 8 | 6, 7 | syl 17 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = X𝑥 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) |
| 9 | nffvmpt1 6851 | . . . . 5 ⊢ Ⅎ𝑥((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) | |
| 10 | 9 | nfuni 4857 | . . . 4 ⊢ Ⅎ𝑥∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) |
| 11 | nfcv 2898 | . . . 4 ⊢ Ⅎ𝑦∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥) | |
| 12 | fveq2 6840 | . . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) | |
| 13 | 12 | unieqd 4863 | . . . 4 ⊢ (𝑦 = 𝑥 → ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥)) |
| 14 | 10, 11, 13 | cbvixp 8862 | . . 3 ⊢ X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = X𝑥 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑥) |
| 15 | 8, 14 | eqtr4di 2789 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦)) |
| 16 | 1 | fmpt 7062 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐾 ∈ Top ↔ (𝑥 ∈ 𝐴 ↦ 𝐾):𝐴⟶Top) |
| 17 | ptunimpt.j | . . . 4 ⊢ 𝐽 = (∏t‘(𝑥 ∈ 𝐴 ↦ 𝐾)) | |
| 18 | 17 | ptuni 23559 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑥 ∈ 𝐴 ↦ 𝐾):𝐴⟶Top) → X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ∪ 𝐽) |
| 19 | 16, 18 | sylan2b 595 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑦 ∈ 𝐴 ∪ ((𝑥 ∈ 𝐴 ↦ 𝐾)‘𝑦) = ∪ 𝐽) |
| 20 | 15, 19 | eqtrd 2771 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 𝐾 ∈ Top) → X𝑥 ∈ 𝐴 ∪ 𝐾 = ∪ 𝐽) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 ∪ cuni 4850 ↦ cmpt 5166 ⟶wf 6494 ‘cfv 6498 Xcixp 8845 ∏tcpt 17401 Topctop 22858 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-om 7818 df-1o 8405 df-2o 8406 df-ixp 8846 df-en 8894 df-fin 8897 df-fi 9324 df-topgen 17406 df-pt 17407 df-top 22859 df-bases 22911 |
| This theorem is referenced by: pttopon 23561 kelac1 43491 |
| Copyright terms: Public domain | W3C validator |