Metamath Proof Explorer


Theorem grpasscan1

Description: An associative cancellation law for groups. (Contributed by Paul Chapman, 25-Feb-2008) (Revised by AV, 30-Aug-2021)

Ref Expression
Hypotheses grplcan.b B=BaseG
grplcan.p +˙=+G
grpasscan1.n N=invgG
Assertion grpasscan1 GGrpXBYBX+˙NX+˙Y=Y

Proof

Step Hyp Ref Expression
1 grplcan.b B=BaseG
2 grplcan.p +˙=+G
3 grpasscan1.n N=invgG
4 eqid 0G=0G
5 1 2 4 3 grprinv GGrpXBX+˙NX=0G
6 5 3adant3 GGrpXBYBX+˙NX=0G
7 6 oveq1d GGrpXBYBX+˙NX+˙Y=0G+˙Y
8 1 3 grpinvcl GGrpXBNXB
9 1 2 grpass GGrpXBNXBYBX+˙NX+˙Y=X+˙NX+˙Y
10 9 3exp2 GGrpXBNXBYBX+˙NX+˙Y=X+˙NX+˙Y
11 10 imp GGrpXBNXBYBX+˙NX+˙Y=X+˙NX+˙Y
12 8 11 mpd GGrpXBYBX+˙NX+˙Y=X+˙NX+˙Y
13 12 3impia GGrpXBYBX+˙NX+˙Y=X+˙NX+˙Y
14 1 2 4 grplid GGrpYB0G+˙Y=Y
15 14 3adant2 GGrpXBYB0G+˙Y=Y
16 7 13 15 3eqtr3d GGrpXBYBX+˙NX+˙Y=Y