Theorem grpsubfvalALT 18865

Description: Shorter proof of grpsubfval 18864 using ax-rep 5284. (Contributed by NM, 31-Mar-2014.) (Revised by Stefan O'Rear, 27-Mar-2015.) (Proof shortened by AV, 19-Feb-2024.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
grpsubval.b	⊢ 𝐵 = (Base‘𝐺)
grpsubval.p	⊢ + = (+g‘𝐺)
grpsubval.i	⊢ 𝐼 = (invg‘𝐺)
grpsubval.m	⊢ − = (-g‘𝐺)

Assertion

Ref	Expression
grpsubfvalALT	⊢ − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))

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

Allowed substitution hints:   − (𝑥,𝑦)

Proof of Theorem grpsubfvalALT

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpsubval.m	. . 3 ⊢ − = (-g‘𝐺)
2		fveq2 6888	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		grpsubval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4	2, 3	eqtr4di 2790	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5		fveq2 6888	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
6		grpsubval.p	. . . . . . 7 ⊢ + = (+g‘𝐺)
7	5, 6	eqtr4di 2790	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
8		eqidd 2733	. . . . . 6 ⊢ (𝑔 = 𝐺 → 𝑥 = 𝑥)
9		fveq2 6888	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = (invg‘𝐺))
10		grpsubval.i	. . . . . . . 8 ⊢ 𝐼 = (invg‘𝐺)
11	9, 10	eqtr4di 2790	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = 𝐼)
12	11	fveq1d 6890	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((invg‘𝑔)‘𝑦) = (𝐼‘𝑦))
13	7, 8, 12	oveq123d 7426	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦)) = (𝑥 + (𝐼‘𝑦)))
14	4, 4, 13	mpoeq123dv 7480	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
15		df-sbg 18820	. . . 4 ⊢ -g = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))))
16	3	fvexi 6902	. . . . 5 ⊢ 𝐵 ∈ V
17	16, 16	mpoex 8062	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) ∈ V
18	14, 15, 17	fvmpt 6995	. . 3 ⊢ (𝐺 ∈ V → (-g‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
19	1, 18	eqtrid 2784	. 2 ⊢ (𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
20		fvprc 6880	. . . 4 ⊢ (¬ 𝐺 ∈ V → (-g‘𝐺) = ∅)
21	1, 20	eqtrid 2784	. . 3 ⊢ (¬ 𝐺 ∈ V → − = ∅)
22		fvprc 6880	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
23	3, 22	eqtrid 2784	. . . . 5 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
24	23	olcd 872	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅))
25		0mpo0 7488	. . . 4 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) = ∅)
26	24, 25	syl 17	. . 3 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) = ∅)
27	21, 26	eqtr4d 2775	. 2 ⊢ (¬ 𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
28	19, 27	pm2.61i 182	1 ⊢ − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))

Syntax hints:  ¬ wn 3   ∨ wo 845   = wceq 1541   ∈ wcel 2106  Vcvv 3474  ∅c0 4321  ‘cfv 6540  (class class class)co 7405   ∈ cmpo 7407  Basecbs 17140  +_gcplusg 17193  inv_gcminusg 18816  -_gcsg 18817

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7971  df-2nd 7972  df-sbg 18820

This theorem is referenced by: (None)