| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpinvcnv | Structured version Visualization version GIF version | ||
| Description: The group inverse is its own inverse function. (Contributed by Mario Carneiro, 14-Aug-2015.) |
| Ref | Expression |
|---|---|
| grpinvinv.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpinvinv.n | ⊢ 𝑁 = (invg‘𝐺) |
| Ref | Expression |
|---|---|
| grpinvcnv | ⊢ (𝐺 ∈ Grp → ◡𝑁 = 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2737 | . . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) | |
| 2 | grpinvinv.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpinvinv.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
| 4 | 2, 3 | grpinvcl 18957 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑁‘𝑥) ∈ 𝐵) |
| 5 | 2, 3 | grpinvcl 18957 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵) → (𝑁‘𝑦) ∈ 𝐵) |
| 6 | eqid 2737 | . . . . . . . . 9 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 7 | eqid 2737 | . . . . . . . . 9 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 8 | 2, 6, 7, 3 | grpinvid1 18961 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 9 | 8 | 3com23 1127 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 10 | 2, 6, 7, 3 | grpinvid2 18962 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑥) = 𝑦 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 11 | 9, 10 | bitr4d 282 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦)) |
| 12 | 11 | 3expb 1121 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦)) |
| 13 | eqcom 2744 | . . . . 5 ⊢ (𝑥 = (𝑁‘𝑦) ↔ (𝑁‘𝑦) = 𝑥) | |
| 14 | eqcom 2744 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑥) ↔ (𝑁‘𝑥) = 𝑦) | |
| 15 | 12, 13, 14 | 3bitr4g 314 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 = (𝑁‘𝑦) ↔ 𝑦 = (𝑁‘𝑥))) |
| 16 | 1, 4, 5, 15 | f1ocnv2d 7614 | . . 3 ⊢ (𝐺 ∈ Grp → ((𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)):𝐵–1-1-onto→𝐵 ∧ ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦)))) |
| 17 | 16 | simprd 495 | . 2 ⊢ (𝐺 ∈ Grp → ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦))) |
| 18 | 2, 3 | grpinvf 18956 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝑁:𝐵⟶𝐵) |
| 19 | 18 | feqmptd 6903 | . . 3 ⊢ (𝐺 ∈ Grp → 𝑁 = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥))) |
| 20 | 19 | cnveqd 5825 | . 2 ⊢ (𝐺 ∈ Grp → ◡𝑁 = ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥))) |
| 21 | 18 | feqmptd 6903 | . 2 ⊢ (𝐺 ∈ Grp → 𝑁 = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦))) |
| 22 | 17, 20, 21 | 3eqtr4d 2782 | 1 ⊢ (𝐺 ∈ Grp → ◡𝑁 = 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5167 ◡ccnv 5624 –1-1-onto→wf1o 6492 ‘cfv 6493 (class class class)co 7361 Basecbs 17173 +gcplusg 17214 0gc0g 17396 Grpcgrp 18903 invgcminusg 18904 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-0g 17398 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-grp 18906 df-minusg 18907 |
| This theorem is referenced by: grpinvf1o 18979 grpinvhmeo 24064 |
| Copyright terms: Public domain | W3C validator |