Theorem plusffval 18742

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 6882	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		plusffval.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4	2, 3	eqtr4di 2815	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5		fveq2 6882	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
6		plusffval.2	. . . . . . 7 ⊢ + = (+g‘𝐺)
7	5, 6	eqtr4di 2815	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
8	7	oveqd 7434	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦))
9	4, 4, 8	mpoeq123dv 7492	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
10		df-plusf 18735	. . . 4 ⊢ +𝑓 = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)))
11	3	fvexi 6896	. . . . 5 ⊢ 𝐵 ∈ V
12	6	fvexi 6896	. . . . . . 7 ⊢ + ∈ V
13	12	rnex 7911	. . . . . 6 ⊢ ran + ∈ V
14		p0ex 5353	. . . . . 6 ⊢ {∅} ∈ V
15	13, 14	unex 7750	. . . . 5 ⊢ (ran + ∪ {∅}) ∈ V
16		df-ov 7420	. . . . . . 7 ⊢ (𝑥 + 𝑦) = ( + ‘⟨𝑥, 𝑦⟩)
17		fvrn0 6910	. . . . . . 7 ⊢ ( + ‘⟨𝑥, 𝑦⟩) ∈ (ran + ∪ {∅})
18	16, 17	eqeltri 2858	. . . . . 6 ⊢ (𝑥 + 𝑦) ∈ (ran + ∪ {∅})
19	18	rgen2w 3083	. . . . 5 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) ∈ (ran + ∪ {∅})
20	11, 11, 15, 19	mpoexw 8081	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) ∈ V
21	9, 10, 20	fvmpt 6990	. . 3 ⊢ (𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
22		fvprc 6874	. . . 4 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = ∅)
23		fvprc 6874	. . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
24	3, 23	eqtrid 2809	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
25	24	olcd 888	. . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅))
26		0mpo0 7500	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅)
27	25, 26	syl 18	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅)
28	22, 27	eqtr4d 2800	. . 3 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
29	21, 28	pm2.61i 184	. 2 ⊢ (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))
30	1, 29	eqtri 2785	1 ⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1570   ∈ wcel 2145  Vcvv 3453   ∪ cun 3900  ∅c0 4282  {csn 4587  ⟨cop 4593  ran crn 5660  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419  Basecbs 17307  +_gcplusg 17348  +_𝑓cplusf 18733

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-plusf 18735

This theorem is used by:  plusfval  18743  plusfeq  18744  plusffn  18745  mgmplusf  18746  rlmscaf  21397  istgp2  24323  oppgtmd  24329  submtmd  24336  prdstmdd  24356  ressplusf  33411  pl1cn  34473