| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grprinv | Structured version Visualization version GIF version | ||
| Description: The right 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 |
|---|---|
| grprinv | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpinv.b | . . 3 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | grpinv.p | . . 3 ⊢ + = (+g‘𝐺) | |
| 3 | 1, 2 | grpcl 19009 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
| 4 | grpinv.u | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 5 | 1, 4 | grpidcl 19033 | . 2 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 6 | 1, 2, 4 | grplid 19035 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥) |
| 7 | 1, 2 | grpass 19010 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 8 | 1, 2, 4 | grpinvex 19011 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 9 | simpr 489 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 10 | grpinv.n | . . 3 ⊢ 𝑁 = (invg‘𝐺) | |
| 11 | 1, 10 | grpinvcl 19055 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 12 | 1, 2, 4, 10 | grplinv 19057 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 ) |
| 13 | 3, 5, 6, 7, 8, 9, 11, 12 | grpinva 18733 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 +gcplusg 17311 0gc0g 17493 Grpcgrp 19001 invgcminusg 19002 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-riota 7369 df-ov 7415 df-0g 17495 df-mgm 18699 df-sgrp 18778 df-mnd 18794 df-grp 19004 df-minusg 19005 |
| This theorem is referenced by: grpinvid1 19059 grpinvid2 19060 grprinvd 19063 grplrinv 19064 grpasscan1 19069 grpinvinv 19073 grplmulf1o 19080 grpinvadd 19085 grpsubid 19091 dfgrp3 19106 mulgdirlem 19172 subginv 19200 nmzsubg 19232 eqger 19247 qusinv 19262 ghminv 19294 gacan 19376 cntzsubg 19410 oppggrp 19428 oppginv 19430 psgnuni 19570 sylow2blem3 19693 frgpuplem 19843 ogrpinv0le 20207 ogrpaddltbi 20210 ogrpinv0lt 20214 ogrpinvlt 20215 ringnegl 20386 unitrinv 20477 isdrng2 20830 orngsqr 20950 lmodvnegid 21006 lmodvsinv2 21139 lspsolvlem 21247 evpmodpmf1o 21727 grpvrinv 22537 mdetralt 22746 ghmcnp 24253 qustgpopn 24258 isngp4 24750 clmvsrinv 25247 archiabllem1b 33493 quslsm 33695 lbsdiflsp0 33997 fldhmf1 42838 ldepsprlem 49235 |
| Copyright terms: Public domain | W3C validator |