| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grplinv | Structured version Visualization version GIF version | ||
| Description: The left inverse of a group element. (Contributed by NM, 24-Aug-2011.) (Revised by Mario Carneiro, 6-Jan-2015.) |
| Ref | Expression |
|---|---|
| grpinv.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpinv.p | ⊢ + = (+g‘𝐺) |
| grpinv.u | ⊢ 0 = (0g‘𝐺) |
| grpinv.n | ⊢ 𝑁 = (invg‘𝐺) |
| Ref | Expression |
|---|---|
| grplinv | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpinv.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | grpinv.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 3 | grpinv.u | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
| 4 | grpinv.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
| 5 | 1, 2, 3, 4 | grpinvval 19110 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 6 | 5 | adantl 487 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 7 | 1, 2, 3 | grpinveu 19104 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) |
| 8 | riotacl2 7390 | . . . 4 ⊢ (∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 10 | 6, 9 | eqeltrd 2862 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 11 | oveq1 7424 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑋) → (𝑦 + 𝑋) = ((𝑁‘𝑋) + 𝑋)) | |
| 12 | 11 | eqeq1d 2764 | . . . 4 ⊢ (𝑦 = (𝑁‘𝑋) → ((𝑦 + 𝑋) = 0 ↔ ((𝑁‘𝑋) + 𝑋) = 0 )) |
| 13 | 12 | elrab 3648 | . . 3 ⊢ ((𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 } ↔ ((𝑁‘𝑋) ∈ 𝐵 ∧ ((𝑁‘𝑋) + 𝑋) = 0 )) |
| 14 | 13 | simprbi 503 | . 2 ⊢ ((𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 } → ((𝑁‘𝑋) + 𝑋) = 0 ) |
| 15 | 10, 14 | syl 18 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃!wreu 3365 {crab 3414 ‘cfv 6537 ℩crio 7373 (class class class)co 7417 Basecbs 17307 +gcplusg 17348 0gc0g 17530 Grpcgrp 19063 invgcminusg 19064 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-riota 7374 df-ov 7420 df-0g 17532 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 df-minusg 19067 |
| This theorem is used by: grprinv 19120 grpinvid1 19121 grpinvid2 19122 isgrpinv 19123 grplinvd 19124 grplrinv 19126 grplcan 19130 grpasscan2 19132 grpinvinv 19135 grpraddf1o 19143 grpinvssd 19146 grpsubadd 19157 grplactcnv 19172 prdsinvlem 19178 imasgrp 19185 ghmgrp 19195 mulgdirlem 19234 issubg2 19271 isnsg3 19289 nmzsubg 19294 ssnmz 19295 eqger 19309 qusgrp 19320 conjghm 19382 galcan 19437 cntzsubg 19472 lsmmod 19808 lsmdisj2 19815 ogrpinv0le 20269 ogrpaddltrbid 20274 ogrpinv0lt 20276 ogrpinvlt 20277 ringnegr 20451 unitlinv 20540 isdrng2 20912 isdrng3lem1 20920 lmodvneg1 21095 evpmodpmf1o 21815 psrlinv 22176 grpvlinv 22626 tgpconncompeqg 24344 qustgpopn 24352 clmvslinv 25342 quslsm 33842 lflnegl 39957 dvhgrp 41988 |
| Copyright terms: Public domain | W3C validator |