| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grprinv | 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 13873 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
| 4 | grpinv.u | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 5 | 1, 4 | grpidcl 13894 | . 2 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 6 | 1, 2, 4 | grplid 13896 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥) |
| 7 | 1, 2 | grpass 13874 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 8 | 1, 2, 4 | grpinvex 13875 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 9 | simpr 110 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 10 | grpinv.n | . . 3 ⊢ 𝑁 = (invg‘𝐺) | |
| 11 | 1, 10 | grpinvcl 13913 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 12 | 1, 2, 4, 10 | grplinv 13915 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 ) |
| 13 | 3, 5, 6, 7, 8, 9, 11, 12 | grpinva 13766 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 ) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 Basecbs 13411 +gcplusg 13491 0gc0g 13670 Grpcgrp 13865 invgcminusg 13866 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-cnex 8277 ax-resscn 8278 ax-1re 8280 ax-addrcl 8283 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-riota 6041 df-ov 6091 df-inn 9315 df-2 9373 df-ndx 13414 df-slot 13415 df-base 13417 df-plusg 13504 df-0g 13672 df-mgm 13736 df-sgrp 13777 df-mnd 13790 df-grp 13868 df-minusg 13869 |
| This theorem is used by: grpinvid1 13917 grpinvid2 13918 grprinvd 13921 grplrinv 13922 grpasscan1 13928 grpinvinv 13932 grplmulf1o 13939 grpinvadd 13943 grpsubid 13949 dfgrp3m 13964 mulgdirlem 14016 subginv 14044 nmzsubg 14073 eqger 14087 qusinv 14099 ghminv 14113 cntzsubg 14172 ringnegl 14464 unitrinv 14544 lmodvnegid 14776 |
| Copyright terms: Public domain | W3C validator |