| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpstopn | Structured version Visualization version GIF version | ||
| Description: The topology on a binary product of topological spaces, as we have defined it (transferring the indexed product topology on functions on {∅, 1o} to (𝑋 × 𝑌) by the canonical bijection), coincides with the usual topological product (generated by a base of rectangles). (Contributed by Mario Carneiro, 27-Aug-2015.) |
| Ref | Expression |
|---|---|
| xpstps.t | ⊢ 𝑇 = (𝑅 ×s 𝑆) |
| xpstopn.j | ⊢ 𝐽 = (TopOpen‘𝑅) |
| xpstopn.k | ⊢ 𝐾 = (TopOpen‘𝑆) |
| xpstopn.o | ⊢ 𝑂 = (TopOpen‘𝑇) |
| Ref | Expression |
|---|---|
| xpstopn | ⊢ ((𝑅 ∈ TopSp ∧ 𝑆 ∈ TopSp) → 𝑂 = (𝐽 ×t 𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpstps.t | . 2 ⊢ 𝑇 = (𝑅 ×s 𝑆) | |
| 2 | xpstopn.j | . 2 ⊢ 𝐽 = (TopOpen‘𝑅) | |
| 3 | xpstopn.k | . 2 ⊢ 𝐾 = (TopOpen‘𝑆) | |
| 4 | xpstopn.o | . 2 ⊢ 𝑂 = (TopOpen‘𝑇) | |
| 5 | eqid 2761 | . 2 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 6 | eqid 2761 | . 2 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 7 | eqid 2761 | . 2 ⊢ (𝑥 ∈ (Base‘𝑅), 𝑦 ∈ (Base‘𝑆) ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) = (𝑥 ∈ (Base‘𝑅), 𝑦 ∈ (Base‘𝑆) ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | xpstopnlem2 23858 | 1 ⊢ ((𝑅 ∈ TopSp ∧ 𝑆 ∈ TopSp) → 𝑂 = (𝐽 ×t 𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∅c0 4283 {cpr 4581 〈cop 4585 ‘cfv 6515 (class class class)co 7390 ∈ cmpo 7392 1oc1o 8423 Basecbs 17235 TopOpenctopn 17440 ×s cxps 17526 TopSpctps 22979 ×t ctx 23607 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 ax-cnex 11122 ax-resscn 11123 ax-1cn 11124 ax-icn 11125 ax-addcl 11126 ax-addrcl 11127 ax-mulcl 11128 ax-mulrcl 11129 ax-mulcom 11130 ax-addass 11131 ax-mulass 11132 ax-distr 11133 ax-i2m1 11134 ax-1ne0 11135 ax-1rid 11136 ax-rnegex 11137 ax-rrecex 11138 ax-cnre 11139 ax-pre-lttri 11140 ax-pre-lttrn 11141 ax-pre-ltadd 11142 ax-pre-mulgt0 11143 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-2o 8431 df-er 8671 df-map 8803 df-ixp 8873 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-fi 9350 df-sup 9381 df-inf 9382 df-pnf 11211 df-mnf 11212 df-xr 11213 df-ltxr 11214 df-le 11215 df-sub 11409 df-neg 11410 df-nn 12204 df-2 12273 df-3 12274 df-4 12275 df-5 12276 df-6 12277 df-7 12278 df-8 12279 df-9 12280 df-n0 12475 df-z 12562 df-dec 12682 df-uz 12833 df-fz 13506 df-struct 17173 df-slot 17208 df-ndx 17220 df-base 17236 df-plusg 17289 df-mulr 17290 df-sca 17292 df-vsca 17293 df-ip 17294 df-tset 17295 df-ple 17296 df-ds 17298 df-hom 17300 df-cco 17301 df-rest 17441 df-topn 17442 df-topgen 17462 df-pt 17463 df-prds 17466 df-qtop 17527 df-imas 17528 df-xps 17530 df-top 22941 df-topon 22958 df-topsp 22980 df-bases 22993 df-cn 23274 df-cnp 23275 df-tx 23609 df-hmeo 23802 |
| This theorem is referenced by: tmsxpsmopn 24584 |
| Copyright terms: Public domain | W3C validator |