| 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 2765 | . 2 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 6 | eqid 2765 | . 2 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 7 | eqid 2765 | . 2 ⊢ (𝑥 ∈ (Base‘𝑅), 𝑦 ∈ (Base‘𝑆) ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) = (𝑥 ∈ (Base‘𝑅), 𝑦 ∈ (Base‘𝑆) ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | xpstopnlem2 23925 | 1 ⊢ ((𝑅 ∈ TopSp ∧ 𝑆 ∈ TopSp) → 𝑂 = (𝐽 ×t 𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∅c0 4288 {cpr 4587 〈cop 4591 ‘cfv 6525 (class class class)co 7400 ∈ cmpo 7402 1oc1o 8434 Basecbs 17257 TopOpenctopn 17462 ×s cxps 17548 TopSpctps 23046 ×t ctx 23674 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-er 8682 df-map 8814 df-ixp 8884 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-fi 9359 df-sup 9390 df-inf 9391 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12222 df-2 12291 df-3 12292 df-4 12293 df-5 12294 df-6 12295 df-7 12296 df-8 12297 df-9 12298 df-n0 12493 df-z 12580 df-dec 12700 df-uz 12851 df-fz 13524 df-struct 17195 df-slot 17230 df-ndx 17242 df-base 17258 df-plusg 17311 df-mulr 17312 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-hom 17322 df-cco 17323 df-rest 17463 df-topn 17464 df-topgen 17484 df-pt 17485 df-prds 17488 df-qtop 17549 df-imas 17550 df-xps 17552 df-top 23008 df-topon 23025 df-topsp 23047 df-bases 23060 df-cn 23341 df-cnp 23342 df-tx 23676 df-hmeo 23869 |
| This theorem is referenced by: tmsxpsmopn 24651 |
| Copyright terms: Public domain | W3C validator |