Theorem grpinvid2 13858

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 6092	. . . 4 ⊢ ((𝑁‘𝑋) = 𝑌 → ((𝑁‘𝑋) + 𝑋) = (𝑌 + 𝑋))
2	1	adantl 277	. . 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 13855	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 )
8	7	3adant3 1048	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 )
9	8	adantr 276	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → ((𝑁‘𝑋) + 𝑋) = 0 )
10	2, 9	eqtr3d 2273	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑁‘𝑋) = 𝑌) → (𝑌 + 𝑋) = 0 )
11	3, 6	grpinvcl 13853	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵)
12	3, 4, 5	grplid 13836	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ( 0 + (𝑁‘𝑋)) = (𝑁‘𝑋))
13	11, 12	syldan 282	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ( 0 + (𝑁‘𝑋)) = (𝑁‘𝑋))
14	13	3adant3 1048	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 + (𝑁‘𝑋)) = (𝑁‘𝑋))
15	14	eqcomd 2244	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑋) = ( 0 + (𝑁‘𝑋)))
16	15	adantr 276	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 + 𝑋) = 0 ) → (𝑁‘𝑋) = ( 0 + (𝑁‘𝑋)))
17		oveq1 6092	. . . 4 ⊢ ((𝑌 + 𝑋) = 0 → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = ( 0 + (𝑁‘𝑋)))
18	17	adantl 277	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 + 𝑋) = 0 ) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = ( 0 + (𝑁‘𝑋)))
19		simprr 537	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵)
20		simprl 535	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵)
21	11	adantrr 483	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁‘𝑋) ∈ 𝐵)
22	19, 20, 21	3jca 1208	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵))
23	3, 4	grpass 13814	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = (𝑌 + (𝑋 + (𝑁‘𝑋))))
24	22, 23	syldan 282	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = (𝑌 + (𝑋 + (𝑁‘𝑋))))
25	24	3impb 1230	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = (𝑌 + (𝑋 + (𝑁‘𝑋))))
26	3, 4, 5, 6	grprinv 13856	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 )
27	26	oveq2d 6101	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑌 + (𝑋 + (𝑁‘𝑋))) = (𝑌 + 0 ))
28	27	3adant3 1048	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 + (𝑋 + (𝑁‘𝑋))) = (𝑌 + 0 ))
29	3, 4, 5	grprid 13837	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑌 + 0 ) = 𝑌)
30	29	3adant2 1047	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 + 0 ) = 𝑌)
31	25, 28, 30	3eqtrd 2275	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = 𝑌)
32	31	adantr 276	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 + 𝑋) = 0 ) → ((𝑌 + 𝑋) + (𝑁‘𝑋)) = 𝑌)
33	16, 18, 32	3eqtr2d 2277	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 + 𝑋) = 0 ) → (𝑁‘𝑋) = 𝑌)
34	10, 33	impbida 604	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑁‘𝑋) = 𝑌 ↔ (𝑌 + 𝑋) = 0 ))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ‘cfv 5377  (class class class)co 6085  Basecbs 13352  +_gcplusg 13431  0_gc0g 13610  Grpcgrp 13805  inv_gcminusg 13806

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-0g 13612  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-grp 13808  df-minusg 13809

This theorem is used by:  grpinvcnv  13873  grpsubeq0  13891  prdsinvgd  14198  rngmneg2  14247  ringnegr  14357  psrneg  15078