| 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 19205 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 5 | eqid 2763 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | eqid 2763 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 7 | grpsubid.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 2, 5, 6, 7 | grpsubval 19225 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 9 | 1, 4, 8 | syl2anr 609 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 10 | 3, 6 | grpinvid 19239 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 11 | 10 | adantr 486 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 12 | 11 | oveq2d 7459 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 )) = (𝑋(+g‘𝐺) 0 )) |
| 13 | 2, 5, 3 | grprid 19208 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺) 0 ) = 𝑋) |
| 14 | 9, 12, 13 | 3eqtrd 2802 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ‘cfv 6558 (class class class)co 7443 Basecbs 17416 +gcplusg 17457 0gc0g 17639 Grpcgrp 19173 invgcminusg 19174 -gcsg 19175 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-1st 8025 df-2nd 8026 df-0g 17641 df-mgm 18845 df-sgrp 18937 df-mnd 18953 df-grp 19176 df-minusg 19177 df-sbg 19178 |
| This theorem is used by: odmod 19790 sylow3lem1 19871 telgsums 20237 dprdfeq0 20268 rngqiprngimf1lem 21620 chp0mat 23194 tsmsxplem1 24502 tngnm 25000 ply1divex 26485 r1pid2 26510 ply1remlem 26513 conjga 33801 fracfld 33940 irredminply 34418 qqhcn 34693 lcfrlem33 42824 |
| Copyright terms: Public domain | W3C validator |