| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpsubid | Structured version Visualization version GIF version | ||
| Description: Subtraction of a group element from itself. (Contributed by NM, 31-Mar-2014.) |
| Ref | Expression |
|---|---|
| grpsubid.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubid.o | ⊢ 0 = (0g‘𝐺) |
| grpsubid.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| grpsubid | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubid.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2756 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | eqid 2756 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 19003 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
| 6 | 5 | anidms 573 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
| 7 | 6 | adantl 484 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
| 8 | grpsubid.o | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 9 | 1, 2, 8, 3 | grprinv 19008 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋)) = 0 ) |
| 10 | 7, 9 | eqtrd 2791 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 = wceq 1554 ∈ wcel 2136 ‘cfv 6510 (class class class)co 7385 Basecbs 17221 +gcplusg 17262 0gc0g 17444 Grpcgrp 18951 invgcminusg 18952 -gcsg 18953 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-ral 3071 df-rex 3081 df-rmo 3361 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-1st 7959 df-2nd 7960 df-0g 17446 df-mgm 18650 df-sgrp 18729 df-mnd 18745 df-grp 18954 df-minusg 18955 df-sbg 18956 |
| This theorem is referenced by: grppncan 19049 grpnpncan0 19054 issubg4 19163 0nsg 19186 gexdvds 19600 abladdsub4 19827 ablsubaddsub 19830 ablpncan2 19831 ablpnpcan 19835 ablnncan 19836 telgsums 20009 dprdfeq0 20040 ornglmulle 20889 orngrmulle 20890 lmodsubid 20962 rngqiprngimfolem 21333 rngqiprngfulem5 21358 dmatsubcl 22531 mdetuni0 22654 chpmat0d 22867 chpdmatlem2 22872 tgpconncomp 24146 tgpt0 24152 tgptsmscls 24183 deg1sublt 26143 lgsqrlem1 27380 archiabllem1a 33325 archiabllem2a 33328 archiabllem2c 33329 erlbr2d 33399 erler 33400 rloccring 33406 lfl0 39637 eqlkr 39671 lkrlsp 39674 lclkrlem2m 42091 lcfrlem1 42114 hdmapinvlem3 42492 aks6d1c2lem4 42692 aks6d1c5lem3 42702 aks5lem2 42752 |
| Copyright terms: Public domain | W3C validator |