| 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 487 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐺 ∈ Abel) | |
| 2 | simpr3 1215 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
| 3 | simpr2 1214 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
| 4 | ablsubsub23.v | . . . . 5 ⊢ 𝑉 = (Base‘𝐺) | |
| 5 | eqid 2763 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | 4, 5 | ablcom 19870 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐶(+g‘𝐺)𝐵) = (𝐵(+g‘𝐺)𝐶)) |
| 7 | 1, 2, 3, 6 | syl3anc 1398 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐶(+g‘𝐺)𝐵) = (𝐵(+g‘𝐺)𝐶)) |
| 8 | 7 | eqeq1d 2765 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐶(+g‘𝐺)𝐵) = 𝐴 ↔ (𝐵(+g‘𝐺)𝐶) = 𝐴)) |
| 9 | ablgrp 19856 | . . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 10 | ablsubsub23.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 11 | 4, 5, 10 | grpsubadd 19095 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐶(+g‘𝐺)𝐵) = 𝐴)) |
| 12 | 9, 11 | sylan 591 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐶(+g‘𝐺)𝐵) = 𝐴)) |
| 13 | 3ancomb 1116 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ↔ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) | |
| 14 | 13 | biimpi 219 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) |
| 15 | 4, 5, 10 | grpsubadd 19095 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) → ((𝐴 − 𝐶) = 𝐵 ↔ (𝐵(+g‘𝐺)𝐶) = 𝐴)) |
| 16 | 9, 14, 15 | syl2an 607 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐶) = 𝐵 ↔ (𝐵(+g‘𝐺)𝐶) = 𝐴)) |
| 17 | 8, 12, 16 | 3bitr4d 314 | 1 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐴 − 𝐶) = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 +gcplusg 17311 Grpcgrp 19001 -gcsg 19003 Abelcabl 19852 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7987 df-2nd 7988 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-grp 19004 df-minusg 19005 df-sbg 19006 df-cmn 19853 df-abl 19854 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |