Metamath Proof Explorer


Theorem grprcan

Description: Right cancellation law for groups. (Contributed by NM, 24-Aug-2011) (Proof shortened by Mario Carneiro, 6-Jan-2015)

Ref Expression
Hypotheses grprcan.b B=BaseG
grprcan.p +˙=+G
Assertion grprcan GGrpXBYBZBX+˙Z=Y+˙ZX=Y

Proof

Step Hyp Ref Expression
1 grprcan.b B=BaseG
2 grprcan.p +˙=+G
3 eqid 0G=0G
4 1 2 3 grpinvex GGrpZByBy+˙Z=0G
5 4 3ad2antr3 GGrpXBYBZByBy+˙Z=0G
6 simprr GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX+˙Z=Y+˙Z
7 6 oveq1d GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX+˙Z+˙y=Y+˙Z+˙y
8 simpll GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZGGrp
9 1 2 grpass GGrpuBvBwBu+˙v+˙w=u+˙v+˙w
10 8 9 sylan GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZuBvBwBu+˙v+˙w=u+˙v+˙w
11 simplr1 GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZXB
12 simplr3 GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZZB
13 simprll GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZyB
14 10 11 12 13 caovassd GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX+˙Z+˙y=X+˙Z+˙y
15 simplr2 GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZYB
16 10 15 12 13 caovassd GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZY+˙Z+˙y=Y+˙Z+˙y
17 7 14 16 3eqtr3d GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX+˙Z+˙y=Y+˙Z+˙y
18 1 2 grpcl GGrpuBvBu+˙vB
19 8 18 syl3an1 GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZuBvBu+˙vB
20 1 3 grpidcl GGrp0GB
21 8 20 syl GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙Z0GB
22 1 2 3 grplid GGrpuB0G+˙u=u
23 8 22 sylan GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZuB0G+˙u=u
24 1 2 3 grpinvex GGrpuBvBv+˙u=0G
25 8 24 sylan GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZuBvBv+˙u=0G
26 simpr GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZZBZB
27 13 adantr GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZZByB
28 simprlr GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙Zy+˙Z=0G
29 28 adantr GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZZBy+˙Z=0G
30 19 21 23 10 25 26 27 29 grprinvd GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZZBZ+˙y=0G
31 12 30 mpdan GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZZ+˙y=0G
32 31 oveq2d GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX+˙Z+˙y=X+˙0G
33 31 oveq2d GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZY+˙Z+˙y=Y+˙0G
34 17 32 33 3eqtr3d GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX+˙0G=Y+˙0G
35 1 2 3 grprid GGrpXBX+˙0G=X
36 8 11 35 syl2anc GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX+˙0G=X
37 1 2 3 grprid GGrpYBY+˙0G=Y
38 8 15 37 syl2anc GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZY+˙0G=Y
39 34 36 38 3eqtr3d GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX=Y
40 39 expr GGrpXBYBZByBy+˙Z=0GX+˙Z=Y+˙ZX=Y
41 5 40 rexlimddv GGrpXBYBZBX+˙Z=Y+˙ZX=Y
42 oveq1 X=YX+˙Z=Y+˙Z
43 41 42 impbid1 GGrpXBYBZBX+˙Z=Y+˙ZX=Y