| 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 19063 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 5 | eqid 2766 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | eqid 2766 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 7 | grpsubid.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 2, 5, 6, 7 | grpsubval 19083 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 9 | 1, 4, 8 | syl2anr 609 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 10 | 3, 6 | grpinvid 19097 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 11 | 10 | adantr 486 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 12 | 11 | oveq2d 7439 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 )) = (𝑋(+g‘𝐺) 0 )) |
| 13 | 2, 5, 3 | grprid 19066 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺) 0 ) = 𝑋) |
| 14 | 9, 12, 13 | 3eqtrd 2805 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ‘cfv 6543 (class class class)co 7423 Basecbs 17294 +gcplusg 17335 0gc0g 17517 Grpcgrp 19031 invgcminusg 19032 -gcsg 19033 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-1st 7995 df-2nd 7996 df-0g 17519 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-grp 19034 df-minusg 19035 df-sbg 19036 |
| This theorem is used by: odmod 19647 sylow3lem1 19728 telgsums 20094 dprdfeq0 20125 rngqiprngimf1lem 21471 chp0mat 23040 tsmsxplem1 24347 tngnm 24845 ply1divex 26331 r1pid2 26356 ply1remlem 26359 conjga 33521 fracfld 33660 irredminply 34137 qqhcn 34412 lcfrlem33 42390 |
| Copyright terms: Public domain | W3C validator |