Theorem grpsubfvalg 13004

Description: Group subtraction (division) operation. (Contributed by NM, 31-Mar-2014.) (Revised by Stefan O'Rear, 27-Mar-2015.) (Proof shortened by AV, 19-Feb-2024.)

Hypotheses

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

Assertion

Ref	Expression
grpsubfvalg	⊢ (𝐺 ∈ 𝑉 → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))

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

Allowed substitution hints:   − (𝑥,𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem grpsubfvalg

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		grpsubval.m	. 2 ⊢ − = (-g‘𝐺)
2		df-sbg 12965	. . 3 ⊢ -g = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))))
3		fveq2 5534	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
4		grpsubval.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐺)
5	3, 4	eqtr4di 2240	. . . 4 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
6		fveq2 5534	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
7		grpsubval.p	. . . . . 6 ⊢ + = (+g‘𝐺)
8	6, 7	eqtr4di 2240	. . . . 5 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
9		eqidd 2190	. . . . 5 ⊢ (𝑔 = 𝐺 → 𝑥 = 𝑥)
10		fveq2 5534	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = (invg‘𝐺))
11		grpsubval.i	. . . . . . 7 ⊢ 𝐼 = (invg‘𝐺)
12	10, 11	eqtr4di 2240	. . . . . 6 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = 𝐼)
13	12	fveq1d 5536	. . . . 5 ⊢ (𝑔 = 𝐺 → ((invg‘𝑔)‘𝑦) = (𝐼‘𝑦))
14	8, 9, 13	oveq123d 5918	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦)) = (𝑥 + (𝐼‘𝑦)))
15	5, 5, 14	mpoeq123dv 5959	. . 3 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
16		elex 2763	. . 3 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
17		basfn 12573	. . . . . 6 ⊢ Base Fn V
18		funfvex 5551	. . . . . . 7 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
19	18	funfni 5335	. . . . . 6 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
20	17, 16, 19	sylancr 414	. . . . 5 ⊢ (𝐺 ∈ 𝑉 → (Base‘𝐺) ∈ V)
21	4, 20	eqeltrid 2276	. . . 4 ⊢ (𝐺 ∈ 𝑉 → 𝐵 ∈ V)
22		mpoexga 6238	. . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) ∈ V)
23	21, 21, 22	syl2anc 411	. . 3 ⊢ (𝐺 ∈ 𝑉 → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) ∈ V)
24	2, 15, 16, 23	fvmptd3 5630	. 2 ⊢ (𝐺 ∈ 𝑉 → (-g‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
25	1, 24	eqtrid 2234	1 ⊢ (𝐺 ∈ 𝑉 → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))

Syntax hints:   → wi 4   = wceq 1364   ∈ wcel 2160  Vcvv 2752   Fn wfn 5230  ‘cfv 5235  (class class class)co 5897   ∈ cmpo 5899  Basecbs 12515  +_gcplusg 12592  inv_gcminusg 12961  -_gcsg 12962

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-cnex 7933  ax-resscn 7934  ax-1re 7936  ax-addrcl 7939

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4311  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-ov 5900  df-oprab 5901  df-mpo 5902  df-1st 6166  df-2nd 6167  df-inn 8951  df-ndx 12518  df-slot 12519  df-base 12521  df-sbg 12965

This theorem is referenced by:  grpsubval  13005  grpsubf  13038  grpsubpropdg  13063  grpsubpropd2  13064