Theorem plusffval 18802

Description: The group addition operation as a function. (Contributed by Mario Carneiro, 14-Aug-2015.) (Proof shortened by AV, 2-Mar-2024.)

Hypotheses

Ref	Expression
plusffval.1	⊢ 𝐵 = (Base‘𝐺)
plusffval.2	⊢ + = (+g‘𝐺)
plusffval.3	⊢ ⨣ = (+𝑓‘𝐺)

Assertion

Ref	Expression
plusffval	⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))

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

Allowed substitution hints:   ⨣ (𝑥, 𝑦)

Proof of Theorem plusffval

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		plusffval.3	. 2 ⊢ ⨣ = (+𝑓‘𝐺)
2		fveq2 6877	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		plusffval.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4	2, 3	eqtr4di 2814	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5		fveq2 6877	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
6		plusffval.2	. . . . . . 7 ⊢ + = (+g‘𝐺)
7	5, 6	eqtr4di 2814	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
8	7	oveqd 7429	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦))
9	4, 4, 8	mpoeq123dv 7487	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
10		df-plusf 18795	. . . 4 ⊢ +𝑓 = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)))
11	3	fvexi 6891	. . . . 5 ⊢ 𝐵 ∈ V
12	6	fvexi 6891	. . . . . . 7 ⊢ + ∈ V
13	12	rnex 7911	. . . . . 6 ⊢ ran + ∈ V
14		p0ex 5346	. . . . . 6 ⊢ {∅} ∈ V
15	13, 14	unex 7750	. . . . 5 ⊢ (ran + ∪ {∅}) ∈ V
16		df-ov 7415	. . . . . . 7 ⊢ (𝑥 + 𝑦) = ( + ‘⟨𝑥, 𝑦⟩)
17		fvrn0 6905	. . . . . . 7 ⊢ ( + ‘⟨𝑥, 𝑦⟩) ∈ (ran + ∪ {∅})
18	16, 17	eqeltri 2857	. . . . . 6 ⊢ (𝑥 + 𝑦) ∈ (ran + ∪ {∅})
19	18	rgen2w 3082	. . . . 5 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) ∈ (ran + ∪ {∅})
20	11, 11, 15, 19	mpoexw 8080	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) ∈ V
21	9, 10, 20	fvmpt 6985	. . 3 ⊢ (𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
22		fvprc 6869	. . . 4 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = ∅)
23		fvprc 6869	. . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
24	3, 23	eqtrid 2808	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
25	24	olcd 888	. . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅))
26		0mpo0 7495	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅)
27	25, 26	syl 18	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅)
28	22, 27	eqtr4d 2799	. . 3 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
29	21, 28	pm2.61i 184	. 2 ⊢ (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))
30	1, 29	eqtri 2784	1 ⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897  ∅c0 4279  {csn 4584  ⟨cop 4590  ran crn 5652  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  Basecbs 17367  +_gcplusg 17408  +_𝑓cplusf 18793

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7990  df-2nd 7991  df-plusf 18795

This theorem is used by:  plusfval  18803  plusfeq  18804  plusffn  18805  mgmplusf  18806  rlmscaf  21462  istgp2  24390  oppgtmd  24396  submtmd  24403  prdstmdd  24423  ressplusf  33506  pl1cn  34569