| 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 11549 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 19829 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵)) → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 9 | 1, 2, 3, 2, 4, 8 | syl122anc 1380 | . 2 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = ((𝑋 − 𝑋) + (𝑌 − 𝑍))) |
| 10 | ablgrp 19804 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 11 | 1, 10 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 12 | eqid 2736 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 13 | 5, 12, 7 | grpsubid 19043 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 14 | 11, 2, 13 | syl2anc 584 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 15 | 14 | oveq1d 7447 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑋) + (𝑌 − 𝑍)) = ((0g‘𝐺) + (𝑌 − 𝑍))) |
| 16 | 5, 7 | grpsubcl 19039 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝐵) → (𝑌 − 𝑍) ∈ 𝐵) |
| 17 | 11, 3, 4, 16 | syl3anc 1372 | . . 3 ⊢ (𝜑 → (𝑌 − 𝑍) ∈ 𝐵) |
| 18 | 5, 6, 12 | grplid 18986 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑌 − 𝑍) ∈ 𝐵) → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 19 | 11, 17, 18 | syl2anc 584 | . 2 ⊢ (𝜑 → ((0g‘𝐺) + (𝑌 − 𝑍)) = (𝑌 − 𝑍)) |
| 20 | 9, 15, 19 | 3eqtrd 2780 | 1 ⊢ (𝜑 → ((𝑋 + 𝑌) − (𝑋 + 𝑍)) = (𝑌 − 𝑍)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2107 ‘cfv 6560 (class class class)co 7432 Basecbs 17248 +gcplusg 17298 0gc0g 17485 Grpcgrp 18952 -gcsg 18954 Abelcabl 19800 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-id 5577 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-1st 8015 df-2nd 8016 df-0g 17487 df-mgm 18654 df-sgrp 18733 df-mnd 18749 df-grp 18955 df-minusg 18956 df-sbg 18957 df-cmn 19801 df-abl 19802 |
| This theorem is referenced by: hdmaprnlem7N 41858 |
| Copyright terms: Public domain | W3C validator |