| 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 2762 | . . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) | |
| 2 | grpinvinv.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpinvinv.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
| 4 | 2, 3 | grpinvcl 19029 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑁‘𝑥) ∈ 𝐵) |
| 5 | 2, 3 | grpinvcl 19029 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵) → (𝑁‘𝑦) ∈ 𝐵) |
| 6 | eqid 2762 | . . . . . . . . 9 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 7 | eqid 2762 | . . . . . . . . 9 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 8 | 2, 6, 7, 3 | grpinvid1 19033 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 9 | 8 | 3com23 1139 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 10 | 2, 6, 7, 3 | grpinvid2 19034 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑥) = 𝑦 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 11 | 9, 10 | bitr4d 284 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦)) |
| 12 | 11 | 3expb 1133 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦)) |
| 13 | eqcom 2769 | . . . . 5 ⊢ (𝑥 = (𝑁‘𝑦) ↔ (𝑁‘𝑦) = 𝑥) | |
| 14 | eqcom 2769 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑥) ↔ (𝑁‘𝑥) = 𝑦) | |
| 15 | 12, 13, 14 | 3bitr4g 316 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 = (𝑁‘𝑦) ↔ 𝑦 = (𝑁‘𝑥))) |
| 16 | 1, 4, 5, 15 | f1ocnv2d 7649 | . . 3 ⊢ (𝐺 ∈ Grp → ((𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)):𝐵–1-1-onto→𝐵 ∧ ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦)))) |
| 17 | 16 | simprd 499 | . 2 ⊢ (𝐺 ∈ Grp → ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦))) |
| 18 | 2, 3 | grpinvf 19028 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝑁:𝐵⟶𝐵) |
| 19 | 18 | feqmptd 6935 | . . 3 ⊢ (𝐺 ∈ Grp → 𝑁 = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥))) |
| 20 | 19 | cnveqd 5847 | . 2 ⊢ (𝐺 ∈ Grp → ◡𝑁 = ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥))) |
| 21 | 18 | feqmptd 6935 | . 2 ⊢ (𝐺 ∈ Grp → 𝑁 = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦))) |
| 22 | 17, 20, 21 | 3eqtr4d 2807 | 1 ⊢ (𝐺 ∈ Grp → ◡𝑁 = 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ↦ cmpt 5181 ◡ccnv 5646 –1-1-onto→wf1o 6520 ‘cfv 6521 (class class class)co 7396 Basecbs 17245 +gcplusg 17286 0gc0g 17468 Grpcgrp 18975 invgcminusg 18976 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-0g 17470 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-grp 18978 df-minusg 18979 |
| This theorem is referenced by: grpinvf1o 19051 grpinvhmeo 24146 |
| Copyright terms: Public domain | W3C validator |