| 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 2729 | . . . 4 ⊢ (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) | |
| 2 | grpinvinv.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 3 | grpinvinv.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
| 4 | 2, 3 | grpinvcl 18901 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑁‘𝑥) ∈ 𝐵) |
| 5 | 2, 3 | grpinvcl 18901 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵) → (𝑁‘𝑦) ∈ 𝐵) |
| 6 | eqid 2729 | . . . . . . . . 9 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 7 | eqid 2729 | . . . . . . . . 9 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 8 | 2, 6, 7, 3 | grpinvid1 18905 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 9 | 8 | 3com23 1126 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 10 | 2, 6, 7, 3 | grpinvid2 18906 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑥) = 𝑦 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺))) |
| 11 | 9, 10 | bitr4d 282 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦)) |
| 12 | 11 | 3expb 1120 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦)) |
| 13 | eqcom 2736 | . . . . 5 ⊢ (𝑥 = (𝑁‘𝑦) ↔ (𝑁‘𝑦) = 𝑥) | |
| 14 | eqcom 2736 | . . . . 5 ⊢ (𝑦 = (𝑁‘𝑥) ↔ (𝑁‘𝑥) = 𝑦) | |
| 15 | 12, 13, 14 | 3bitr4g 314 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 = (𝑁‘𝑦) ↔ 𝑦 = (𝑁‘𝑥))) |
| 16 | 1, 4, 5, 15 | f1ocnv2d 7622 | . . 3 ⊢ (𝐺 ∈ Grp → ((𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)):𝐵–1-1-onto→𝐵 ∧ ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦)))) |
| 17 | 16 | simprd 495 | . 2 ⊢ (𝐺 ∈ Grp → ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦))) |
| 18 | 2, 3 | grpinvf 18900 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝑁:𝐵⟶𝐵) |
| 19 | 18 | feqmptd 6911 | . . 3 ⊢ (𝐺 ∈ Grp → 𝑁 = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥))) |
| 20 | 19 | cnveqd 5829 | . 2 ⊢ (𝐺 ∈ Grp → ◡𝑁 = ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥))) |
| 21 | 18 | feqmptd 6911 | . 2 ⊢ (𝐺 ∈ Grp → 𝑁 = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦))) |
| 22 | 17, 20, 21 | 3eqtr4d 2774 | 1 ⊢ (𝐺 ∈ Grp → ◡𝑁 = 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ↦ cmpt 5183 ◡ccnv 5630 –1-1-onto→wf1o 6498 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 +gcplusg 17196 0gc0g 17378 Grpcgrp 18847 invgcminusg 18848 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-0g 17380 df-mgm 18549 df-sgrp 18628 df-mnd 18644 df-grp 18850 df-minusg 18851 |
| This theorem is referenced by: grpinvf1o 18923 grpinvhmeo 24006 |
| Copyright terms: Public domain | W3C validator |