| 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 13653 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 2 | 0subg.z | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 3 | 2 | 0subm 13630 | . . 3 ⊢ (𝐺 ∈ Mnd → { 0 } ∈ (SubMnd‘𝐺)) |
| 4 | 1, 3 | syl 14 | . 2 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubMnd‘𝐺)) |
| 5 | eqid 2231 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | 2, 5 | grpinvid 13706 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 7 | eqid 2231 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 8 | 7, 2 | grpidcl 13675 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺)) |
| 9 | 7, 5 | grpinvcl 13694 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘ 0 ) ∈ (Base‘𝐺)) |
| 10 | 8, 9 | mpdan 421 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) ∈ (Base‘𝐺)) |
| 11 | elsng 3688 | . . . . 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 5648 | . . . . . 6 ⊢ (𝑎 = 0 → ((invg‘𝐺)‘𝑎) = ((invg‘𝐺)‘ 0 )) | |
| 15 | 14 | eleq1d 2300 | . . . . 5 ⊢ (𝑎 = 0 → (((invg‘𝐺)‘𝑎) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) ∈ { 0 })) |
| 16 | 15 | ralsng 3713 | . . . 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 13842 | . 2 ⊢ (𝐺 ∈ Grp → ({ 0 } ∈ (SubGrp‘𝐺) ↔ ({ 0 } ∈ (SubMnd‘𝐺) ∧ ∀𝑎 ∈ { 0 } ((invg‘𝐺)‘𝑎) ∈ { 0 }))) |
| 20 | 4, 18, 19 | mpbir2and 953 | 1 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∈ wcel 2202 ∀wral 2511 {csn 3673 ‘cfv 5333 Basecbs 13145 0gc0g 13402 Mndcmnd 13562 SubMndcsubmnd 13604 Grpcgrp 13646 invgcminusg 13647 SubGrpcsubg 13817 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-ltxr 8261 df-inn 9186 df-2 9244 df-ndx 13148 df-slot 13149 df-base 13151 df-sets 13152 df-iress 13153 df-plusg 13236 df-0g 13404 df-mgm 13502 df-sgrp 13548 df-mnd 13563 df-submnd 13606 df-grp 13649 df-minusg 13650 df-subg 13820 |
| This theorem is referenced by: 0nsg 13864 |
| Copyright terms: Public domain | W3C validator |