| 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 2760 | . 2 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 6 | eqid 2760 | . 2 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
| 7 | eqid 2760 | . 2 ⊢ (𝑥 ∈ (Base‘𝑅), 𝑦 ∈ (Base‘𝑆) ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) = (𝑥 ∈ (Base‘𝑅), 𝑦 ∈ (Base‘𝑆) ↦ {〈∅, 𝑥〉, 〈1o, 𝑦〉}) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | xpstopnlem2 24037 | 1 ⊢ ((𝑅 ∈ TopSp ∧ 𝑆 ∈ TopSp) → 𝑂 = (𝐽 ×t 𝐾)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∅c0 4279 {cpr 4586 〈cop 4590 ‘cfv 6533 (class class class)co 7413 ∈ cmpo 7415 1oc1o 8448 Basecbs 17301 TopOpenctopn 17506 ×s cxps 17592 TopSpctps 23157 ×t ctx 23786 |
| 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 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| 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-nel 3062 df-ral 3077 df-rex 3087 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-tp 4589 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-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-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-map 8828 df-ixp 8905 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-fi 9381 df-sup 9412 df-inf 9413 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12529 df-z 12616 df-dec 12737 df-uz 12888 df-fz 13562 df-struct 17239 df-slot 17274 df-ndx 17286 df-base 17302 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-tset 17361 df-ple 17362 df-ds 17364 df-hom 17366 df-cco 17367 df-rest 17507 df-topn 17508 df-topgen 17528 df-pt 17529 df-prds 17532 df-qtop 17593 df-imas 17594 df-xps 17596 df-top 23119 df-topon 23136 df-topsp 23158 df-bases 23171 df-cn 23452 df-cnp 23453 df-tx 23788 df-hmeo 23981 |
| This theorem is used by: tmsxpsmopn 24763 |
| Copyright terms: Public domain | W3C validator |