| 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 19220 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 6 | 5 | adantl 487 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 7 | 1, 2, 3 | grpinveu 19214 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) |
| 8 | riotacl2 7416 | . . . 4 ⊢ (∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 10 | 6, 9 | eqeltrd 2864 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 11 | oveq1 7450 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑋) → (𝑦 + 𝑋) = ((𝑁‘𝑋) + 𝑋)) | |
| 12 | 11 | eqeq1d 2765 | . . . 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 2147 ∃!wreu 3367 {crab 3416 ‘cfv 6558 ℩crio 7399 (class class class)co 7443 Basecbs 17416 +gcplusg 17457 0gc0g 17639 Grpcgrp 19173 invgcminusg 19174 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-fv 6566 df-riota 7400 df-ov 7446 df-0g 17641 df-mgm 18845 df-sgrp 18937 df-mnd 18953 df-grp 19176 df-minusg 19177 |
| This theorem is used by: grprinv 19230 grpinvid1 19231 grpinvid2 19232 isgrpinv 19233 grplinvd 19234 grplrinv 19236 grplcan 19240 grpasscan2 19242 grpinvinv 19245 grpraddf1o 19253 grpinvssd 19256 grpsubadd 19267 grplactcnv 19282 prdsinvlem 19288 imasgrp 19295 ghmgrp 19305 mulgdirlem 19344 issubg2 19381 isnsg3 19399 nmzsubg 19404 ssnmz 19405 eqger 19419 qusgrp 19430 conjghm 19492 galcan 19548 cntzsubg 19583 lsmmod 19919 lsmdisj2 19926 ogrpinv0le 20380 ogrpaddltrbid 20385 ogrpinv0lt 20387 ogrpinvlt 20388 ringnegr 20564 unitlinv 20653 isdrng2 21027 isdrng3lem1 21035 lmodvneg1 21210 evpmodpmf1o 21932 psrlinv 22293 grpvlinv 22743 tgpconncompeqg 24461 qustgpopn 24469 clmvslinv 25459 quslsm 34026 lflnegl 40325 dvhgrp 42356 |
| Copyright terms: Public domain | W3C validator |