| 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 13621 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘𝑋) ∈ 𝐵) |
| 4 | eqid 2229 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 5 | eqid 2229 | . . . . 5 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 6 | 1, 4, 5, 2 | grprinv 13624 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
| 7 | 3, 6 | syldan 282 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = (0g‘𝐺)) |
| 8 | 1, 4, 5, 2 | grplinv 13623 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)𝑋) = (0g‘𝐺)) |
| 9 | 7, 8 | eqtr4d 2265 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → ((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋)) |
| 10 | simpl 109 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝐺 ∈ Grp) | |
| 11 | 1, 2 | grpinvcl 13621 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑁‘𝑋) ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
| 12 | 3, 11 | syldan 282 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → (𝑁‘(𝑁‘𝑋)) ∈ 𝐵) |
| 13 | simpr 110 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 14 | 1, 4 | grplcan 13635 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ ((𝑁‘(𝑁‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑁‘𝑋) ∈ 𝐵)) → (((𝑁‘𝑋)(+g‘𝐺)(𝑁‘(𝑁‘𝑋))) = ((𝑁‘𝑋)(+g‘𝐺)𝑋) ↔ (𝑁‘(𝑁‘𝑋)) = 𝑋)) |
| 15 | 10, 12, 13, 3, 14 | syl13anc 1273 | . 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 1395 ∈ wcel 2200 ‘cfv 5324 (class class class)co 6013 Basecbs 13072 +gcplusg 13150 0gc0g 13329 Grpcgrp 13573 invgcminusg 13574 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-cnex 8113 ax-resscn 8114 ax-1re 8116 ax-addrcl 8119 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-inn 9134 df-2 9192 df-ndx 13075 df-slot 13076 df-base 13078 df-plusg 13163 df-0g 13331 df-mgm 13429 df-sgrp 13475 df-mnd 13490 df-grp 13576 df-minusg 13577 |
| This theorem is referenced by: grpinv11 13642 grpinvnz 13644 grpsubinv 13646 grpinvsub 13655 grpsubeq0 13659 grpnpcan 13665 mulgneg 13717 mulgnegneg 13718 mulginvinv 13725 mulgdir 13731 mulgass 13736 eqger 13801 ablsub2inv 13888 invghm 13906 rngm2neg 13952 ringm2neg 14058 unitinvinv 14128 unitnegcl 14134 lspsnneg 14424 |
| Copyright terms: Public domain | W3C validator |