| 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 18917 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 4 | eqid 2736 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | eqid 2736 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 6 | 1, 4, 5, 2 | grprinv 18920 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
| 7 | 3, 6 | syldan 591 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
| 8 | 1, 4, 5, 2 | grplinv 18919 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)𝑋) = (0g‘𝐺)) |
| 9 | 7, 8 | eqtr4d 2774 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋)) |
| 10 | simpl 482 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐺 ∈ Grp) | |
| 11 | 1, 2 | grpinvcl 18917 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
| 12 | 3, 11 | syldan 591 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
| 13 | simpr 484 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 14 | 1, 4 | grplcan 18930 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘(𝑁‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
| 15 | 10, 12, 13, 3, 14 | syl13anc 1374 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
| 16 | 9, 15 | mpbid 232 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 0gc0g 17359 Grpcgrp 18863 invgcminusg 18864 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-riota 7315 df-ov 7361 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 |
| This theorem is referenced by: grpinv11 18937 grpinv11OLD 18938 grpinvnz 18940 grpsubinv 18942 grpinvsub 18952 grpsubeq0 18956 grpnpcan 18962 mulgneg 19022 mulgnegneg 19023 mulginvinv 19030 mulgdir 19036 mulgass 19041 eqger 19107 frgpuptinv 19700 ablsub2inv 19737 mulgdi 19755 invghm 19762 rngm2neg 20104 unitinvinv 20327 unitnegcl 20333 irrednegb 20367 abvneg 20759 lspsnneg 20957 islindf4 21793 tgpconncomp 24057 grpinvinvd 33122 archirngz 33271 archiabllem1b 33274 ply1divalg3 35836 baerlem5amN 41976 baerlem5bmN 41977 baerlem5abmN 41978 fldhmf1 42344 nelsubginvcld 42751 |
| Copyright terms: Public domain | W3C validator |