| 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 1213 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐶 ∈ 𝑉) | |
| 3 | simpr2 1212 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → 𝐵 ∈ 𝑉) | |
| 4 | ablsubsub23.v | . . . . 5 ⊢ 𝑉 = (Base‘𝐺) | |
| 5 | eqid 2765 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 6 | 4, 5 | ablcom 19860 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐶(+g‘𝐺)𝐵) = (𝐵(+g‘𝐺)𝐶)) |
| 7 | 1, 2, 3, 6 | syl3anc 1394 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → (𝐶(+g‘𝐺)𝐵) = (𝐵(+g‘𝐺)𝐶)) |
| 8 | 7 | eqeq1d 2767 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐶(+g‘𝐺)𝐵) = 𝐴 ↔ (𝐵(+g‘𝐺)𝐶) = 𝐴)) |
| 9 | ablgrp 19846 | . . 3 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 10 | ablsubsub23.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 11 | 4, 5, 10 | grpsubadd 19085 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐶(+g‘𝐺)𝐵) = 𝐴)) |
| 12 | 9, 11 | sylan 591 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) → ((𝐴 − 𝐵) = 𝐶 ↔ (𝐶(+g‘𝐺)𝐵) = 𝐴)) |
| 13 | 3ancomb 1114 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ↔ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) | |
| 14 | 13 | biimpi 219 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) |
| 15 | 4, 5, 10 | grpsubadd 19085 | . . 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 1101 = wceq 1563 ∈ wcel 2145 ‘cfv 6525 (class class class)co 7400 Basecbs 17259 +gcplusg 17300 Grpcgrp 18990 -gcsg 18992 Abelcabl 19842 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-1st 7974 df-2nd 7975 df-0g 17484 df-mgm 18688 df-sgrp 18767 df-mnd 18783 df-grp 18993 df-minusg 18994 df-sbg 18995 df-cmn 19843 df-abl 19844 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |