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 11177 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 2738 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
3 | eqid 2738 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
4 | grpsubid.m | . . . . 5 ⊢ − = (-g‘𝐺) | |
5 | 1, 2, 3, 4 | grpsubval 18540 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
6 | 5 | 3adant1 1128 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
7 | 6 | eqeq1d 2740 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) = 0 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
8 | simp1 1134 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) | |
9 | 1, 3 | grpinvcl 18542 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
10 | 9 | 3adant2 1129 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
11 | simp2 1135 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
12 | grpsubid.o | . . . 4 ⊢ 0 = (0g‘𝐺) | |
13 | 1, 2, 12, 3 | grpinvid2 18546 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
14 | 8, 10, 11, 13 | syl3anc 1369 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) = 0 )) |
15 | 1, 3 | grpinvinv 18557 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
16 | 15 | 3adant2 1129 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
17 | 16 | eqeq1d 2740 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ 𝑌 = 𝑋)) |
18 | eqcom 2745 | . . 3 ⊢ (𝑌 = 𝑋 ↔ 𝑋 = 𝑌) | |
19 | 17, 18 | bitrdi 286 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑋 ↔ 𝑋 = 𝑌)) |
20 | 7, 14, 19 | 3bitr2d 306 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) = 0 ↔ 𝑋 = 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 +gcplusg 16888 0gc0g 17067 Grpcgrp 18492 invgcminusg 18493 -gcsg 18494 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-sbg 18497 |
This theorem is referenced by: ghmeqker 18776 ghmf1 18778 odcong 19072 subgdisj1 19212 dprdf11 19541 kerf1ghm 19902 lmodsubeq0 20097 lvecvscan2 20289 ip2eq 20770 mdetuni0 21678 tgphaus 23176 nrmmetd 23636 ply1divmo 25205 dvdsq1p 25230 dvdsr1p 25231 ply1remlem 25232 ig1peu 25241 dchr2sum 26326 znfermltl 31464 linds2eq 31477 eqlkr 37040 hdmap11 39789 hdmapinvlem4 39862 isdomn4 40100 idomrootle 40936 lidldomn1 45367 |
Copyright terms: Public domain | W3C validator |