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

Theorem grpoinvfval 31129
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 7914 . . . . 5 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
42, 3eqeltrid 2864 . . . 4 (𝐺 ∈ GrpOp → 𝑋 ∈ V)
5 mptexg 7227 . . . 4 (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
64, 5syl 18 . . 3 (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
7 rneq 5917 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
87, 2eqtr4di 2813 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
9 oveq 7426 . . . . . . 7 (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥))
10 fveq2 6885 . . . . . . . 8 (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺))
11 grpinvfval.2 . . . . . . . 8 𝑈 = (GId‘𝐺)
1210, 11eqtr4di 2813 . . . . . . 7 (𝑔 = 𝐺 → (GId‘𝑔) = 𝑈)
139, 12eqeq12d 2776 . . . . . 6 (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = (GId‘𝑔) ↔ (𝑦𝐺𝑥) = 𝑈))
148, 13riotaeqbidv 7380 . . . . 5 (𝑔 = 𝐺 → (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)) = (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
158, 14mpteq12dv 5191 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
16 df-ginv 31102 . . . 4 inv = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))))
1715, 16fvmptg 6991 . . 3 ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
186, 17mpdan 700 . 2 (𝐺 ∈ GrpOp → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
191, 18eqtrid 2807 1 (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ↦ cmpt 5185  ran crn 5651  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  GrpOpcgr 31096  GIdcgi 31097  invcgn 31098
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-ginv 31102
This theorem is used by:  grpoinvval  31130  grpoinvf  31139
  Copyright terms: Public domain W3C validator