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 2759 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | eqid 2759 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
5 | 1, 2, 3, 4 | grpsubval 18201 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
6 | 5 | anidms 571 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
7 | 6 | adantl 486 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋))) |
8 | grpsubid.o | . . 3 ⊢ 0 = (0g‘𝐺) | |
9 | 1, 2, 8, 3 | grprinv 18205 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑋)) = 0 ) |
10 | 7, 9 | eqtrd 2794 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = 0 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 400 = wceq 1539 ∈ wcel 2112 ‘cfv 6328 (class class class)co 7143 Basecbs 16526 +gcplusg 16608 0gc0g 16756 Grpcgrp 18154 invgcminusg 18155 -gcsg 18156 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-sep 5162 ax-nul 5169 ax-pow 5227 ax-pr 5291 ax-un 7452 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2899 df-ne 2950 df-ral 3073 df-rex 3074 df-reu 3075 df-rmo 3076 df-rab 3077 df-v 3409 df-sbc 3694 df-csb 3802 df-dif 3857 df-un 3859 df-in 3861 df-ss 3871 df-nul 4222 df-if 4414 df-pw 4489 df-sn 4516 df-pr 4518 df-op 4522 df-uni 4792 df-iun 4878 df-br 5026 df-opab 5088 df-mpt 5106 df-id 5423 df-xp 5523 df-rel 5524 df-cnv 5525 df-co 5526 df-dm 5527 df-rn 5528 df-res 5529 df-ima 5530 df-iota 6287 df-fun 6330 df-fn 6331 df-f 6332 df-fv 6336 df-riota 7101 df-ov 7146 df-oprab 7147 df-mpo 7148 df-1st 7686 df-2nd 7687 df-0g 16758 df-mgm 17903 df-sgrp 17952 df-mnd 17963 df-grp 18157 df-minusg 18158 df-sbg 18159 |
This theorem is referenced by: grppncan 18242 grpnpncan0 18247 issubg4 18350 0nsg 18373 gexdvds 18761 abladdsub4 18987 ablpncan2 18989 ablpnpcan 18993 ablnncan 18994 telgsums 19166 dprdfeq0 19197 lmodsubid 19747 dmatsubcl 21183 mdetuni0 21306 chpmat0d 21519 chpdmatlem2 21524 tgpconncomp 22798 tgpt0 22804 tgptsmscls 22835 deg1sublt 24795 lgsqrlem1 26014 archiabllem1a 30956 archiabllem2a 30959 archiabllem2c 30960 ornglmulle 31015 orngrmulle 31016 lfl0 36626 eqlkr 36660 lkrlsp 36663 lclkrlem2m 39080 lcfrlem1 39103 hdmapinvlem3 39481 |
Copyright terms: Public domain | W3C validator |