| 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 2760 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | eqid 2760 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 19158 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
| 6 | 5 | anidms 577 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
| 7 | 6 | adantl 487 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
| 8 | grpsubid.o | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 9 | 1, 2, 8, 3 | grprinv 19163 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋)) = 0 ) |
| 10 | 7, 9 | eqtrd 2795 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ‘cfv 6527 (class class class)co 7408 Basecbs 17349 +gcplusg 17390 0gc0g 17572 Grpcgrp 19106 invgcminusg 19107 -gcsg 19108 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-0g 17574 df-mgm 18778 df-sgrp 18870 df-mnd 18886 df-grp 19109 df-minusg 19110 df-sbg 19111 |
| This theorem is used by: grppncan 19203 grpnpncan0 19208 issubg4 19318 0nsg 19341 gexdvds 19760 abladdsub4 19987 ablsubaddsub 19990 ablpncan2 19991 ablpnpcan 19995 ablnncan 19996 telgsums 20169 dprdfeq0 20200 ornglmulle 21086 orngrmulle 21087 lmodsubid 21159 rngqiprngimfolem 21548 rngqiprngfulem5 21573 dmatsubcl 22775 mdetuni0 22898 chpmat0d 23114 chpdmatlem2 23119 tgpconncomp 24394 tgpt0 24400 tgptsmscls 24431 deg1sublt 26390 lgsqrlem1 27637 archiabllem1a 33686 archiabllem2a 33689 archiabllem2c 33690 erlbr2d 33759 erler 33760 rloccring 33766 lfl0 40042 eqlkr 40076 lkrlsp 40079 lclkrlem2m 42496 lcfrlem1 42519 hdmapinvlem3 42897 aks6d1c2lem4 43097 aks6d1c5lem3 43107 aks5lem2 43157 |
| Copyright terms: Public domain | W3C validator |