| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ablnncan | Structured version Visualization version GIF version | ||
| Description: Cancellation law for group subtraction. (nncan 11419 analog.) (Contributed by NM, 7-Apr-2015.) |
| Ref | Expression |
|---|---|
| ablnncan.b | ⊢ 𝐵 = (Base‘𝐺) |
| ablnncan.m | ⊢ − = (-g‘𝐺) |
| ablnncan.g | ⊢ (𝜑 → 𝐺 ∈ Abel) |
| ablnncan.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ablnncan.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| ablnncan | ⊢ (𝜑 → (𝑋 − (𝑋 − 𝑌)) = 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ablnncan.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2741 | . . 3 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 3 | ablnncan.m | . . 3 ⊢ − = (-g‘𝐺) | |
| 4 | ablnncan.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ Abel) | |
| 5 | ablnncan.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 6 | ablnncan.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 7 | 1, 2, 3, 4, 5, 5, 6 | ablsubsub 19786 | . 2 ⊢ (𝜑 → (𝑋 − (𝑋 − 𝑌)) = ((𝑋 − 𝑋)(+g‘𝐺)𝑌)) |
| 8 | ablgrp 19754 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 9 | 4, 8 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 10 | eqid 2741 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 11 | 1, 10, 3 | grpsubid 18995 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 12 | 9, 5, 11 | syl2anc 591 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 13 | 12 | oveq1d 7374 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑋)(+g‘𝐺)𝑌) = ((0g‘𝐺)(+g‘𝐺)𝑌)) |
| 14 | 1, 2, 10 | grplid 18938 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((0g‘𝐺)(+g‘𝐺)𝑌) = 𝑌) |
| 15 | 9, 6, 14 | syl2anc 591 | . 2 ⊢ (𝜑 → ((0g‘𝐺)(+g‘𝐺)𝑌) = 𝑌) |
| 16 | 7, 13, 15 | 3eqtrd 2780 | 1 ⊢ (𝜑 → (𝑋 − (𝑋 − 𝑌)) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1548 ∈ wcel 2121 ‘cfv 6488 (class class class)co 7359 Basecbs 17174 +gcplusg 17215 0gc0g 17397 Grpcgrp 18904 -gcsg 18906 Abelcabl 19750 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-1st 7933 df-2nd 7934 df-0g 17399 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-grp 18907 df-minusg 18908 df-sbg 18909 df-cmn 19751 df-abl 19752 |
| This theorem is referenced by: ablnnncan1 19792 pgpfac1lem3 20048 rngqiprngfulem4 21310 tsmsxplem1 24139 baerlem5blem2 42217 |
| Copyright terms: Public domain | W3C validator |