![]() |
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 2728 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | eqid 2728 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
5 | 1, 2, 3, 4 | grpsubval 18942 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
6 | 5 | anidms 566 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
7 | 6 | adantl 481 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
8 | grpsubid.o | . . 3 ⊢ 0 = (0g‘𝐺) | |
9 | 1, 2, 8, 3 | grprinv 18947 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋)) = 0 ) |
10 | 7, 9 | eqtrd 2768 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ‘cfv 6548 (class class class)co 7420 Basecbs 17180 +gcplusg 17233 0gc0g 17421 Grpcgrp 18890 invgcminusg 18891 -gcsg 18892 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-rmo 3373 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 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 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-1st 7993 df-2nd 7994 df-0g 17423 df-mgm 18600 df-sgrp 18679 df-mnd 18695 df-grp 18893 df-minusg 18894 df-sbg 18895 |
This theorem is referenced by: grppncan 18987 grpnpncan0 18992 issubg4 19100 0nsg 19124 gexdvds 19539 abladdsub4 19766 ablsubaddsub 19769 ablpncan2 19770 ablpnpcan 19774 ablnncan 19775 telgsums 19948 dprdfeq0 19979 lmodsubid 20805 rngqiprngimfolem 21180 rngqiprngfulem5 21205 dmatsubcl 22413 mdetuni0 22536 chpmat0d 22749 chpdmatlem2 22754 tgpconncomp 24030 tgpt0 24036 tgptsmscls 24067 deg1sublt 26059 lgsqrlem1 27292 archiabllem1a 32912 archiabllem2a 32915 archiabllem2c 32916 erlbr2d 32991 erler 32992 rloccring 32997 ornglmulle 33033 orngrmulle 33034 lfl0 38537 eqlkr 38571 lkrlsp 38574 lclkrlem2m 40992 lcfrlem1 41015 hdmapinvlem3 41393 aks6d1c2lem4 41598 aks6d1c5lem3 41608 |
Copyright terms: Public domain | W3C validator |