| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 1nsgtrivd | Structured version Visualization version GIF version | ||
| Description: A group with exactly one normal subgroup is trivial. (Contributed by Rohan Ridenour, 3-Aug-2023.) |
| Ref | Expression |
|---|---|
| 1nsgtrivd.1 | ⊢ 𝐵 = (Base‘𝐺) |
| 1nsgtrivd.2 | ⊢ 0 = (0g‘𝐺) |
| 1nsgtrivd.3 | ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 1nsgtrivd.4 | ⊢ (𝜑 → (NrmSGrp‘𝐺) ≈ 1o) |
| Ref | Expression |
|---|---|
| 1nsgtrivd | ⊢ (𝜑 → 𝐵 = { 0 }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1nsgtrivd.3 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) | |
| 2 | 1nsgtrivd.1 | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | 2 | nsgid 19327 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐵 ∈ (NrmSGrp‘𝐺)) |
| 4 | 1, 3 | syl 18 | . . 3 ⊢ (𝜑 → 𝐵 ∈ (NrmSGrp‘𝐺)) |
| 5 | 1nsgtrivd.2 | . . . . . 6 ⊢ 0 = (0g‘𝐺) | |
| 6 | 5 | 0nsg 19326 | . . . . 5 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (NrmSGrp‘𝐺)) |
| 7 | 1, 6 | syl 18 | . . . 4 ⊢ (𝜑 → { 0 } ∈ (NrmSGrp‘𝐺)) |
| 8 | 1nsgtrivd.4 | . . . 4 ⊢ (𝜑 → (NrmSGrp‘𝐺) ≈ 1o) | |
| 9 | en1eqsn 9245 | . . . 4 ⊢ (({ 0 } ∈ (NrmSGrp‘𝐺) ∧ (NrmSGrp‘𝐺) ≈ 1o) → (NrmSGrp‘𝐺) = {{ 0 }}) | |
| 10 | 7, 8, 9 | syl2anc 596 | . . 3 ⊢ (𝜑 → (NrmSGrp‘𝐺) = {{ 0 }}) |
| 11 | 4, 10 | eleqtrd 2862 | . 2 ⊢ (𝜑 → 𝐵 ∈ {{ 0 }}) |
| 12 | snex 5397 | . . 3 ⊢ { 0 } ∈ V | |
| 13 | elsn2g 4625 | . . 3 ⊢ ({ 0 } ∈ V → (𝐵 ∈ {{ 0 }} ↔ 𝐵 = { 0 })) | |
| 14 | 12, 13 | mp1i 14 | . 2 ⊢ (𝜑 → (𝐵 ∈ {{ 0 }} ↔ 𝐵 = { 0 })) |
| 15 | 11, 14 | mpbid 235 | 1 ⊢ (𝜑 → 𝐵 = { 0 }) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 Vcvv 3450 {csn 4584 class class class wbr 5103 ‘cfv 6528 1oc1o 8448 ≈ cen 8949 Basecbs 17334 0gc0g 17557 Grpcgrp 19091 NrmSGrpcnsg 19278 |
| 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 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 |
| 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 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-nn 12291 df-2 12360 df-sets 17289 df-slot 17307 df-ndx 17319 df-base 17335 df-ress 17356 df-plusg 17388 df-0g 17559 df-mgm 18763 df-sgrp 18855 df-mnd 18871 df-submnd 18926 df-grp 19094 df-minusg 19095 df-sbg 19096 df-subg 19280 df-nsg 19281 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |