| 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 19078 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 6 | 5 | adantl 487 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 7 | 1, 2, 3 | grpinveu 19072 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) |
| 8 | riotacl2 7396 | . . . 4 ⊢ (∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 10 | 6, 9 | eqeltrd 2866 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 11 | oveq1 7430 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑋) → (𝑦 + 𝑋) = ((𝑁‘𝑋) + 𝑋)) | |
| 12 | 11 | eqeq1d 2768 | . . . 4 ⊢ (𝑦 = (𝑁‘𝑋) → ((𝑦 + 𝑋) = 0 ↔ ((𝑁‘𝑋) + 𝑋) = 0 )) |
| 13 | 12 | elrab 3653 | . . 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 2146 ∃!wreu 3370 {crab 3419 ‘cfv 6543 ℩crio 7379 (class class class)co 7423 Basecbs 17294 +gcplusg 17335 0gc0g 17517 Grpcgrp 19031 invgcminusg 19032 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-fv 6551 df-riota 7380 df-ov 7426 df-0g 17519 df-mgm 18723 df-sgrp 18806 df-mnd 18822 df-grp 19034 df-minusg 19035 |
| This theorem is used by: grprinv 19088 grpinvid1 19089 grpinvid2 19090 isgrpinv 19091 grplinvd 19092 grplrinv 19094 grplcan 19098 grpasscan2 19100 grpinvinv 19103 grpraddf1o 19111 grpinvssd 19114 grpsubadd 19125 grplactcnv 19140 prdsinvlem 19146 imasgrp 19153 ghmgrp 19163 mulgdirlem 19202 issubg2 19239 isnsg3 19257 nmzsubg 19262 ssnmz 19263 eqger 19277 qusgrp 19288 conjghm 19350 galcan 19405 cntzsubg 19440 lsmmod 19776 lsmdisj2 19783 ogrpinv0le 20237 ogrpaddltrbid 20242 ogrpinv0lt 20244 ogrpinvlt 20245 ringnegr 20419 unitlinv 20508 isdrng2 20880 isdrng3lem1 20888 lmodvneg1 21063 evpmodpmf1o 21783 psrlinv 22142 grpvlinv 22592 tgpconncompeqg 24306 qustgpopn 24314 clmvslinv 25304 quslsm 33745 lflnegl 39891 dvhgrp 41922 |
| Copyright terms: Public domain | W3C validator |