Theorem grpinvid1 19202

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 7428	. . . 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 19201	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
8	7	3adant3 1150	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
9	8	adantr 486	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + (𝑁‘𝑋)) = 0 )
10	2, 9	eqtr3d 2798	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑋 + 𝑌) = 0 )
11		oveq2 7428	. . . 4 ⊢ ((𝑋 + 𝑌) = 0 → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = ((𝑁‘𝑋) + 0 ))
12	11	adantl 487	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = ((𝑁‘𝑋) + 0 ))
13	3, 4, 5, 6	grplinv 19200	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 )
14	13	oveq1d 7435	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ( 0 + 𝑌))
15	14	3adant3 1150	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ( 0 + 𝑌))
16	3, 6	grpinvcl 19198	. . . . . . . . . 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 19153	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘𝑋) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
22	20, 21	syldan 603	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
23	22	3impb 1132	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((𝑁‘𝑋) + 𝑋) + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
24	15, 23	eqtr3d 2798	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = ((𝑁‘𝑋) + (𝑋 + 𝑌)))
25	3, 4, 5	grplid 19178	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = 𝑌)
26	25	3adant2 1149	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + 𝑌) = 𝑌)
27	24, 26	eqtr3d 2798	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = 𝑌)
28	27	adantr 486	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 + 𝑌) = 0 ) → ((𝑁‘𝑋) + (𝑋 + 𝑌)) = 𝑌)
29	3, 4, 5	grprid 19179	. . . . . 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 2805	. 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 1570   ∈ wcel 2145  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  +_gcplusg 17428  0_gc0g 17610  Grpcgrp 19144  inv_gcminusg 19145

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-riota 7377  df-ov 7423  df-0g 17612  df-mgm 18816  df-sgrp 18908  df-mnd 18924  df-grp 19147  df-minusg 19148

This theorem is used by:  grpinvid  19210  grpinvcnv  19217  grpinvadd  19228  subginv  19343  qusinv  19405  ghminv  19437  symginv  19616  frgpinv  19978  cnaddinv  20085  rngmneg1  20389  ringnegl  20533  lmodindp1  21289  lmodvsinv2  21312  cnfldneg  21704  zringinvg  21771  mdetunilem6  22932  invrvald  22991  dchrinv  27588  elrgspnlem1  33803  baerlem3lem1  42764