| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpnpcan | Structured version Visualization version GIF version | ||
| Description: Cancellation law for subtraction (npcan 11517 analog). (Contributed by NM, 19-Apr-2014.) |
| Ref | Expression |
|---|---|
| grpsubadd.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpsubadd.p | ⊢ + = (+g‘𝐺) |
| grpsubadd.m | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| grpnpcan | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) + 𝑌) = 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpsubadd.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | eqid 2737 | . . . . . 6 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 3 | 1, 2 | grpinvcl 19005 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 4 | 3 | 3adant2 1132 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘𝑌) ∈ 𝐵) |
| 5 | grpsubadd.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 6 | 1, 5 | grpcl 18959 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵) → (𝑋 + ((invg‘𝐺)‘𝑌)) ∈ 𝐵) |
| 7 | 4, 6 | syld3an3 1411 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + ((invg‘𝐺)‘𝑌)) ∈ 𝐵) |
| 8 | grpsubadd.m | . . . 4 ⊢ − = (-g‘𝐺) | |
| 9 | 1, 5, 2, 8 | grpsubval 19003 | . . 3 ⊢ (((𝑋 + ((invg‘𝐺)‘𝑌)) ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵) → ((𝑋 + ((invg‘𝐺)‘𝑌)) − ((invg‘𝐺)‘𝑌)) = ((𝑋 + ((invg‘𝐺)‘𝑌)) + ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)))) |
| 10 | 7, 4, 9 | syl2anc 584 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + ((invg‘𝐺)‘𝑌)) − ((invg‘𝐺)‘𝑌)) = ((𝑋 + ((invg‘𝐺)‘𝑌)) + ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)))) |
| 11 | 1, 5, 8 | grppncan 19049 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝐵) → ((𝑋 + ((invg‘𝐺)‘𝑌)) − ((invg‘𝐺)‘𝑌)) = 𝑋) |
| 12 | 4, 11 | syld3an3 1411 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + ((invg‘𝐺)‘𝑌)) − ((invg‘𝐺)‘𝑌)) = 𝑋) |
| 13 | 1, 5, 2, 8 | grpsubval 19003 | . . . . 5 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌))) |
| 14 | 13 | 3adant1 1131 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 − 𝑌) = (𝑋 + ((invg‘𝐺)‘𝑌))) |
| 15 | 14 | eqcomd 2743 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + ((invg‘𝐺)‘𝑌)) = (𝑋 − 𝑌)) |
| 16 | 1, 2 | grpinvinv 19023 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
| 17 | 16 | 3adant2 1132 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑌)) = 𝑌) |
| 18 | 15, 17 | oveq12d 7449 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + ((invg‘𝐺)‘𝑌)) + ((invg‘𝐺)‘((invg‘𝐺)‘𝑌))) = ((𝑋 − 𝑌) + 𝑌)) |
| 19 | 10, 12, 18 | 3eqtr3rd 2786 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 − 𝑌) + 𝑌) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ‘cfv 6561 (class class class)co 7431 Basecbs 17247 +gcplusg 17297 Grpcgrp 18951 invgcminusg 18952 -gcsg 18953 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-1st 8014 df-2nd 8015 df-0g 17486 df-mgm 18653 df-sgrp 18732 df-mnd 18748 df-grp 18954 df-minusg 18955 df-sbg 18956 |
| This theorem is referenced by: grpsubsub4 19051 grpnpncan 19053 grpnnncan2 19055 dfgrp3 19057 xpsgrpsub 19079 nsgconj 19177 conjghm 19267 conjnmz 19270 sylow2blem1 19638 ablpncan3 19834 lmodvnpcan 20914 ipsubdir 21660 ipsubdi 21661 coe1subfv 22269 mdetunilem9 22626 subgntr 24115 ghmcnp 24123 tgpt0 24127 r1pid 26200 archiabllem1a 33198 archiabllem2a 33201 ornglmulle 33335 orngrmulle 33336 kercvrlsm 43095 hbtlem5 43140 |
| Copyright terms: Public domain | W3C validator |