Theorem grpasscan2 19057

Description: An associative cancellation law for groups. (Contributed by Paul Chapman, 17-Apr-2009.) (Revised by AV, 30-Aug-2021.)

Hypotheses

Ref	Expression
grplcan.b	⊢ 𝐵 = (Base‘𝐺)
grplcan.p	⊢ + = (+g‘𝐺)
grpasscan1.n	⊢ 𝑁 = (invg‘𝐺)

Assertion

Ref	Expression
grpasscan2	⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = 𝑋)

Proof of Theorem grpasscan2

Step	Hyp	Ref	Expression
1		simp1 1152	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐺 ∈ Grp)
2		simp2 1153	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵)
3		grplcan.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
4		grpasscan1.n	. . . . 5 ⊢ 𝑁 = (invg‘𝐺)
5	3, 4	grpinvcl 19042	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵)
6	5	3adant2 1147	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵)
7		simp3 1154	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵)
8		grplcan.p	. . . 4 ⊢ + = (+g‘𝐺)
9	3, 8	grpass 18997	. . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ (𝑁‘𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = (𝑋 + ((𝑁‘𝑌) + 𝑌)))
10	1, 2, 6, 7, 9	syl13anc 1395	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = (𝑋 + ((𝑁‘𝑌) + 𝑌)))
11		eqid 2765	. . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺)
12	3, 8, 11, 4	grplinv 19044	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑌) + 𝑌) = (0g‘𝐺))
13	12	3adant2 1147	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑌) + 𝑌) = (0g‘𝐺))
14	13	oveq2d 7416	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + ((𝑁‘𝑌) + 𝑌)) = (𝑋 + (0g‘𝐺)))
15	3, 8, 11	grprid 19023	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (0g‘𝐺)) = 𝑋)
16	15	3adant3 1148	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (0g‘𝐺)) = 𝑋)
17	10, 14, 16	3eqtrd 2804	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 + (𝑁‘𝑌)) + 𝑌) = 𝑋)

Syntax hints:   → wi 4   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145  ‘cfv 6525  (class class class)co 7400  Basecbs 17257  +_gcplusg 17298  0_gc0g 17480  Grpcgrp 18988  inv_gcminusg 18989

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fv 6533  df-riota 7357  df-ov 7403  df-0g 17482  df-mgm 18686  df-sgrp 18765  df-mnd 18781  df-grp 18991  df-minusg 18992

This theorem is referenced by:  mulgaddcomlem  19151  grpasscan2d  43136