Theorem grpinvid2 19196

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
grpinvid2	⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) = 𝑌 ↔ (𝑌 + 𝑋) = 0 ))

Proof of Theorem grpinvid2

Step	Hyp	Ref	Expression
1		oveq1 7425	. . . 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	grplinv 19193	. . . . 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	3, 6	grpinvcl 19191	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵)
12	3, 4, 5	grplid 19171	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ( 0 + (𝑁‘𝑋)) = (𝑁‘𝑋))
13	11, 12	syldan 603	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 + (𝑁‘𝑋)) = (𝑁‘𝑋))
14	13	3adant3 1150	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + (𝑁‘𝑋)) = (𝑁‘𝑋))
15	14	eqcomd 2767	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑋) = ( 0 + (𝑁‘𝑋)))
16	15	adantr 486	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 + 𝑋) = 0 ) → (𝑁‘𝑋) = ( 0 + (𝑁‘𝑋)))
17		oveq1 7425	. . . 4 ⊢ ((𝑌 + 𝑋) = 0 → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = ( 0 + (𝑁‘𝑋)))
18	17	adantl 487	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 + 𝑋) = 0 ) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = ( 0 + (𝑁‘𝑋)))
19		simprr 785	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
20		simprl 783	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
21	11	adantrr 730	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁‘𝑋) ∈ 𝐵)
22	19, 20, 21	3jca 1146	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵))
23	3, 4	grpass 19146	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = (𝑌 + (𝑋 + (𝑁‘𝑋))))
24	22, 23	syldan 603	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = (𝑌 + (𝑋 + (𝑁‘𝑋))))
25	24	3impb 1132	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = (𝑌 + (𝑋 + (𝑁‘𝑋))))
26	3, 4, 5, 6	grprinv 19194	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
27	26	oveq2d 7434	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑌 + (𝑋 + (𝑁‘𝑋))) = (𝑌 + 0 ))
28	27	3adant3 1150	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 + (𝑋 + (𝑁‘𝑋))) = (𝑌 + 0 ))
29	3, 4, 5	grprid 19172	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑌 + 0 ) = 𝑌)
30	29	3adant2 1149	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 + 0 ) = 𝑌)
31	25, 28, 30	3eqtrd 2800	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = 𝑌)
32	31	adantr 486	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 + 𝑋) = 0 ) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = 𝑌)
33	16, 18, 32	3eqtr2d 2802	. 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 6537  (class class class)co 7418  Basecbs 17380  +_gcplusg 17421  0_gc0g 17603  Grpcgrp 19137  inv_gcminusg 19138

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 7749

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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-riota 7375  df-ov 7421  df-0g 17605  df-mgm 18809  df-sgrp 18901  df-mnd 18917  df-grp 19140  df-minusg 19141

This theorem is used by:  grpinvcnv  19210  grpsubeq0  19229  prdsinvgd  19254  xpsinv  19263  eqg0subg  19404  rngmneg2  20383  ringnegr  20527  islindf4  22137  psrneg  22259  pi1inv  25366  fldhmf1  43120  lindslinindimp2lem4  49542  lincresunit3  49562