![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > grpinvinv | GIF version |
Description: Double inverse law for groups. Lemma 2.2.1(c) of [Herstein] p. 55. (Contributed by NM, 31-Mar-2014.) |
Ref | Expression |
---|---|
grpinvinv.b | ⊢ 𝐵 = (Base‘𝐺) |
grpinvinv.n | ⊢ 𝑁 = (invg‘𝐺) |
Ref | Expression |
---|---|
grpinvinv | ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | grpinvinv.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
2 | grpinvinv.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
3 | 1, 2 | grpinvcl 13123 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
4 | eqid 2193 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
5 | eqid 2193 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
6 | 1, 4, 5, 2 | grprinv 13126 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
7 | 3, 6 | syldan 282 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
8 | 1, 4, 5, 2 | grplinv 13125 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)𝑋) = (0g‘𝐺)) |
9 | 7, 8 | eqtr4d 2229 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋)) |
10 | simpl 109 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐺 ∈ Grp) | |
11 | 1, 2 | grpinvcl 13123 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
12 | 3, 11 | syldan 282 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
13 | simpr 110 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
14 | 1, 4 | grplcan 13137 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘(𝑁‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
15 | 10, 12, 13, 3, 14 | syl13anc 1251 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
16 | 9, 15 | mpbid 147 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 ‘cfv 5255 (class class class)co 5919 Basecbs 12621 +gcplusg 12698 0gc0g 12870 Grpcgrp 13075 invgcminusg 13076 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-cnex 7965 ax-resscn 7966 ax-1re 7968 ax-addrcl 7971 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-inn 8985 df-2 9043 df-ndx 12624 df-slot 12625 df-base 12627 df-plusg 12711 df-0g 12872 df-mgm 12942 df-sgrp 12988 df-mnd 13001 df-grp 13078 df-minusg 13079 |
This theorem is referenced by: grpinv11 13144 grpinvnz 13146 grpsubinv 13148 grpinvsub 13157 grpsubeq0 13161 grpnpcan 13167 mulgneg 13213 mulgnegneg 13214 mulginvinv 13221 mulgdir 13227 mulgass 13232 eqger 13297 ablsub2inv 13384 invghm 13402 rngm2neg 13448 ringm2neg 13554 unitinvinv 13623 unitnegcl 13629 lspsnneg 13919 |
Copyright terms: Public domain | W3C validator |