| 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 11417 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 2737 | . . 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 2737 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 11 | 1, 10, 3 | grpsubid 18994 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 12 | 9, 5, 11 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 13 | 12 | oveq1d 7376 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑋)(+g‘𝐺)𝑌) = ((0g‘𝐺)(+g‘𝐺)𝑌)) |
| 14 | 1, 2, 10 | grplid 18937 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((0g‘𝐺)(+g‘𝐺)𝑌) = 𝑌) |
| 15 | 9, 6, 14 | syl2anc 585 | . 2 ⊢ (𝜑 → ((0g‘𝐺)(+g‘𝐺)𝑌) = 𝑌) |
| 16 | 7, 13, 15 | 3eqtrd 2776 | 1 ⊢ (𝜑 → (𝑋 − (𝑋 − 𝑌)) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6493 (class class class)co 7361 Basecbs 17173 +gcplusg 17214 0gc0g 17396 Grpcgrp 18903 -gcsg 18905 Abelcabl 19750 |
| 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 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-1st 7936 df-2nd 7937 df-0g 17398 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-grp 18906 df-minusg 18907 df-sbg 18908 df-cmn 19751 df-abl 19752 |
| This theorem is referenced by: ablnnncan1 19792 pgpfac1lem3 20048 rngqiprngfulem4 21307 tsmsxplem1 24131 baerlem5blem2 42175 |
| Copyright terms: Public domain | W3C validator |