Theorem grpinvfvalALT 18967

Description: Shorter proof of grpinvfval 18966 using ax-rep 5259. (Contributed by NM, 24-Aug-2011.) (Revised by Mario Carneiro, 7-Aug-2013.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
grpinvval.b	⊢ 𝐵 = (Base‘𝐺)
grpinvval.p	⊢ + = (+g‘𝐺)
grpinvval.o	⊢ 0 = (0g‘𝐺)
grpinvval.n	⊢ 𝑁 = (invg‘𝐺)

Assertion

Ref	Expression
grpinvfvalALT	⊢ 𝑁 = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐺,𝑦   𝑥, 0   𝑥, +

Allowed substitution hints:   + (𝑦)   𝑁(𝑥,𝑦)   0 (𝑦)

Proof of Theorem grpinvfvalALT

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpinvval.n	. 2 ⊢ 𝑁 = (invg‘𝐺)
2		fveq2 6886	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		grpinvval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4	2, 3	eqtr4di 2787	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5		fveq2 6886	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
6		grpinvval.p	. . . . . . . . 9 ⊢ + = (+g‘𝐺)
7	5, 6	eqtr4di 2787	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
8	7	oveqd 7430	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (𝑦(+g‘𝑔)𝑥) = (𝑦 + 𝑥))
9		fveq2 6886	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺))
10		grpinvval.o	. . . . . . . 8 ⊢ 0 = (0g‘𝐺)
11	9, 10	eqtr4di 2787	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = 0 )
12	8, 11	eqeq12d 2750	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((𝑦(+g‘𝑔)𝑥) = (0g‘𝑔) ↔ (𝑦 + 𝑥) = 0 ))
13	4, 12	riotaeqbidv 7373	. . . . 5 ⊢ (𝑔 = 𝐺 → (℩𝑦 ∈ (Base‘𝑔)(𝑦(+g‘𝑔)𝑥) = (0g‘𝑔)) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))
14	4, 13	mpteq12dv 5213	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔) ↦ (℩𝑦 ∈ (Base‘𝑔)(𝑦(+g‘𝑔)𝑥) = (0g‘𝑔))) = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )))
15		df-minusg 18925	. . . 4 ⊢ invg = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔) ↦ (℩𝑦 ∈ (Base‘𝑔)(𝑦(+g‘𝑔)𝑥) = (0g‘𝑔))))
16	14, 15, 3	mptfvmpt 7230	. . 3 ⊢ (𝐺 ∈ V → (invg‘𝐺) = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )))
17		fvprc 6878	. . . . 5 ⊢ (¬ 𝐺 ∈ V → (invg‘𝐺) = ∅)
18		mpt0 6690	. . . . 5 ⊢ (𝑥 ∈ ∅ ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )) = ∅
19	17, 18	eqtr4di 2787	. . . 4 ⊢ (¬ 𝐺 ∈ V → (invg‘𝐺) = (𝑥 ∈ ∅ ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )))
20		fvprc 6878	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
21	3, 20	eqtrid 2781	. . . . 5 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
22	21	mpteq1d 5217	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )) = (𝑥 ∈ ∅ ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )))
23	19, 22	eqtr4d 2772	. . 3 ⊢ (¬ 𝐺 ∈ V → (invg‘𝐺) = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )))
24	16, 23	pm2.61i 182	. 2 ⊢ (invg‘𝐺) = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))
25	1, 24	eqtri 2757	1 ⊢ 𝑁 = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))

Syntax hints:  ¬ wn 3   = wceq 1539   ∈ wcel 2107  Vcvv 3463  ∅c0 4313   ↦ cmpt 5205  ‘cfv 6541  ℩crio 7369  (class class class)co 7413  Basecbs 17230  +_gcplusg 17274  0_gc0g 17456  inv_gcminusg 18922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5259  ax-sep 5276  ax-nul 5286  ax-pr 5412

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-iun 4973  df-br 5124  df-opab 5186  df-mpt 5206  df-id 5558  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-iota 6494  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7370  df-ov 7416  df-minusg 18925

This theorem is referenced by: (None)