| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpsubid1 | Structured version Visualization version GIF version | ||
| Description: Subtraction of the identity from a group element. (Contributed by Mario Carneiro, 14-Jan-2015.) |
| Ref | Expression |
|---|---|
| grpsubid.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubid.o | ⊢ 0 = (0g‘𝐺) |
| grpsubid.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| grpsubid1 | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . 3 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
| 2 | grpsubid.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpsubid.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 4 | 2, 3 | grpidcl 19095 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 5 | eqid 2762 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | eqid 2762 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 7 | grpsubid.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 2, 5, 6, 7 | grpsubval 19115 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 9 | 1, 4, 8 | syl2anr 609 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 10 | 3, 6 | grpinvid 19129 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 11 | 10 | adantr 486 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 12 | 11 | oveq2d 7433 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 )) = (𝑋(+g‘𝐺) 0 )) |
| 13 | 2, 5, 3 | grprid 19098 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺) 0 ) = 𝑋) |
| 14 | 9, 12, 13 | 3eqtrd 2801 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6537 (class class class)co 7417 Basecbs 17307 +gcplusg 17348 0gc0g 17530 Grpcgrp 19063 invgcminusg 19064 -gcsg 19065 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7990 df-2nd 7991 df-0g 17532 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 df-sbg 19068 |
| This theorem is used by: odmod 19679 sylow3lem1 19760 telgsums 20126 dprdfeq0 20157 rngqiprngimf1lem 21503 chp0mat 23077 tsmsxplem1 24385 tngnm 24883 ply1divex 26369 r1pid2 26394 ply1remlem 26397 conjga 33618 fracfld 33757 irredminply 34234 qqhcn 34509 lcfrlem33 42456 |
| Copyright terms: Public domain | W3C validator |