Theorem grpinvid1 19214

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

Step	Hyp	Ref	Expression
1		oveq2 7435	. . . 4 ⊢ ((𝑁‘𝑋) = 𝑌 → (𝑋 + (𝑁‘𝑋)) = (𝑋 + 𝑌))
2	1	adantl 487	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + (𝑁‘𝑋)) = (𝑋 + 𝑌))
3		grpinv.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4		grpinv.p	. . . . . 6 ⊢ + = (+g‘𝐺)
5		grpinv.u	. . . . . 6 ⊢ 0 = (0g‘𝐺)
6		grpinv.n	. . . . . 6 ⊢ 𝑁 = (invg‘𝐺)
7	3, 4, 5, 6	grprinv 19213	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
8	7	3adant3 1150	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
9	8	adantr 486	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + (𝑁‘𝑋)) = 0 )
10	2, 9	eqtr3d 2800	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + 𝑌) = 0 )
11		oveq2 7435	. . . 4 ⊢ ((𝑋 + 𝑌) = 0 → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = ((𝑁‘𝑋) + 0 ))
12	11	adantl 487	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = ((𝑁‘𝑋) + 0 ))
13	3, 4, 5, 6	grplinv 19212	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 )
14	13	oveq1d 7442	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ( 0 + 𝑌))
15	14	3adant3 1150	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ( 0 + 𝑌))
16	3, 6	grpinvcl 19210	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵)
17	16	adantrr 730	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁‘𝑋) ∈ 𝐵)
18		simprl 783	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
19		simprr 785	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
20	17, 18, 19	3jca 1146	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑁‘𝑋) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))
21	3, 4	grpass 19165	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘𝑋) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
22	20, 21	syldan 603	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
23	22	3impb 1132	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
24	15, 23	eqtr3d 2800	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
25	3, 4, 5	grplid 19190	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = 𝑌)
26	25	3adant2 1149	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = 𝑌)
27	24, 26	eqtr3d 2800	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = 𝑌)
28	27	adantr 486	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = 𝑌)
29	3, 4, 5	grprid 19191	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
30	16, 29	syldan 603	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
31	30	3adant3 1150	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
32	31	adantr 486	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + 0 ) = (𝑁‘𝑋))
33	12, 28, 32	3eqtr3rd 2807	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → (𝑁‘𝑋) = 𝑌)
34	10, 33	impbida 813	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) = 𝑌 ↔ (𝑋 + 𝑌) = 0 ))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146  ‘cfv 6546  (class class class)co 7427  Basecbs 17399  +_gcplusg 17440  0_gc0g 17622  Grpcgrp 19156  inv_gcminusg 19157

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-fv 6554  df-riota 7384  df-ov 7430  df-0g 17624  df-mgm 18828  df-sgrp 18920  df-mnd 18936  df-grp 19159  df-minusg 19160

This theorem is used by:  grpinvid  19222  grpinvcnv  19229  grpinvadd  19240  subginv  19355  qusinv  19417  ghminv  19449  symginv  19628  frgpinv  19990  cnaddinv  20097  rngmneg1  20401  ringnegl  20545  lmodindp1  21301  lmodvsinv2  21324  cnfldneg  21716  zringinvg  21783  mdetunilem6  22944  invrvald  23003  dchrinv  27600  elrgspnlem1  33856  baerlem3lem1  42904