| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablsubsub23 | Structured version Visualization version GIF version | ||
| Description: Swap subtrahend and result of group subtraction. (Contributed by NM, 14-Dec-2007.) (Revised by AV, 7-Oct-2021.) |
| Ref | Expression |
|---|---|
| ablsubsub23.v | ⊢ 𝑉 = (Base‘𝐺) |
| ablsubsub23.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| ablsubsub23 | ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐴 − 𝐶) = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 482 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐺 ∈ Abel) | |
| 2 | simpr3 1198 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
| 3 | simpr2 1197 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
| 4 | ablsubsub23.v | . . . . 5 ⊢ 𝑉 = (Base‘𝐺) | |
| 5 | eqid 2737 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | 4, 5 | ablcom 19765 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐶(+g‘𝐺)𝐵) = (𝐵(+g‘𝐺)𝐶)) |
| 7 | 1, 2, 3, 6 | syl3anc 1374 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐶(+g‘𝐺)𝐵) = (𝐵(+g‘𝐺)𝐶)) |
| 8 | 7 | eqeq1d 2739 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐶(+g‘𝐺)𝐵) = 𝐴 ↔ (𝐵(+g‘𝐺)𝐶) = 𝐴)) |
| 9 | ablgrp 19751 | . . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 10 | ablsubsub23.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 11 | 4, 5, 10 | grpsubadd 18995 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐶(+g‘𝐺)𝐵) = 𝐴)) |
| 12 | 9, 11 | sylan 581 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐶(+g‘𝐺)𝐵) = 𝐴)) |
| 13 | 3ancomb 1099 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ↔ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) | |
| 14 | 13 | biimpi 216 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) |
| 15 | 4, 5, 10 | grpsubadd 18995 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) → ((𝐴 − 𝐶) = 𝐵 ↔ (𝐵(+g‘𝐺)𝐶) = 𝐴)) |
| 16 | 9, 14, 15 | syl2an 597 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐶) = 𝐵 ↔ (𝐵(+g‘𝐺)𝐶) = 𝐴)) |
| 17 | 8, 12, 16 | 3bitr4d 311 | 1 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐴 − 𝐶) = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6492 (class class class)co 7360 Basecbs 17170 +gcplusg 17211 Grpcgrp 18900 -gcsg 18902 Abelcabl 19747 |
| 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 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| 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 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 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 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-1st 7935 df-2nd 7936 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-sbg 18905 df-cmn 19748 df-abl 19749 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |