| 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 13720 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd) | |
| 2 | 0subg.z | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 3 | 2 | 0subm 13697 | . . 3 ⊢ (𝐺 ∈ Mnd → { 0 } ∈ (SubMnd‘𝐺)) |
| 4 | 1, 3 | syl 14 | . 2 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubMnd‘𝐺)) |
| 5 | eqid 2232 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 6 | 2, 5 | grpinvid 13773 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 7 | eqid 2232 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 8 | 7, 2 | grpidcl 13742 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺)) |
| 9 | 7, 5 | grpinvcl 13761 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘ 0 ) ∈ (Base‘𝐺)) |
| 10 | 8, 9 | mpdan 421 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) ∈ (Base‘𝐺)) |
| 11 | elsng 3704 | . . . . 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 5670 | . . . . . 6 ⊢ (𝑎 = 0 → ((invg‘𝐺)‘𝑎) = ((invg‘𝐺)‘ 0 )) | |
| 15 | 14 | eleq1d 2301 | . . . . 5 ⊢ (𝑎 = 0 → (((invg‘𝐺)‘𝑎) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) ∈ { 0 })) |
| 16 | 15 | ralsng 3729 | . . . 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 13909 | . 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 2203 ∀wral 2520 {csn 3689 ‘cfv 5352 Basecbs 13212 0gc0g 13469 Mndcmnd 13629 SubMndcsubmnd 13671 Grpcgrp 13713 invgcminusg 13714 SubGrpcsubg 13884 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-pre-ltirr 8239 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-pnf 8310 df-mnf 8311 df-ltxr 8313 df-inn 9238 df-2 9296 df-ndx 13215 df-slot 13216 df-base 13218 df-sets 13219 df-iress 13220 df-plusg 13303 df-0g 13471 df-mgm 13569 df-sgrp 13615 df-mnd 13630 df-submnd 13673 df-grp 13716 df-minusg 13717 df-subg 13887 |
| This theorem is referenced by: 0nsg 13931 |
| Copyright terms: Public domain | W3C validator |