| 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 2730 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | eqid 2730 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 18924 | . . . 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 18929 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋)) = 0 ) |
| 10 | 7, 9 | eqtrd 2765 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 +gcplusg 17227 0gc0g 17409 Grpcgrp 18872 invgcminusg 18873 -gcsg 18874 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 df-0g 17411 df-mgm 18574 df-sgrp 18653 df-mnd 18669 df-grp 18875 df-minusg 18876 df-sbg 18877 |
| This theorem is referenced by: grppncan 18970 grpnpncan0 18975 issubg4 19084 0nsg 19108 gexdvds 19521 abladdsub4 19748 ablsubaddsub 19751 ablpncan2 19752 ablpnpcan 19756 ablnncan 19757 telgsums 19930 dprdfeq0 19961 lmodsubid 20835 rngqiprngimfolem 21207 rngqiprngfulem5 21232 dmatsubcl 22392 mdetuni0 22515 chpmat0d 22728 chpdmatlem2 22733 tgpconncomp 24007 tgpt0 24013 tgptsmscls 24044 deg1sublt 26022 lgsqrlem1 27264 archiabllem1a 33152 archiabllem2a 33155 archiabllem2c 33156 erlbr2d 33222 erler 33223 rloccring 33228 ornglmulle 33290 orngrmulle 33291 lfl0 39065 eqlkr 39099 lkrlsp 39102 lclkrlem2m 41520 lcfrlem1 41543 hdmapinvlem3 41921 aks6d1c2lem4 42122 aks6d1c5lem3 42132 aks5lem2 42182 |
| Copyright terms: Public domain | W3C validator |