| 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 22 | . . 3 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
| 2 | grpsubid.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpsubid.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 4 | 2, 3 | grpidcl 18952 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 5 | eqid 2734 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | eqid 2734 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 7 | grpsubid.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 2, 5, 6, 7 | grpsubval 18972 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 0 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 9 | 1, 4, 8 | syl2anr 597 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 ))) |
| 10 | 3, 6 | grpinvid 18986 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 11 | 10 | adantr 480 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 12 | 11 | oveq2d 7429 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘ 0 )) = (𝑋(+g‘𝐺) 0 )) |
| 13 | 2, 5, 3 | grprid 18955 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺) 0 ) = 𝑋) |
| 14 | 9, 12, 13 | 3eqtrd 2773 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 0 ) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2107 ‘cfv 6541 (class class class)co 7413 Basecbs 17229 +gcplusg 17273 0gc0g 17455 Grpcgrp 18920 invgcminusg 18921 -gcsg 18922 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-id 5558 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7996 df-2nd 7997 df-0g 17457 df-mgm 18622 df-sgrp 18701 df-mnd 18717 df-grp 18923 df-minusg 18924 df-sbg 18925 |
| This theorem is referenced by: odmod 19532 sylow3lem1 19613 telgsums 19979 dprdfeq0 20010 rngqiprngimf1lem 21266 chp0mat 22800 tsmsxplem1 24107 tngnm 24608 ply1divex 26112 r1pid2 26137 ply1remlem 26140 fracfld 33250 r1pid2OLD 33564 irredminply 33696 qqhcn 33951 lcfrlem33 41536 |
| Copyright terms: Public domain | W3C validator |