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

Theorem grpinvid1 19252
Description: The inverse of a group element expressed in terms of the identity element. (Contributed by NM, 24-Aug-2011.)
Hypotheses
Ref Expression
grpinv.b 𝐵 = (Base‘𝐺)
grpinv.p + = (+g‘𝐺)
grpinv.u 0 = (0g‘𝐺)
grpinv.n 𝑁 = (invg‘𝐺)
Assertion
Ref Expression
grpinvid1 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 ))

Proof of Theorem grpinvid1
StepHypRef Expression
1 oveq2 7459 . . . 4 ((𝑁‘𝑋) = 𝑌 → (𝑋 + (𝑁‘𝑋)) = (𝑋 + 𝑌))
21adantl 487 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + (𝑁‘𝑋)) = (𝑋 + 𝑌))
3 grpinv.b . . . . . 6 𝐵 = (Base‘𝐺)
4 grpinv.p . . . . . 6 + = (+g‘𝐺)
5 grpinv.u . . . . . 6 0 = (0g‘𝐺)
6 grpinv.n . . . . . 6 𝑁 = (invg‘𝐺)
73, 4, 5, 6grprinv 19251 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
873adant3 1150 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
98adantr 486 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + (𝑁‘𝑋)) = 0 )
102, 9eqtr3d 2800 . 2 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + 𝑌) = 0 )
11 oveq2 7459 . . . 4 ((𝑋 + 𝑌) = 0 → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = ((𝑁‘𝑋) + 0 ))
1211adantl 487 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = ((𝑁‘𝑋) + 0 ))
133, 4, 5, 6grplinv 19250 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 )
1413oveq1d 7466 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ( 0 + 𝑌))
15143adant3 1150 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ( 0 + 𝑌))
163, 6grpinvcl 19248 . . . . . . . . . 10 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵)
1716adantrr 730 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁‘𝑋) ∈ 𝐵)
18 simprl 783 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
19 simprr 785 . . . . . . . . 9 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
2017, 18, 193jca 1146 . . . . . . . 8 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑁‘𝑋) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))
213, 4grpass 19203 . . . . . . . 8 ((𝐺 ∈ Grp ∧ ((𝑁‘𝑋) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
2220, 21syldan 603 . . . . . . 7 ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
23223impb 1132 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
2415, 23eqtr3d 2800 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
253, 4, 5grplid 19228 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = 𝑌)
26253adant2 1149 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = 𝑌)
2724, 26eqtr3d 2800 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = 𝑌)
2827adantr 486 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = 𝑌)
293, 4, 5grprid 19229 . . . . . 6 ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
3016, 29syldan 603 . . . . 5 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
31303adant3 1150 . . . 4 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
3231adantr 486 . . 3 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
3312, 28, 323eqtr3rd 2807 . 2 (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘𝑋) = 𝑌)
3410, 33impbida 813 1 ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  0gc0g 17660  Grpcgrp 19194  invgcminusg 19195
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-riota 7408  df-ov 7454  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-minusg 19198
This theorem is used by:  grpinvid  19260  grpinvcnv  19267  grpinvadd  19278  subginv  19393  qusinv  19455  ghminv  19487  symginv  19667  frgpinv  20029  cnaddinv  20136  rngmneg1  20440  ringnegl  20584  lmodindp1  21340  lmodvsinv2  21363  cnfldneg  21756  zringinvg  21826  mdetunilem6  22987  invrvald  23046  dchrinv  27645  elrgspnlem1  33902  baerlem3lem1  43030
  Copyright terms: Public domain W3C validator