![]() |
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 12817 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
4 | grpinv.u | . . 3 ⊢ 0 = (0g‘𝐺) | |
5 | 1, 4 | grpidcl 12836 | . 2 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝐵) |
6 | 1, 2, 4 | grplid 12838 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥) |
7 | 1, 2 | grpass 12818 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐵)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
8 | 1, 2, 4 | grpinvex 12819 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) |
9 | simpr 110 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
10 | grpinv.n | . . 3 ⊢ 𝑁 = (invg‘𝐺) | |
11 | 1, 10 | grpinvcl 12853 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
12 | 1, 2, 4, 10 | grplinv 12854 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋) + 𝑋) = 0 ) |
13 | 3, 5, 6, 7, 8, 9, 11, 12 | grprinvd 12737 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑋 + (𝑁‘𝑋)) = 0 ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 ‘cfv 5215 (class class class)co 5872 Basecbs 12454 +gcplusg 12528 0gc0g 12693 Grpcgrp 12809 invgcminusg 12810 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4117 ax-sep 4120 ax-pow 4173 ax-pr 4208 ax-un 4432 ax-cnex 7899 ax-resscn 7900 ax-1re 7902 ax-addrcl 7905 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4003 df-opab 4064 df-mpt 4065 df-id 4292 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-rn 4636 df-res 4637 df-ima 4638 df-iota 5177 df-fun 5217 df-fn 5218 df-f 5219 df-f1 5220 df-fo 5221 df-f1o 5222 df-fv 5223 df-riota 5828 df-ov 5875 df-inn 8916 df-2 8974 df-ndx 12457 df-slot 12458 df-base 12460 df-plusg 12541 df-0g 12695 df-mgm 12707 df-sgrp 12740 df-mnd 12750 df-grp 12812 df-minusg 12813 |
This theorem is referenced by: grpinvid1 12856 grpinvid2 12857 grplrinv 12859 grpasscan1 12865 grpinvinv 12869 grplmulf1o 12876 grpinvadd 12880 grpsubid 12886 dfgrp3m 12901 mulgdirlem 12945 subginv 12972 nmzsubg 13001 eqger 13014 ringnegl 13159 unitrinv 13227 |
Copyright terms: Public domain | W3C validator |