| 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 11414 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 2739 | . . 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 19783 | . 2 ⊢ (𝜑 → (𝑋 − (𝑋 − 𝑌)) = ((𝑋 − 𝑋)(+g‘𝐺)𝑌)) |
| 8 | ablgrp 19751 | . . . . 5 ⊢ (𝐺 ∈ Abel → 𝐺 ∈ Grp) | |
| 9 | 4, 8 | syl 17 | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) |
| 10 | eqid 2739 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 11 | 1, 10, 3 | grpsubid 18991 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 12 | 9, 5, 11 | syl2anc 590 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑋) = (0g‘𝐺)) |
| 13 | 12 | oveq1d 7371 | . 2 ⊢ (𝜑 → ((𝑋 − 𝑋)(+g‘𝐺)𝑌) = ((0g‘𝐺)(+g‘𝐺)𝑌)) |
| 14 | 1, 2, 10 | grplid 18934 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((0g‘𝐺)(+g‘𝐺)𝑌) = 𝑌) |
| 15 | 9, 6, 14 | syl2anc 590 | . 2 ⊢ (𝜑 → ((0g‘𝐺)(+g‘𝐺)𝑌) = 𝑌) |
| 16 | 7, 13, 15 | 3eqtrd 2778 | 1 ⊢ (𝜑 → (𝑋 − (𝑋 − 𝑌)) = 𝑌) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 ‘cfv 6485 (class class class)co 7356 Basecbs 17170 +gcplusg 17211 0gc0g 17393 Grpcgrp 18900 -gcsg 18902 Abelcabl 19747 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-1st 7931 df-2nd 7932 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18903 df-minusg 18904 df-sbg 18905 df-cmn 19748 df-abl 19749 |
| This theorem is referenced by: ablnnncan1 19789 pgpfac1lem3 20045 rngqiprngfulem4 21307 tsmsxplem1 24136 baerlem5blem2 42204 |
| Copyright terms: Public domain | W3C validator |