![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > grpinvinv | Structured version Visualization version 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 17514 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
4 | eqid 2651 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
5 | eqid 2651 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
6 | 1, 4, 5, 2 | grprinv 17516 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
7 | 3, 6 | syldan 486 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
8 | 1, 4, 5, 2 | grplinv 17515 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)𝑋) = (0g‘𝐺)) |
9 | 7, 8 | eqtr4d 2688 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋)) |
10 | simpl 472 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐺 ∈ Grp) | |
11 | 1, 2 | grpinvcl 17514 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
12 | 3, 11 | syldan 486 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
13 | simpr 476 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
14 | 1, 4 | grplcan 17524 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘(𝑁‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
15 | 10, 12, 13, 3, 14 | syl13anc 1368 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
16 | 9, 15 | mpbid 222 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1523 ∈ wcel 2030 ‘cfv 5926 (class class class)co 6690 Basecbs 15904 +gcplusg 15988 0gc0g 16147 Grpcgrp 17469 invgcminusg 17470 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-id 5053 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-ov 6693 df-0g 16149 df-mgm 17289 df-sgrp 17331 df-mnd 17342 df-grp 17472 df-minusg 17473 |
This theorem is referenced by: grpinv11 17531 grpinvnz 17533 grpsubinv 17535 grpinvsub 17544 grpsubeq0 17548 grpnpcan 17554 mulgneg 17607 mulgnegneg 17608 mulginvinv 17613 mulgdir 17620 mulgass 17626 eqger 17691 frgpuptinv 18230 ablsub2inv 18262 mulgdi 18278 invghm 18285 ringm2neg 18644 unitinvinv 18721 unitnegcl 18727 irrednegb 18757 abvneg 18882 lspsnneg 19054 islindf4 20225 tgpconncomp 21963 archirngz 29871 archiabllem1b 29874 baerlem5amN 37322 baerlem5bmN 37323 baerlem5abmN 37324 |
Copyright terms: Public domain | W3C validator |