| 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 2735 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | eqid 2735 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 18968 | . . . 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 18973 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋)) = 0 ) |
| 10 | 7, 9 | eqtrd 2770 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ‘cfv 6531 (class class class)co 7405 Basecbs 17228 +gcplusg 17271 0gc0g 17453 Grpcgrp 18916 invgcminusg 18917 -gcsg 18918 |
| 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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 |
| 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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-1st 7988 df-2nd 7989 df-0g 17455 df-mgm 18618 df-sgrp 18697 df-mnd 18713 df-grp 18919 df-minusg 18920 df-sbg 18921 |
| This theorem is referenced by: grppncan 19014 grpnpncan0 19019 issubg4 19128 0nsg 19152 gexdvds 19565 abladdsub4 19792 ablsubaddsub 19795 ablpncan2 19796 ablpnpcan 19800 ablnncan 19801 telgsums 19974 dprdfeq0 20005 lmodsubid 20879 rngqiprngimfolem 21251 rngqiprngfulem5 21276 dmatsubcl 22436 mdetuni0 22559 chpmat0d 22772 chpdmatlem2 22777 tgpconncomp 24051 tgpt0 24057 tgptsmscls 24088 deg1sublt 26067 lgsqrlem1 27309 archiabllem1a 33189 archiabllem2a 33192 archiabllem2c 33193 erlbr2d 33259 erler 33260 rloccring 33265 ornglmulle 33327 orngrmulle 33328 lfl0 39083 eqlkr 39117 lkrlsp 39120 lclkrlem2m 41538 lcfrlem1 41561 hdmapinvlem3 41939 aks6d1c2lem4 42140 aks6d1c5lem3 42150 aks5lem2 42200 |
| Copyright terms: Public domain | W3C validator |