| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tgpmulg2 | Structured version Visualization version GIF version | ||
| Description: In a topological monoid, the group multiple function is jointly continuous (although this is not saying much as one of the factors is discrete). Use zdis 25044 to write the left topology as a subset of the complex numbers. (Contributed by Mario Carneiro, 19-Sep-2015.) |
| Ref | Expression |
|---|---|
| tgpmulg.j | ⊢ 𝐽 = (TopOpen‘𝐺) |
| tgpmulg.t | ⊢ · = (.g‘𝐺) |
| Ref | Expression |
|---|---|
| tgpmulg2 | ⊢ (𝐺 ∈ TopGrp → · ∈ ((𝒫 ℤ ×t 𝐽) Cn 𝐽)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zex 12625 | . . 3 ⊢ ℤ ∈ V | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐺 ∈ TopGrp → ℤ ∈ V) |
| 3 | tgpmulg.j | . . 3 ⊢ 𝐽 = (TopOpen‘𝐺) | |
| 4 | eqid 2760 | . . 3 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 5 | 3, 4 | tgptopon 24309 | . 2 ⊢ (𝐺 ∈ TopGrp → 𝐽 ∈ (TopOn‘(Base‘𝐺))) |
| 6 | topontop 23139 | . . 3 ⊢ (𝐽 ∈ (TopOn‘(Base‘𝐺)) → 𝐽 ∈ Top) | |
| 7 | 5, 6 | syl 18 | . 2 ⊢ (𝐺 ∈ TopGrp → 𝐽 ∈ Top) |
| 8 | tgpmulg.t | . . . 4 ⊢ · = (.g‘𝐺) | |
| 9 | 4, 8 | mulgfn 19196 | . . 3 ⊢ · Fn (ℤ × (Base‘𝐺)) |
| 10 | 9 | a1i 11 | . 2 ⊢ (𝐺 ∈ TopGrp → · Fn (ℤ × (Base‘𝐺))) |
| 11 | 3, 8, 4 | tgpmulg 24320 | . 2 ⊢ ((𝐺 ∈ TopGrp ∧ 𝑛 ∈ ℤ) → (𝑥 ∈ (Base‘𝐺) ↦ (𝑛 · 𝑥)) ∈ (𝐽 Cn 𝐽)) |
| 12 | 2, 5, 7, 10, 11 | txdis1cn 23862 | 1 ⊢ (𝐺 ∈ TopGrp → · ∈ ((𝒫 ℤ ×t 𝐽) Cn 𝐽)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3450 𝒫 cpw 4557 × cxp 5653 Fn wfn 6528 ‘cfv 6533 (class class class)co 7414 ℤcz 12616 Basecbs 17302 TopOpenctopn 17507 .gcmg 19191 Topctop 23119 TopOnctopon 23136 Cn ccn 23450 ×t ctx 23787 TopGrpctgp 24298 |
| 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-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| 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-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-iun 4953 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 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-rdg 8400 df-er 8697 df-map 8829 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-n0 12530 df-z 12617 df-uz 12889 df-seq 14067 df-0g 17527 df-topgen 17529 df-plusf 18730 df-mgm 18731 df-sgrp 18822 df-mnd 18838 df-mulg 19192 df-top 23120 df-topon 23137 df-topsp 23159 df-bases 23172 df-cn 23453 df-cnp 23454 df-tx 23789 df-tmd 24299 df-tgp 24300 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |