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

Theorem grpoinvfval 31157
Description: The inverse function of a group. (Contributed by NM, 26-Oct-2006.) (Revised by Mario Carneiro, 15-Dec-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
grpinvfval.1 𝑋 = ran 𝐺
grpinvfval.2 𝑈 = (GId‘𝐺)
grpinvfval.3 𝑁 = (inv‘𝐺)
Assertion
Ref Expression
grpoinvfval (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
Distinct variable groups:   𝑥,𝑦,𝐺   𝑥,𝑋,𝑦   𝑥,𝑈
Allowed substitution hints:   𝑈(𝑦)   𝑁(𝑥, 𝑦)

Proof of Theorem grpoinvfval
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 grpinvfval.3 . 2 𝑁 = (inv‘𝐺)
2 grpinvfval.1 . . . . 5 𝑋 = ran 𝐺
3 rnexg 7941 . . . . 5 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
42, 3eqeltrid 2868 . . . 4 (𝐺 ∈ GrpOp → 𝑋 ∈ V)
5 mptexg 7253 . . . 4 (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
64, 5syl 18 . . 3 (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
7 rneq 5926 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
87, 2eqtr4di 2816 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
9 oveq 7452 . . . . . . 7 (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥))
10 fveq2 6911 . . . . . . . 8 (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺))
11 grpinvfval.2 . . . . . . . 8 𝑈 = (GId‘𝐺)
1210, 11eqtr4di 2816 . . . . . . 7 (𝑔 = 𝐺 → (GId‘𝑔) = 𝑈)
139, 12eqeq12d 2779 . . . . . 6 (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = (GId‘𝑔) ↔ (𝑦𝐺𝑥) = 𝑈))
148, 13riotaeqbidv 7406 . . . . 5 (𝑔 = 𝐺 → (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)) = (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
158, 14mpteq12dv 5196 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
16 df-ginv 31130 . . . 4 inv = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))))
1715, 16fvmptg 7017 . . 3 ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
186, 17mpdan 700 . 2 (𝐺 ∈ GrpOp → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
191, 18eqtrid 2810 1 (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ↦ cmpt 5190  ran crn 5657  ‘cfv 6561  ℩crio 7402  (class class class)co 7446  GrpOpcgr 31124  GIdcgi 31125  invcgn 31126
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-rep 5236  ax-sep 5253  ax-nul 5264  ax-pr 5396  ax-un 7778
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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-ginv 31130
This theorem is used by:  grpoinvval  31158  grpoinvf  31167
  Copyright terms: Public domain W3C validator