Theorem grpoinvfval 30458

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.

Step	Hyp	Ref	Expression
1		grpinvfval.3	. 2 ⊢ 𝑁 = (inv‘𝐺)
2		grpinvfval.1	. . . . 5 ⊢ 𝑋 = ran 𝐺
3		rnexg 7881	. . . . 5 ⊢ (𝐺 ∈ GrpOp → ran 𝐺 ∈ V)
4	2, 3	eqeltrid 2833	. . . 4 ⊢ (𝐺 ∈ GrpOp → 𝑋 ∈ V)
5		mptexg 7198	. . . 4 ⊢ (𝑋 ∈ V → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
6	4, 5	syl 17	. . 3 ⊢ (𝐺 ∈ GrpOp → (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V)
7		rneq 5903	. . . . . 6 ⊢ (𝑔 = 𝐺 → ran 𝑔 = ran 𝐺)
8	7, 2	eqtr4di 2783	. . . . 5 ⊢ (𝑔 = 𝐺 → ran 𝑔 = 𝑋)
9		oveq 7396	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑦𝑔𝑥) = (𝑦𝐺𝑥))
10		fveq2 6861	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = (GId‘𝐺))
11		grpinvfval.2	. . . . . . . 8 ⊢ 𝑈 = (GId‘𝐺)
12	10, 11	eqtr4di 2783	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (GId‘𝑔) = 𝑈)
13	9, 12	eqeq12d 2746	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((𝑦𝑔𝑥) = (GId‘𝑔) ↔ (𝑦𝐺𝑥) = 𝑈))
14	8, 13	riotaeqbidv 7350	. . . . 5 ⊢ (𝑔 = 𝐺 → (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔)) = (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈))
15	8, 14	mpteq12dv 5197	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
16		df-ginv 30431	. . . 4 ⊢ inv = (𝑔 ∈ GrpOp ↦ (𝑥 ∈ ran 𝑔 ↦ (℩𝑦 ∈ ran 𝑔(𝑦𝑔𝑥) = (GId‘𝑔))))
17	15, 16	fvmptg 6969	. . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)) ∈ V) → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
18	6, 17	mpdan 687	. 2 ⊢ (𝐺 ∈ GrpOp → (inv‘𝐺) = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))
19	1, 18	eqtrid 2777	1 ⊢ (𝐺 ∈ GrpOp → 𝑁 = (𝑥 ∈ 𝑋 ↦ (℩𝑦 ∈ 𝑋 (𝑦𝐺𝑥) = 𝑈)))

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109  Vcvv 3450   ↦ cmpt 5191  ran crn 5642  ‘cfv 6514  ℩crio 7346  (class class class)co 7390  GrpOpcgr 30425  GIdcgi 30426  invcgn 30427

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 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714

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 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-ginv 30431

This theorem is referenced by:  grpoinvval  30459  grpoinvf  30468