| 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 11407 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 2736 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | eqid 2736 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpsubval 18915 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 6 | 5 | 3adant1 1130 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 7 | 6 | eqeq1d 2738 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) = 0 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
| 8 | simp1 1136 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) | |
| 9 | 1, 3 | grpinvcl 18917 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 10 | 9 | 3adant2 1131 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 11 | simp2 1137 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 12 | grpsubid.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 13 | 1, 2, 12, 3 | grpinvid2 18922 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
| 14 | 8, 10, 11, 13 | syl3anc 1373 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
| 15 | 1, 3 | grpinvinv 18935 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
| 16 | 15 | 3adant2 1131 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
| 17 | 16 | eqeq1d 2738 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ 𝑌 = 𝑋)) |
| 18 | eqcom 2743 | . . 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 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 0gc0g 17359 Grpcgrp 18863 invgcminusg 18864 -gcsg 18865 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-sbg 18868 |
| This theorem is referenced by: ghmeqker 19172 ghmf1 19175 kerf1ghm 19176 odcong 19478 subgdisj1 19620 dprdf11 19954 isdomn4 20649 lmodsubeq0 20872 lvecvscan2 21067 fermltlchr 21484 ip2eq 21608 mdetuni0 22565 tgphaus 24061 nrmmetd 24518 ply1divmo 26097 dvdsq1p 26124 dvdsr1p 26125 ply1remlem 26126 idomrootle 26134 ig1peu 26136 dchr2sum 27240 rlocf1 33355 fracerl 33388 znfermltl 33447 linds2eq 33462 vietadeg1 33734 assalactf1o 33792 eqlkr 39355 hdmap11 42104 hdmapinvlem4 42177 aks6d1c6lem2 42421 aks6d1c6lem3 42422 lidldomn1 48473 |
| Copyright terms: Public domain | W3C validator |