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

Theorem grpoinvfval 31106
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 7903 . . . . 5 (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
42, 3eqeltrid 2865 . . . 4 (𝐺 ∈ GrpOp → 𝑋 ∈ V)
5 mptexg 7219 . . . 4 (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
64, 5syl 18 . . 3 (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
7 rneq 5918 . . . . . 6 (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
87, 2eqtr4di 2814 . . . . 5 (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
9 oveq 7418 . . . . . . 7 (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥))
10 fveq2 6877 . . . . . . . 8 (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺))
11 grpinvfval.2 . . . . . . . 8 𝑈 = (GId‘𝐺)
1210, 11eqtr4di 2814 . . . . . . 7 (𝑔 = 𝐺 → (GId‘𝑔) = 𝑈)
139, 12eqeq12d 2777 . . . . . 6 (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = (GId‘𝑔) ↔ (𝑦𝐺𝑥) = 𝑈))
148, 13riotaeqbidv 7372 . . . . 5 (𝑔 = 𝐺 → (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)) = (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
158, 14mpteq12dv 5192 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
16 df-ginv 31079 . . . 4 inv = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))))
1715, 16fvmptg 6983 . . 3 ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
186, 17mpdan 700 . 2 (𝐺 ∈ GrpOp → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
191, 18eqtrid 2808 1 (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ↦ cmpt 5186  ran crn 5652  ‘cfv 6531  ℩crio 7368  (class class class)co 7412  GrpOpcgr 31073  GIdcgi 31074  invcgn 31075
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-ginv 31079
This theorem is used by:  grpoinvval  31107  grpoinvf  31116
  Copyright terms: Public domain W3C validator