| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpsubeq0 | Structured version Visualization version GIF version | ||
| Description: If the difference between two group elements is zero, they are equal. (subeq0 11419 analog.) (Contributed by NM, 31-Mar-2014.) |
| Ref | Expression |
|---|---|
| grpsubid.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubid.o | ⊢ 0 = (0g‘𝐺) |
| grpsubid.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| grpsubeq0 | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) = 0 ↔ 𝑋 = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubid.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2737 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | eqid 2737 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 18927 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 6 | 5 | 3adant1 1131 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 7 | 6 | eqeq1d 2739 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) = 0 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
| 8 | simp1 1137 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) | |
| 9 | 1, 3 | grpinvcl 18929 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 10 | 9 | 3adant2 1132 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 11 | simp2 1138 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 12 | grpsubid.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 13 | 1, 2, 12, 3 | grpinvid2 18934 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
| 14 | 8, 10, 11, 13 | syl3anc 1374 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
| 15 | 1, 3 | grpinvinv 18947 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
| 16 | 15 | 3adant2 1132 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
| 17 | 16 | eqeq1d 2739 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ 𝑌 = 𝑋)) |
| 18 | eqcom 2744 | . . 3 ⊢ (𝑌 = 𝑋 ↔ 𝑋 = 𝑌) | |
| 19 | 17, 18 | bitrdi 287 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ 𝑋 = 𝑌)) |
| 20 | 7, 14, 19 | 3bitr2d 307 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) = 0 ↔ 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 +gcplusg 17189 0gc0g 17371 Grpcgrp 18875 invgcminusg 18876 -gcsg 18877 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 df-sbg 18880 |
| This theorem is referenced by: ghmeqker 19184 ghmf1 19187 kerf1ghm 19188 odcong 19490 subgdisj1 19632 dprdf11 19966 isdomn4 20661 lmodsubeq0 20884 lvecvscan2 21079 fermltlchr 21496 ip2eq 21620 mdetuni0 22577 tgphaus 24073 nrmmetd 24530 ply1divmo 26109 dvdsq1p 26136 dvdsr1p 26137 ply1remlem 26138 idomrootle 26146 ig1peu 26148 dchr2sum 27252 rlocf1 33366 fracerl 33399 znfermltl 33458 linds2eq 33473 vietadeg1 33754 assalactf1o 33812 eqlkr 39469 hdmap11 42218 hdmapinvlem4 42291 aks6d1c6lem2 42535 aks6d1c6lem3 42536 lidldomn1 48585 |
| Copyright terms: Public domain | W3C validator |