MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpasscan2 Structured version   Visualization version   GIF version

Theorem grpasscan2 17400
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
StepHypRef Expression
1 simp1 1059 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝐺 ∈ Grp)
2 simp2 1060 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝑋𝐵)
3 grplcan.b . . . . 5 𝐵 = (Base‘𝐺)
4 grpasscan1.n . . . . 5 𝑁 = (invg𝐺)
53, 4grpinvcl 17388 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → (𝑁𝑌) ∈ 𝐵)
653adant2 1078 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑁𝑌) ∈ 𝐵)
7 simp3 1061 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → 𝑌𝐵)
8 grplcan.p . . . 4 + = (+g𝐺)
93, 8grpass 17352 . . 3 ((𝐺 ∈ Grp ∧ (𝑋𝐵 ∧ (𝑁𝑌) ∈ 𝐵𝑌𝐵)) → ((𝑋 + (𝑁𝑌)) + 𝑌) = (𝑋 + ((𝑁𝑌) + 𝑌)))
101, 2, 6, 7, 9syl13anc 1325 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 + (𝑁𝑌)) + 𝑌) = (𝑋 + ((𝑁𝑌) + 𝑌)))
11 eqid 2621 . . . . 5 (0g𝐺) = (0g𝐺)
123, 8, 11, 4grplinv 17389 . . . 4 ((𝐺 ∈ Grp ∧ 𝑌𝐵) → ((𝑁𝑌) + 𝑌) = (0g𝐺))
13123adant2 1078 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑁𝑌) + 𝑌) = (0g𝐺))
1413oveq2d 6620 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 + ((𝑁𝑌) + 𝑌)) = (𝑋 + (0g𝐺)))
153, 8, 11grprid 17374 . . 3 ((𝐺 ∈ Grp ∧ 𝑋𝐵) → (𝑋 + (0g𝐺)) = 𝑋)
16153adant3 1079 . 2 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → (𝑋 + (0g𝐺)) = 𝑋)
1710, 14, 163eqtrd 2659 1 ((𝐺 ∈ Grp ∧ 𝑋𝐵𝑌𝐵) → ((𝑋 + (𝑁𝑌)) + 𝑌) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1036   = wceq 1480  wcel 1987  cfv 5847  (class class class)co 6604  Basecbs 15781  +gcplusg 15862  0gc0g 16021  Grpcgrp 17343  invgcminusg 17344
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-id 4989  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-riota 6565  df-ov 6607  df-0g 16023  df-mgm 17163  df-sgrp 17205  df-mnd 17216  df-grp 17346  df-minusg 17347
This theorem is referenced by:  mulgaddcomlem  17484
  Copyright terms: Public domain W3C validator