| 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 11433 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 19785 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 9 | 1, 2, 3, 2, 4, 8 | syl122anc 1382 | . 2 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 10 | ablgrp 19760 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 11 | 1, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 12 | eqid 2736 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 13 | 5, 12, 7 | grpsubid 19000 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 14 | 11, 2, 13 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 15 | 14 | oveq1d 7382 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑋) + (𝑌 − 𝑍)) = ((0g‘𝐺) + (𝑌 − 𝑍))) |
| 16 | 5, 7 | grpsubcl 18996 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 − 𝑍) ∈ 𝐵) |
| 17 | 11, 3, 4, 16 | syl3anc 1374 | . . 3 ⊢ (𝜑 → (𝑌 − 𝑍) ∈ 𝐵) |
| 18 | 5, 6, 12 | grplid 18943 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑌 − 𝑍) ∈ 𝐵) → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 19 | 11, 17, 18 | syl2anc 585 | . 2 ⊢ (𝜑 → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 20 | 9, 15, 19 | 3eqtrd 2775 | 1 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = (𝑌 − 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 +gcplusg 17220 0gc0g 17402 Grpcgrp 18909 -gcsg 18911 Abelcabl 19756 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-1st 7942 df-2nd 7943 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-sbg 18914 df-cmn 19757 df-abl 19758 |
| This theorem is referenced by: hdmaprnlem7N 42301 |
| Copyright terms: Public domain | W3C validator |