| 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 19196 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 6 | 5 | adantl 487 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 7 | 1, 2, 3 | grpinveu 19190 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) |
| 8 | riotacl2 7393 | . . . 4 ⊢ (∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 10 | 6, 9 | eqeltrd 2860 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 11 | oveq1 7427 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑋) → (𝑦 + 𝑋) = ((𝑁‘𝑋) + 𝑋)) | |
| 12 | 11 | eqeq1d 2762 | . . . 4 ⊢ (𝑦 = (𝑁‘𝑋) → ((𝑦 + 𝑋) = 0 ↔ ((𝑁‘𝑋) + 𝑋) = 0 )) |
| 13 | 12 | elrab 3644 | . . 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 1569 ∈ wcel 2144 ∃!wreu 3363 {crab 3412 ‘cfv 6538 ℩crio 7376 (class class class)co 7420 Basecbs 17392 +gcplusg 17433 0gc0g 17615 Grpcgrp 19149 invgcminusg 19150 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-riota 7377 df-ov 7423 df-0g 17617 df-mgm 18821 df-sgrp 18913 df-mnd 18929 df-grp 19152 df-minusg 19153 |
| This theorem is used by: grprinv 19206 grpinvid1 19207 grpinvid2 19208 isgrpinv 19209 grplinvd 19210 grplrinv 19212 grplcan 19216 grpasscan2 19218 grpinvinv 19221 grpraddf1o 19229 grpinvssd 19232 grpsubadd 19243 grplactcnv 19258 prdsinvlem 19264 imasgrp 19271 ghmgrp 19281 mulgdirlem 19320 issubg2 19357 isnsg3 19375 nmzsubg 19380 ssnmz 19381 eqger 19395 qusgrp 19406 conjghm 19468 galcan 19523 cntzsubg 19558 lsmmod 19894 lsmdisj2 19901 ogrpinv0le 20355 ogrpaddltrbid 20360 ogrpinv0lt 20362 ogrpinvlt 20363 ringnegr 20539 unitlinv 20628 isdrng2 21002 isdrng3lem1 21010 lmodvneg1 21185 evpmodpmf1o 21907 psrlinv 22268 grpvlinv 22718 tgpconncompeqg 24436 qustgpopn 24444 clmvslinv 25434 quslsm 34002 lflnegl 40226 dvhgrp 42257 |
| Copyright terms: Public domain | W3C validator |