![]() |
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 2725 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | eqid 2725 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
5 | 1, 2, 3, 4 | grpsubval 18946 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
6 | 5 | anidms 565 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
7 | 6 | adantl 480 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
8 | grpsubid.o | . . 3 ⊢ 0 = (0g‘𝐺) | |
9 | 1, 2, 8, 3 | grprinv 18951 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋)) = 0 ) |
10 | 7, 9 | eqtrd 2765 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ‘cfv 6547 (class class class)co 7417 Basecbs 17179 +gcplusg 17232 0gc0g 17420 Grpcgrp 18894 invgcminusg 18895 -gcsg 18896 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-fv 6555 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-1st 7992 df-2nd 7993 df-0g 17422 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18897 df-minusg 18898 df-sbg 18899 |
This theorem is referenced by: grppncan 18991 grpnpncan0 18996 issubg4 19104 0nsg 19128 gexdvds 19543 abladdsub4 19770 ablsubaddsub 19773 ablpncan2 19774 ablpnpcan 19778 ablnncan 19779 telgsums 19952 dprdfeq0 19983 lmodsubid 20809 rngqiprngimfolem 21184 rngqiprngfulem5 21209 dmatsubcl 22430 mdetuni0 22553 chpmat0d 22766 chpdmatlem2 22771 tgpconncomp 24047 tgpt0 24053 tgptsmscls 24084 deg1sublt 26076 lgsqrlem1 27309 archiabllem1a 32956 archiabllem2a 32959 archiabllem2c 32960 erlbr2d 33018 erler 33019 rloccring 33024 ornglmulle 33080 orngrmulle 33081 lfl0 38606 eqlkr 38640 lkrlsp 38643 lclkrlem2m 41061 lcfrlem1 41084 hdmapinvlem3 41462 aks6d1c2lem4 41667 aks6d1c5lem3 41677 |
Copyright terms: Public domain | W3C validator |