MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  grpinvcnv Structured version   Visualization version   GIF version

Theorem grpinvcnv 19267
Description: The group inverse is its own inverse function. (Contributed by Mario Carneiro, 14-Aug-2015.)
Hypotheses
Ref Expression
grpinvinv.b 𝐵 = (Base‘𝐺)
grpinvinv.n 𝑁 = (invg‘𝐺)
Assertion
Ref Expression
grpinvcnv (𝐺 ∈ Grp → ◡𝑁 = 𝑁)

Proof of Theorem grpinvcnv
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . . 4 (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥))
2 grpinvinv.b . . . . 5 𝐵 = (Base‘𝐺)
3 grpinvinv.n . . . . 5 𝑁 = (invg‘𝐺)
42, 3grpinvcl 19248 . . . 4 ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → (𝑁‘𝑥) ∈ 𝐵)
52, 3grpinvcl 19248 . . . 4 ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵) → (𝑁‘𝑦) ∈ 𝐵)
6 eqid 2763 . . . . . . . . 9 (+g‘𝐺) = (+g‘𝐺)
7 eqid 2763 . . . . . . . . 9 (0g‘𝐺) = (0g‘𝐺)
82, 6, 7, 3grpinvid1 19252 . . . . . . . 8 ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺)))
983com23 1144 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺)))
102, 6, 7, 3grpinvid2 19253 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑥) = 𝑦 ↔ (𝑦(+g‘𝐺)𝑥) = (0g‘𝐺)))
119, 10bitr4d 285 . . . . . 6 ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦))
12113expb 1138 . . . . 5 ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑁‘𝑦) = 𝑥 ↔ (𝑁‘𝑥) = 𝑦))
13 eqcom 2770 . . . . 5 (𝑥 = (𝑁‘𝑦) ↔ (𝑁‘𝑦) = 𝑥)
14 eqcom 2770 . . . . 5 (𝑦 = (𝑁‘𝑥) ↔ (𝑁‘𝑥) = 𝑦)
1512, 13, 143bitr4g 317 . . . 4 ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 = (𝑁‘𝑦) ↔ 𝑦 = (𝑁‘𝑥)))
161, 4, 5, 15f1ocnv2d 7706 . . 3 (𝐺 ∈ Grp → ((𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)):𝐵⟶1-1onto𝐵 ∧ ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦))))
1716simprd 501 . 2 (𝐺 ∈ Grp → ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)) = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦)))
182, 3grpinvf 19247 . . . 4 (𝐺 ∈ Grp → 𝑁:𝐵⟶𝐵)
1918feqmptd 6984 . . 3 (𝐺 ∈ Grp → 𝑁 = (𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)))
2019cnveqd 5865 . 2 (𝐺 ∈ Grp → ◡𝑁 = ◡(𝑥 ∈ 𝐵 ↦ (𝑁‘𝑥)))
2118feqmptd 6984 . 2 (𝐺 ∈ Grp → 𝑁 = (𝑦 ∈ 𝐵 ↦ (𝑁‘𝑦)))
2217, 20, 213eqtr4d 2808 1 (𝐺 ∈ Grp → ◡𝑁 = 𝑁)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ↦ cmpt 5192  ◡ccnv 5657  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  +gcplusg 17472  0gc0g 17660  Grpcgrp 19194  invgcminusg 19195
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-minusg 19198
This theorem is used by:  grpinvf1o  19269  grpinvhmeo  24460
  Copyright terms: Public domain W3C validator