| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ptcls | Structured version Visualization version GIF version | ||
| Description: The closure of a box in the product topology is the box formed from the closures of the factors. This theorem is an AC equivalent. (Contributed by Mario Carneiro, 2-Sep-2015.) |
| Ref | Expression |
|---|---|
| ptcls.2 | ⊢ 𝐽 = (∏t‘(𝑘 ∈ 𝐴 ↦ 𝑅)) |
| ptcls.a | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| ptcls.j | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑅 ∈ (TopOn‘𝑋)) |
| ptcls.c | ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ 𝑋) |
| Ref | Expression |
|---|---|
| ptcls | ⊢ (𝜑 → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) = X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ptcls.2 | . 2 ⊢ 𝐽 = (∏t‘(𝑘 ∈ 𝐴 ↦ 𝑅)) | |
| 2 | ptcls.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 3 | ptcls.j | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑅 ∈ (TopOn‘𝑋)) | |
| 4 | ptcls.c | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ 𝑋) | |
| 5 | toponmax 23152 | . . . . . . 7 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝑅) | |
| 6 | 3, 5 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 ∈ 𝑅) |
| 7 | 6, 4 | ssexd 5289 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ∈ V) |
| 8 | 7 | ralrimiva 3154 | . . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑆 ∈ V) |
| 9 | iunexg 7961 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐴 𝑆 ∈ V) → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ V) | |
| 10 | 2, 8, 9 | syl2anc 596 | . . 3 ⊢ (𝜑 → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ V) |
| 11 | axac3 10467 | . . . 4 ⊢ CHOICE | |
| 12 | acacni 10144 | . . . 4 ⊢ ((CHOICE ∧ 𝐴 ∈ 𝑉) → AC 𝐴 = V) | |
| 13 | 11, 2, 12 | sylancr 599 | . . 3 ⊢ (𝜑 → AC 𝐴 = V) |
| 14 | 10, 13 | eleqtrrd 2863 | . 2 ⊢ (𝜑 → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴) |
| 15 | 1, 2, 3, 4, 14 | ptclsg 23842 | 1 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) = X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 Vcvv 3450 ⊆ wss 3899 ∪ ciun 4951 ↦ cmpt 5186 ‘cfv 6533 Xcixp 8905 AC wacn 9944 CHOICEwac 10119 ∏tcpt 17524 TopOnctopon 23136 clsccl 23244 |
| 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 7737 ax-ac2 10466 |
| 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-rmo 3365 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-iin 4954 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-se 5609 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-pred 6299 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-isom 6542 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-1o 8456 df-2o 8457 df-er 8697 df-map 8829 df-ixp 8906 df-en 8954 df-dom 8955 df-fin 8957 df-fi 9382 df-card 9945 df-acn 9948 df-ac 10120 df-topgen 17529 df-pt 17530 df-top 23120 df-topon 23137 df-bases 23172 df-cld 23245 df-ntr 23246 df-cls 23247 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |