| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablpnpcan | Structured version Visualization version GIF version | ||
| Description: Cancellation law for mixed addition and subtraction. (pnpcan 11432 analog.) (Contributed by NM, 29-May-2015.) |
| Ref | Expression |
|---|---|
| ablsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablsubadd.p | ⊢ + = (+g‘𝐺) |
| ablsubadd.m | ⊢ − = (-g‘𝐺) |
| ablsubsub.g | ⊢ (𝜑 → 𝐺 ∈ Abel) |
| ablsubsub.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ablsubsub.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| ablsubsub.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| ablpnpcan.g | ⊢ (𝜑 → 𝐺 ∈ Abel) |
| ablpnpcan.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ablpnpcan.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| ablpnpcan.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| ablpnpcan | ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = (𝑌 − 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablsubsub.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Abel) | |
| 2 | ablsubsub.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 3 | ablsubsub.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 4 | ablsubsub.z | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
| 5 | ablsubadd.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 6 | ablsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 7 | ablsubadd.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 8 | 5, 6, 7 | ablsub4 19751 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 9 | 1, 2, 3, 2, 4, 8 | syl122anc 1382 | . 2 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 10 | ablgrp 19726 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 11 | 1, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 12 | eqid 2737 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 13 | 5, 12, 7 | grpsubid 18966 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 14 | 11, 2, 13 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 15 | 14 | oveq1d 7383 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑋) + (𝑌 − 𝑍)) = ((0g‘𝐺) + (𝑌 − 𝑍))) |
| 16 | 5, 7 | grpsubcl 18962 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 − 𝑍) ∈ 𝐵) |
| 17 | 11, 3, 4, 16 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (𝑌 − 𝑍) ∈ 𝐵) |
| 18 | 5, 6, 12 | grplid 18909 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑌 − 𝑍) ∈ 𝐵) → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 19 | 11, 17, 18 | syl2anc 585 | . 2 ⊢ (𝜑 → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 20 | 9, 15, 19 | 3eqtrd 2776 | 1 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = (𝑌 − 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 +gcplusg 17189 0gc0g 17371 Grpcgrp 18875 -gcsg 18877 Abelcabl 19722 |
| 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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 df-sbg 18880 df-cmn 19723 df-abl 19724 |
| This theorem is referenced by: hdmaprnlem7N 42228 |
| Copyright terms: Public domain | W3C validator |