Theorem grpasscan1 13645

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

Hypotheses

Ref	Expression
grplcan.b	|- B = ( Base ` G )
grplcan.p	|- .+ = ( +g ` G )
grpasscan1.n	|- N = ( invg ` G )

Assertion

Ref	Expression
grpasscan1	|- ( ( G e. Grp /\ X e. B /\ Y e. B ) -> ( X .+ ( ( N ` X ) .+ Y ) ) = Y )

Proof of Theorem grpasscan1

Step	Hyp	Ref	Expression
1		grplcan.b	. . . . 5 |- B = ( Base ` G )
2		grplcan.p	. . . . 5 |- .+ = ( +g ` G )
3		eqid 2231	. . . . 5 |- ( 0g ` G ) = ( 0g ` G )
4		grpasscan1.n	. . . . 5 |- N = ( invg ` G )
5	1, 2, 3, 4	grprinv 13633	. . . 4 |- ( ( G e. Grp /\ X e. B ) -> ( X .+ ( N ` X ) ) = ( 0g ` G ) )
6	5	3adant3 1043	. . 3 |- ( ( G e. Grp /\ X e. B /\ Y e. B ) -> ( X .+ ( N ` X ) ) = ( 0g ` G ) )
7	6	oveq1d 6032	. 2 |- ( ( G e. Grp /\ X e. B /\ Y e. B ) -> ( ( X .+ ( N ` X ) ) .+ Y ) = ( ( 0g ` G ) .+ Y ) )
8	1, 4	grpinvcl 13630	. . . 4 |- ( ( G e. Grp /\ X e. B ) -> ( N ` X ) e. B )
9	1, 2	grpass 13591	. . . . . 6 |- ( ( G e. Grp /\ ( X e. B /\ ( N ` X ) e. B /\ Y e. B ) ) -> ( ( X .+ ( N ` X ) ) .+ Y ) = ( X .+ ( ( N ` X ) .+ Y ) ) )
10	9	3exp2 1251	. . . . 5 |- ( G e. Grp -> ( X e. B -> ( ( N ` X ) e. B -> ( Y e. B -> ( ( X .+ ( N ` X ) ) .+ Y ) = ( X .+ ( ( N ` X ) .+ Y ) ) ) ) ) )
11	10	imp 124	. . . 4 |- ( ( G e. Grp /\ X e. B ) -> ( ( N ` X ) e. B -> ( Y e. B -> ( ( X .+ ( N ` X ) ) .+ Y ) = ( X .+ ( ( N ` X ) .+ Y ) ) ) ) )
12	8, 11	mpd 13	. . 3 |- ( ( G e. Grp /\ X e. B ) -> ( Y e. B -> ( ( X .+ ( N ` X ) ) .+ Y ) = ( X .+ ( ( N ` X ) .+ Y ) ) ) )
13	12	3impia 1226	. 2 |- ( ( G e. Grp /\ X e. B /\ Y e. B ) -> ( ( X .+ ( N ` X ) ) .+ Y ) = ( X .+ ( ( N ` X ) .+ Y ) ) )
14	1, 2, 3	grplid 13613	. . 3 |- ( ( G e. Grp /\ Y e. B ) -> ( ( 0g ` G ) .+ Y ) = Y )
15	14	3adant2 1042	. 2 |- ( ( G e. Grp /\ X e. B /\ Y e. B ) -> ( ( 0g ` G ) .+ Y ) = Y )
16	7, 13, 15	3eqtr3d 2272	1 |- ( ( G e. Grp /\ X e. B /\ Y e. B ) -> ( X .+ ( ( N ` X ) .+ Y ) ) = Y )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1004   = wceq 1397   e. wcel 2202   ` cfv 5326  (class class class)co 6017   Basecbs 13081   +g cplusg 13159   0gc0g 13338   Grpcgrp 13582   invgcminusg 13583

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5970  df-ov 6020  df-inn 9143  df-2 9201  df-ndx 13084  df-slot 13085  df-base 13087  df-plusg 13172  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-grp 13585  df-minusg 13586

This theorem is referenced by:  mulgaddcomlem  13731