Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > indistgp | Structured version Visualization version GIF version |
Description: Any group equipped with the indiscrete topology is a topological group. (Contributed by Mario Carneiro, 14-Aug-2015.) |
Ref | Expression |
---|---|
distgp.1 | ⊢ 𝐵 = (Base‘𝐺) |
distgp.2 | ⊢ 𝐽 = (TopOpen‘𝐺) |
Ref | Expression |
---|---|
indistgp | ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → 𝐺 ∈ TopGrp) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 485 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → 𝐺 ∈ Grp) | |
2 | simpr 487 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → 𝐽 = {∅, 𝐵}) | |
3 | distgp.1 | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
4 | 3 | fvexi 6678 | . . . . 5 ⊢ 𝐵 ∈ V |
5 | indistopon 21603 | . . . . 5 ⊢ (𝐵 ∈ V → {∅, 𝐵} ∈ (TopOn‘𝐵)) | |
6 | 4, 5 | ax-mp 5 | . . . 4 ⊢ {∅, 𝐵} ∈ (TopOn‘𝐵) |
7 | 2, 6 | eqeltrdi 2921 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → 𝐽 ∈ (TopOn‘𝐵)) |
8 | distgp.2 | . . . 4 ⊢ 𝐽 = (TopOpen‘𝐺) | |
9 | 3, 8 | istps 21536 | . . 3 ⊢ (𝐺 ∈ TopSp ↔ 𝐽 ∈ (TopOn‘𝐵)) |
10 | 7, 9 | sylibr 236 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → 𝐺 ∈ TopSp) |
11 | eqid 2821 | . . . . . 6 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
12 | 3, 11 | grpsubf 18172 | . . . . 5 ⊢ (𝐺 ∈ Grp → (-g‘𝐺):(𝐵 × 𝐵)⟶𝐵) |
13 | 12 | adantr 483 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → (-g‘𝐺):(𝐵 × 𝐵)⟶𝐵) |
14 | 4, 4 | xpex 7470 | . . . . 5 ⊢ (𝐵 × 𝐵) ∈ V |
15 | 4, 14 | elmap 8429 | . . . 4 ⊢ ((-g‘𝐺) ∈ (𝐵 ↑m (𝐵 × 𝐵)) ↔ (-g‘𝐺):(𝐵 × 𝐵)⟶𝐵) |
16 | 13, 15 | sylibr 236 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → (-g‘𝐺) ∈ (𝐵 ↑m (𝐵 × 𝐵))) |
17 | 2 | oveq2d 7166 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → ((𝐽 ×t 𝐽) Cn 𝐽) = ((𝐽 ×t 𝐽) Cn {∅, 𝐵})) |
18 | txtopon 22193 | . . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘𝐵) ∧ 𝐽 ∈ (TopOn‘𝐵)) → (𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵))) | |
19 | 7, 7, 18 | syl2anc 586 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → (𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵))) |
20 | cnindis 21894 | . . . . 5 ⊢ (((𝐽 ×t 𝐽) ∈ (TopOn‘(𝐵 × 𝐵)) ∧ 𝐵 ∈ V) → ((𝐽 ×t 𝐽) Cn {∅, 𝐵}) = (𝐵 ↑m (𝐵 × 𝐵))) | |
21 | 19, 4, 20 | sylancl 588 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → ((𝐽 ×t 𝐽) Cn {∅, 𝐵}) = (𝐵 ↑m (𝐵 × 𝐵))) |
22 | 17, 21 | eqtrd 2856 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → ((𝐽 ×t 𝐽) Cn 𝐽) = (𝐵 ↑m (𝐵 × 𝐵))) |
23 | 16, 22 | eleqtrrd 2916 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → (-g‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽)) |
24 | 8, 11 | istgp2 22693 | . 2 ⊢ (𝐺 ∈ TopGrp ↔ (𝐺 ∈ Grp ∧ 𝐺 ∈ TopSp ∧ (-g‘𝐺) ∈ ((𝐽 ×t 𝐽) Cn 𝐽))) |
25 | 1, 10, 23, 24 | syl3anbrc 1339 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐽 = {∅, 𝐵}) → 𝐺 ∈ TopGrp) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ∅c0 4290 {cpr 4562 × cxp 5547 ⟶wf 6345 ‘cfv 6349 (class class class)co 7150 ↑m cmap 8400 Basecbs 16477 TopOpenctopn 16689 Grpcgrp 18097 -gcsg 18099 TopOnctopon 21512 TopSpctps 21534 Cn ccn 21826 ×t ctx 22162 TopGrpctgp 22673 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-1st 7683 df-2nd 7684 df-map 8402 df-0g 16709 df-topgen 16711 df-plusf 17845 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-grp 18100 df-minusg 18101 df-sbg 18102 df-top 21496 df-topon 21513 df-topsp 21535 df-bases 21548 df-cn 21829 df-cnp 21830 df-tx 22164 df-tmd 22674 df-tgp 22675 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |