| 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 19171 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 6 | 5 | adantl 487 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 7 | 1, 2, 3 | grpinveu 19165 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) |
| 8 | riotacl2 7385 | . . . 4 ⊢ (∃!𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) | |
| 9 | 7, 8 | syl 18 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 10 | 6, 9 | eqeltrd 2861 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ {𝑦 ∈ 𝐵 ∣ (𝑦 + 𝑋) = 0 }) |
| 11 | oveq1 7419 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑋) → (𝑦 + 𝑋) = ((𝑁‘𝑋) + 𝑋)) | |
| 12 | 11 | eqeq1d 2763 | . . . 4 ⊢ (𝑦 = (𝑁‘𝑋) → ((𝑦 + 𝑋) = 0 ↔ ((𝑁‘𝑋) + 𝑋) = 0 )) |
| 13 | 12 | elrab 3645 | . . 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 3364 {crab 3413 ‘cfv 6531 ℩crio 7368 (class class class)co 7412 Basecbs 17367 +gcplusg 17408 0gc0g 17590 Grpcgrp 19124 invgcminusg 19125 |
| 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 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-fv 6539 df-riota 7369 df-ov 7415 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-minusg 19128 |
| This theorem is used by: grprinv 19181 grpinvid1 19182 grpinvid2 19183 isgrpinv 19184 grplinvd 19185 grplrinv 19187 grplcan 19191 grpasscan2 19193 grpinvinv 19196 grpraddf1o 19204 grpinvssd 19207 grpsubadd 19218 grplactcnv 19233 prdsinvlem 19239 imasgrp 19246 ghmgrp 19256 mulgdirlem 19295 issubg2 19332 isnsg3 19350 nmzsubg 19355 ssnmz 19356 eqger 19370 qusgrp 19381 conjghm 19443 galcan 19498 cntzsubg 19533 lsmmod 19869 lsmdisj2 19876 ogrpinv0le 20330 ogrpaddltrbid 20335 ogrpinv0lt 20337 ogrpinvlt 20338 ringnegr 20514 unitlinv 20603 isdrng2 20977 isdrng3lem1 20985 lmodvneg1 21160 evpmodpmf1o 21882 psrlinv 22243 grpvlinv 22693 tgpconncompeqg 24411 qustgpopn 24419 clmvslinv 25409 quslsm 33938 lflnegl 40101 dvhgrp 42132 |
| Copyright terms: Public domain | W3C validator |