Theorem grpsubfvalALT 18148

Description: Shorter proof of grpsubfval 18147 using ax-rep 5190. (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 6670	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		grpsubval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4	2, 3	syl6eqr 2874	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5		fveq2 6670	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
6		grpsubval.p	. . . . . . 7 ⊢ + = (+g‘𝐺)
7	5, 6	syl6eqr 2874	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
8		eqidd 2822	. . . . . 6 ⊢ (𝑔 = 𝐺 → 𝑥 = 𝑥)
9		fveq2 6670	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = (invg‘𝐺))
10		grpsubval.i	. . . . . . . 8 ⊢ 𝐼 = (invg‘𝐺)
11	9, 10	syl6eqr 2874	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (invg‘𝑔) = 𝐼)
12	11	fveq1d 6672	. . . . . 6 ⊢ (𝑔 = 𝐺 → ((invg‘𝑔)‘𝑦) = (𝐼‘𝑦))
13	7, 8, 12	oveq123d 7177	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦)) = (𝑥 + (𝐼‘𝑦)))
14	4, 4, 13	mpoeq123dv 7229	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
15		df-sbg 18108	. . . 4 ⊢ -g = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)((invg‘𝑔)‘𝑦))))
16	3	fvexi 6684	. . . . 5 ⊢ 𝐵 ∈ V
17	16, 16	mpoex 7777	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) ∈ V
18	14, 15, 17	fvmpt 6768	. . 3 ⊢ (𝐺 ∈ V → (-g‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
19	1, 18	syl5eq 2868	. 2 ⊢ (𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
20		fvprc 6663	. . . 4 ⊢ (¬ 𝐺 ∈ V → (-g‘𝐺) = ∅)
21	1, 20	syl5eq 2868	. . 3 ⊢ (¬ 𝐺 ∈ V → − = ∅)
22		fvprc 6663	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
23	3, 22	syl5eq 2868	. . . . 5 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
24	23	olcd 870	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅))
25		0mpo0 7237	. . . 4 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) = ∅)
26	24, 25	syl 17	. . 3 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))) = ∅)
27	21, 26	eqtr4d 2859	. 2 ⊢ (¬ 𝐺 ∈ V → − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦))))
28	19, 27	pm2.61i 184	1 ⊢ − = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + (𝐼‘𝑦)))

Syntax hints:  ¬ wn 3   ∨ wo 843   = wceq 1537   ∈ wcel 2114  Vcvv 3494  ∅c0 4291  ‘cfv 6355  (class class class)co 7156   ∈ cmpo 7158  Basecbs 16483  +_gcplusg 16565  inv_gcminusg 18104  -_gcsg 18105

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-1st 7689  df-2nd 7690  df-sbg 18108

This theorem is referenced by: (None)