| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 0subg | GIF version | ||
| Description: The zero subgroup of an arbitrary group. (Contributed by Stefan O'Rear, 10-Dec-2014.) (Proof shortened by SN, 31-Jan-2025.) |
| Ref | Expression |
|---|---|
| 0subg.z | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| 0subg | ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpmnd 13589 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 2 | 0subg.z | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 3 | 2 | 0subm 13566 | . . 3 ⊢ (𝐺 ∈ Mnd → { 0 } ∈ (SubMnd‘𝐺)) |
| 4 | 1, 3 | syl 14 | . 2 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubMnd‘𝐺)) |
| 5 | eqid 2231 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | 2, 5 | grpinvid 13642 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 7 | eqid 2231 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 8 | 7, 2 | grpidcl 13611 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺)) |
| 9 | 7, 5 | grpinvcl 13630 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘ 0 ) ∈ (Base‘𝐺)) |
| 10 | 8, 9 | mpdan 421 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) ∈ (Base‘𝐺)) |
| 11 | elsng 3684 | . . . . 5 ⊢ (((invg‘𝐺)‘ 0 ) ∈ (Base‘𝐺) → (((invg‘𝐺)‘ 0 ) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) = 0 )) | |
| 12 | 10, 11 | syl 14 | . . . 4 ⊢ (𝐺 ∈ Grp → (((invg‘𝐺)‘ 0 ) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) = 0 )) |
| 13 | 6, 12 | mpbird 167 | . . 3 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) ∈ { 0 }) |
| 14 | fveq2 5639 | . . . . . 6 ⊢ (𝑎 = 0 → ((invg‘𝐺)‘𝑎) = ((invg‘𝐺)‘ 0 )) | |
| 15 | 14 | eleq1d 2300 | . . . . 5 ⊢ (𝑎 = 0 → (((invg‘𝐺)‘𝑎) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) ∈ { 0 })) |
| 16 | 15 | ralsng 3709 | . . . 4 ⊢ ( 0 ∈ (Base‘𝐺) → (∀𝑎 ∈ { 0 } ((invg‘𝐺)‘𝑎) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) ∈ { 0 })) |
| 17 | 8, 16 | syl 14 | . . 3 ⊢ (𝐺 ∈ Grp → (∀𝑎 ∈ { 0 } ((invg‘𝐺)‘𝑎) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) ∈ { 0 })) |
| 18 | 13, 17 | mpbird 167 | . 2 ⊢ (𝐺 ∈ Grp → ∀𝑎 ∈ { 0 } ((invg‘𝐺)‘𝑎) ∈ { 0 }) |
| 19 | 5 | issubg3 13778 | . 2 ⊢ (𝐺 ∈ Grp → ({ 0 } ∈ (SubGrp‘𝐺) ↔ ({ 0 } ∈ (SubMnd‘𝐺) ∧ ∀𝑎 ∈ { 0 } ((invg‘𝐺)‘𝑎) ∈ { 0 }))) |
| 20 | 4, 18, 19 | mpbir2and 952 | 1 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ∀wral 2510 {csn 3669 ‘cfv 5326 Basecbs 13081 0gc0g 13338 Mndcmnd 13498 SubMndcsubmnd 13540 Grpcgrp 13582 invgcminusg 13583 SubGrpcsubg 13753 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-pnf 8215 df-mnf 8216 df-ltxr 8218 df-inn 9143 df-2 9201 df-ndx 13084 df-slot 13085 df-base 13087 df-sets 13088 df-iress 13089 df-plusg 13172 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-submnd 13542 df-grp 13585 df-minusg 13586 df-subg 13756 |
| This theorem is referenced by: 0nsg 13800 |
| Copyright terms: Public domain | W3C validator |