grplinv - Metamath Proof Explorer

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

Theorem grplinv 18144

Description: The left inverse of a group element. (Contributed by NM, 24-Aug-2011.) (Revised by Mario Carneiro, 6-Jan-2015.)

**Hypotheses**
Ref	Expression
grpinv.b	⊢ 𝐵 = (Base‘𝐺)
grpinv.p	⊢ + = (+_g‘𝐺)
grpinv.u	⊢ 0 = (0_g‘𝐺)
grpinv.n	⊢ 𝑁 = (inv_g‘𝐺)

**Assertion**
Ref	Expression
grplinv	⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 )

Proof of Theorem grplinv Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpinv.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
2		grpinv.p	. . . . 5 ⊢ + = (+_g‘𝐺)
3		grpinv.u	. . . . 5 ⊢ 0 = (0_g‘𝐺)
4		grpinv.n	. . . . 5 ⊢ 𝑁 = (inv_g‘𝐺)
5	1, 2, 3, 4	grpinvval 18136	. . . 4 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ))
6	5	adantl 485	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ))
7	1, 2, 3	grpinveu 18130	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )
8		riotacl2 7109	. . . 4 ⊢ (∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 })
9	7, 8	syl 17	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 })
10	6, 9	eqeltrd 2890	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 })
11		oveq1 7142	. . . . 5 ⊢ (𝑦 = (𝑁‘𝑋) → (𝑦 + 𝑋) = ((𝑁‘𝑋) + 𝑋))
12	11	eqeq1d 2800	. . . 4 ⊢ (𝑦 = (𝑁‘𝑋) → ((𝑦 + 𝑋) = 0 ↔ ((𝑁‘𝑋) + 𝑋) = 0 ))
13	12	elrab 3628	. . 3 ⊢ ((𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 } ↔ ((𝑁‘𝑋) ∈ 𝐵 ∧ ((𝑁‘𝑋) + 𝑋) = 0 ))
14	13	simprbi 500	. 2 ⊢ ((𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 } → ((𝑁‘𝑋) + 𝑋) = 0 )
15	10, 14	syl 17	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∃!wreu 3108 {crab 3110 ‘cfv 6324 ℩crio 7092 (class class class)co 7135 Basecbs 16475 +_gcplusg 16557 0_gc0g 16705 Grpcgrp 18095 inv_gcminusg 18096

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-fv 6332 df-riota 7093 df-ov 7138 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099

This theorem is referenced by: grprinv 18145 grpinvid1 18146 grpinvid2 18147 isgrpinv 18148 grplrinv 18149 grplcan 18153 grpasscan2 18155 grpinvinv 18158 grpinvssd 18168 grpsubadd 18179 grplactcnv 18194 prdsinvlem 18200 imasgrp 18207 ghmgrp 18215 mulgdirlem 18250 issubg2 18286 isnsg3 18304 nmzsubg 18309 ssnmz 18310 eqger 18322 qusgrp 18327 conjghm 18381 galcan 18426 cntzsubg 18459 lsmmod 18793 lsmdisj2 18800 rngnegr 19341 unitlinv 19423 isdrng2 19505 lmodvneg1 19670 evpmodpmf1o 20285 psrlinv 20635 grpvlinv 21002 tgpconncompeqg 22717 qustgpopn 22725 clmvslinv 23713 ogrpinv0le 30766 ogrpaddltrbid 30771 ogrpinv0lt 30773 ogrpinvlt 30774 lflnegl 36372 dvhgrp 38403

W3C validator