Theorem grpsubfvalALT 19041

Description: Shorter proof of grpsubfval 19040 using ax-rep 5232. (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 6871	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		grpsubval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4	2, 3	eqtr4di 2818	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5		fveq2 6871	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
6		grpsubval.p	. . . . . . 7 ⊢ + = (+g‘𝐺)
7	5, 6	eqtr4di 2818	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
8		eqidd 2766	. . . . . 6 ⊢ (𝑔 = 𝐺 → 𝑥 = 𝑥)
9		fveq2 6871	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = (invg‘𝐺))
10		grpsubval.i	. . . . . . . 8 ⊢ 𝐼 = (invg‘𝐺)
11	9, 10	eqtr4di 2818	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = 𝐼)
12	11	fveq1d 6873	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((invg‘𝑔)‘𝑦) = (𝐼‘𝑦))
13	7, 8, 12	oveq123d 7421	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦)) = (𝑥 + (𝐼‘𝑦)))
14	4, 4, 13	mpoeq123dv 7475	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
15		df-sbg 18995	. . . 4 ⊢ -g = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))))
16	3	fvexi 6885	. . . . 5 ⊢ 𝐵 ∈ V
17	16, 16	mpoex 8064	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) ∈ V
18	14, 15, 17	fvmpt 6979	. . 3 ⊢ (𝐺 ∈ V → (-g‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
19	1, 18	eqtrid 2812	. 2 ⊢ (𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
20		fvprc 6863	. . . 4 ⊢ (¬ 𝐺 ∈ V → (-g‘𝐺) = ∅)
21	1, 20	eqtrid 2812	. . 3 ⊢ (¬ 𝐺 ∈ V → − = ∅)
22		fvprc 6863	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
23	3, 22	eqtrid 2812	. . . . 5 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
24	23	olcd 887	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅))
25		0mpo0 7483	. . . 4 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) = ∅)
26	24, 25	syl 18	. . 3 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) = ∅)
27	21, 26	eqtr4d 2803	. 2 ⊢ (¬ 𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
28	19, 27	pm2.61i 184	1 ⊢ − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))

Syntax hints:  ¬ wn 3   ∨ wo 860   = wceq 1563   ∈ wcel 2145  Vcvv 3457  ∅c0 4288  ‘cfv 6525  (class class class)co 7400   ∈ cmpo 7402  Basecbs 17259  +_gcplusg 17300  inv_gcminusg 18991  -_gcsg 18992

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-sbg 18995

This theorem is referenced by: (None)