| 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 11420 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 19739 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 9 | 1, 2, 3, 2, 4, 8 | syl122anc 1381 | . 2 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 10 | ablgrp 19714 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 11 | 1, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 12 | eqid 2736 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 13 | 5, 12, 7 | grpsubid 18954 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 14 | 11, 2, 13 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 15 | 14 | oveq1d 7373 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑋) + (𝑌 − 𝑍)) = ((0g‘𝐺) + (𝑌 − 𝑍))) |
| 16 | 5, 7 | grpsubcl 18950 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 − 𝑍) ∈ 𝐵) |
| 17 | 11, 3, 4, 16 | syl3anc 1373 | . . 3 ⊢ (𝜑 → (𝑌 − 𝑍) ∈ 𝐵) |
| 18 | 5, 6, 12 | grplid 18897 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑌 − 𝑍) ∈ 𝐵) → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 19 | 11, 17, 18 | syl2anc 584 | . 2 ⊢ (𝜑 → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 20 | 9, 15, 19 | 3eqtrd 2775 | 1 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = (𝑌 − 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 0gc0g 17359 Grpcgrp 18863 -gcsg 18865 Abelcabl 19710 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-sbg 18868 df-cmn 19711 df-abl 19712 |
| This theorem is referenced by: hdmaprnlem7N 42115 |
| Copyright terms: Public domain | W3C validator |