| 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 19053 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 4 | eqid 2769 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | eqid 2769 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 6 | 1, 4, 5, 2 | grprinv 19056 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
| 7 | 3, 6 | syldan 602 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
| 8 | 1, 4, 5, 2 | grplinv 19055 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)𝑋) = (0g‘𝐺)) |
| 9 | 7, 8 | eqtr4d 2807 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋)) |
| 10 | simpl 487 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐺 ∈ Grp) | |
| 11 | 1, 2 | grpinvcl 19053 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
| 12 | 3, 11 | syldan 602 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
| 13 | simpr 489 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 14 | 1, 4 | grplcan 19066 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘(𝑁‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
| 15 | 10, 12, 13, 3, 14 | syl13anc 1397 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
| 16 | 9, 15 | mpbid 235 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) = 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ‘cfv 6537 (class class class)co 7411 Basecbs 17268 +gcplusg 17309 0gc0g 17491 Grpcgrp 18999 invgcminusg 19000 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-riota 7368 df-ov 7414 df-0g 17493 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-grp 19002 df-minusg 19003 |
| This theorem is referenced by: grpinv11 19073 grpinvnz 19075 grpsubinv 19077 grpinvsub 19087 grpsubeq0 19091 grpnpcan 19097 mulgneg 19157 mulgnegneg 19158 mulginvinv 19165 mulgdir 19171 mulgass 19176 eqger 19245 frgpuptinv 19840 ablsub2inv 19877 mulgdi 19895 invghm 19902 rngm2neg 20246 unitinvinv 20472 unitnegcl 20478 irrednegb 20512 abvneg 20906 lspsnneg 21104 islindf4 21956 tgpconncomp 24238 grpinvinvd 33300 archirngz 33449 archiabllem1b 33452 ply1divalg3 36032 baerlem5amN 42379 baerlem5bmN 42380 baerlem5abmN 42381 fldhmf1 42746 nelsubginvcld 43159 |
| Copyright terms: Public domain | W3C validator |