Metamath Proof Explorer


Theorem grpsubrcan

Description: Right cancellation law for group subtraction. (Contributed by NM, 31-Mar-2014)

Ref Expression
Hypotheses grpsubcl.b B=BaseG
grpsubcl.m -˙=-G
Assertion grpsubrcan GGrpXBYBZBX-˙Z=Y-˙ZX=Y

Proof

Step Hyp Ref Expression
1 grpsubcl.b B=BaseG
2 grpsubcl.m -˙=-G
3 eqid +G=+G
4 eqid invgG=invgG
5 1 3 4 2 grpsubval XBZBX-˙Z=X+GinvgGZ
6 5 3adant2 XBYBZBX-˙Z=X+GinvgGZ
7 1 3 4 2 grpsubval YBZBY-˙Z=Y+GinvgGZ
8 7 3adant1 XBYBZBY-˙Z=Y+GinvgGZ
9 6 8 eqeq12d XBYBZBX-˙Z=Y-˙ZX+GinvgGZ=Y+GinvgGZ
10 9 adantl GGrpXBYBZBX-˙Z=Y-˙ZX+GinvgGZ=Y+GinvgGZ
11 simpl GGrpXBYBZBGGrp
12 simpr1 GGrpXBYBZBXB
13 simpr2 GGrpXBYBZBYB
14 1 4 grpinvcl GGrpZBinvgGZB
15 14 3ad2antr3 GGrpXBYBZBinvgGZB
16 1 3 grprcan GGrpXBYBinvgGZBX+GinvgGZ=Y+GinvgGZX=Y
17 11 12 13 15 16 syl13anc GGrpXBYBZBX+GinvgGZ=Y+GinvgGZX=Y
18 10 17 bitrd GGrpXBYBZBX-˙Z=Y-˙ZX=Y