| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abladdsub | Structured version Visualization version GIF version | ||
| Description: Associative-type law for group subtraction and addition. (Contributed by NM, 19-Apr-2014.) |
| Ref | Expression |
|---|---|
| ablsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablsubadd.p | ⊢ + = (+g‘𝐺) |
| ablsubadd.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| abladdsub | ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) − 𝑍) = ((𝑋 − 𝑍) + 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablsubadd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | ablsubadd.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 3 | 1, 2 | ablcom 19769 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
| 4 | 3 | 3adant3r3 1192 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 + 𝑌) = (𝑌 + 𝑋)) |
| 5 | 4 | oveq1d 7375 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) − 𝑍) = ((𝑌 + 𝑋) − 𝑍)) |
| 6 | ablgrp 19755 | . . . 4 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 7 | 6 | adantr 482 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝐺 ∈ Grp) |
| 8 | simpr2 1203 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 9 | simpr1 1202 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 10 | simpr3 1204 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝑍 ∈ 𝐵) | |
| 11 | ablsubadd.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 12 | 1, 2, 11 | grpaddsubass 19001 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑌 + 𝑋) − 𝑍) = (𝑌 + (𝑋 − 𝑍))) |
| 13 | 7, 8, 9, 10, 12 | syl13anc 1381 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑌 + 𝑋) − 𝑍) = (𝑌 + (𝑋 − 𝑍))) |
| 14 | simpl 484 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → 𝐺 ∈ Abel) | |
| 15 | 1, 11 | grpsubcl 18991 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑋 − 𝑍) ∈ 𝐵) |
| 16 | 7, 9, 10, 15 | syl3anc 1380 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑋 − 𝑍) ∈ 𝐵) |
| 17 | 1, 2 | ablcom 19769 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑌 ∈ 𝐵 ∧ (𝑋 − 𝑍) ∈ 𝐵) → (𝑌 + (𝑋 − 𝑍)) = ((𝑋 − 𝑍) + 𝑌)) |
| 18 | 14, 8, 16, 17 | syl3anc 1380 | . 2 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → (𝑌 + (𝑋 − 𝑍)) = ((𝑋 − 𝑍) + 𝑌)) |
| 19 | 5, 13, 18 | 3eqtrd 2780 | 1 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) − 𝑍) = ((𝑋 − 𝑍) + 𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ‘cfv 6489 (class class class)co 7360 Basecbs 17174 +gcplusg 17215 Grpcgrp 18904 -gcsg 18906 Abelcabl 19751 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-1st 7935 df-2nd 7936 df-0g 17399 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-grp 18907 df-minusg 18908 df-sbg 18909 df-cmn 19752 df-abl 19753 |
| This theorem is referenced by: ablsubadd23 19783 ablpncan2 19785 ablsubsub 19787 ip2subdi 21623 r1padd1 33703 |
| Copyright terms: Public domain | W3C validator |