| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablpncan2 | Structured version Visualization version GIF version | ||
| Description: Cancellation law for subtraction in an Abelian group. (Contributed by NM, 2-Oct-2014.) |
| Ref | Expression |
|---|---|
| ablsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablsubadd.p | ⊢ + = (+g‘𝐺) |
| ablsubadd.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| ablpncan2 | ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + 𝑌) − 𝑋) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Abel) | |
| 2 | simp2 1155 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 3 | simp3 1156 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 4 | ablsubadd.b | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 5 | ablsubadd.p | . . . 4 ⊢ + = (+g‘𝐺) | |
| 6 | ablsubadd.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 7 | 4, 5, 6 | abladdsub 20059 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑋 + 𝑌) − 𝑋) = ((𝑋 − 𝑋) + 𝑌)) |
| 8 | 1, 2, 3, 2, 7 | syl13anc 1400 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + 𝑌) − 𝑋) = ((𝑋 − 𝑋) + 𝑌)) |
| 9 | ablgrp 20032 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 10 | 1, 9 | syl 18 | . . . 4 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp) |
| 11 | eqid 2763 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 12 | 4, 11, 6 | grpsubid 19266 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 13 | 10, 2, 12 | syl2anc 596 | . . 3 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 14 | 13 | oveq1d 7461 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑋) + 𝑌) = ((0g‘𝐺) + 𝑌)) |
| 15 | 4, 5, 11 | grplid 19210 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((0g‘𝐺) + 𝑌) = 𝑌) |
| 16 | 10, 3, 15 | syl2anc 596 | . 2 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((0g‘𝐺) + 𝑌) = 𝑌) |
| 17 | 8, 14, 16 | 3eqtrd 2802 | 1 ⊢ ((𝐺 ∈ Abel ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + 𝑌) − 𝑋) = 𝑌) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ‘cfv 6561 (class class class)co 7446 Basecbs 17419 +gcplusg 17460 0gc0g 17642 Grpcgrp 19176 -gcsg 19178 Abelcabl 20028 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-1st 8028 df-2nd 8029 df-0g 17644 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-grp 19179 df-minusg 19180 df-sbg 19181 df-cmn 20029 df-abl 20030 |
| This theorem is used by: lssvancl1 21253 lspprabs 21403 lsmcv 21452 ngpocelbl 25056 ttgcontlem1 29495 edompidlem 33940 |
| Copyright terms: Public domain | W3C validator |