| 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 13815 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
| 4 | grpinv.u | . . 3 ⊢ 0 = (0g‘𝐺) | |
| 5 | 1, 4 | grpidcl 13836 | . 2 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
| 6 | 1, 2, 4 | grplid 13838 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥) |
| 7 | 1, 2 | grpass 13816 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 8 | 1, 2, 4 | grpinvex 13817 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
| 9 | simpr 110 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 10 | grpinv.n | . . 3 ⊢ 𝑁 = (invg‘𝐺) | |
| 11 | 1, 10 | grpinvcl 13855 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 12 | 1, 2, 4, 10 | grplinv 13857 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 ) |
| 13 | 3, 5, 6, 7, 8, 9, 11, 12 | grpinva 13708 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 ) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5377 (class class class)co 6085 Basecbs 13354 +gcplusg 13433 0gc0g 13612 Grpcgrp 13807 invgcminusg 13808 |
| 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 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 |
| 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 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-inn 9306 df-2 9364 df-ndx 13357 df-slot 13358 df-base 13360 df-plusg 13446 df-0g 13614 df-mgm 13678 df-sgrp 13719 df-mnd 13732 df-grp 13810 df-minusg 13811 |
| This theorem is used by: grpinvid1 13859 grpinvid2 13860 grprinvd 13863 grplrinv 13864 grpasscan1 13870 grpinvinv 13874 grplmulf1o 13881 grpinvadd 13885 grpsubid 13891 dfgrp3m 13906 mulgdirlem 13958 subginv 13986 nmzsubg 14015 eqger 14029 qusinv 14041 ghminv 14055 ringnegl 14358 unitrinv 14436 lmodvnegid 14668 |
| Copyright terms: Public domain | W3C validator |