Theorem plusffval 18827

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 6885	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		plusffval.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝐺)
4	2, 3	eqtr4di 2813	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
5		fveq2 6885	. . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺))
6		plusffval.2	. . . . . . 7 ⊢ + = (+g‘𝐺)
7	5, 6	eqtr4di 2813	. . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + )
8	7	oveqd 7437	. . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦))
9	4, 4, 8	mpoeq123dv 7495	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
10		df-plusf 18820	. . . 4 ⊢ +𝑓 = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)))
11	3	fvexi 6899	. . . . 5 ⊢ 𝐵 ∈ V
12	6	fvexi 6899	. . . . . . 7 ⊢ + ∈ V
13	12	rnex 7922	. . . . . 6 ⊢ ran + ∈ V
14		p0ex 5345	. . . . . 6 ⊢ {∅} ∈ V
15	13, 14	unex 7761	. . . . 5 ⊢ (ran + ∪ {∅}) ∈ V
16		df-ov 7423	. . . . . . 7 ⊢ (𝑥 + 𝑦) = ( + ‘⟨𝑥, 𝑦⟩)
17		fvrn0 6913	. . . . . . 7 ⊢ ( + ‘⟨𝑥, 𝑦⟩) ∈ (ran + ∪ {∅})
18	16, 17	eqeltri 2856	. . . . . 6 ⊢ (𝑥 + 𝑦) ∈ (ran + ∪ {∅})
19	18	rgen2w 3081	. . . . 5 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) ∈ (ran + ∪ {∅})
20	11, 11, 15, 19	mpoexw 8091	. . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) ∈ V
21	9, 10, 20	fvmpt 6993	. . 3 ⊢ (𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
22		fvprc 6877	. . . 4 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = ∅)
23		fvprc 6877	. . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
24	3, 23	eqtrid 2807	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅)
25	24	olcd 888	. . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅))
26		0mpo0 7503	. . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅)
27	25, 26	syl 18	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅)
28	22, 27	eqtr4d 2798	. . 3 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)))
29	21, 28	pm2.61i 184	. 2 ⊢ (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))
30	1, 29	eqtri 2783	1 ⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 861   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∪ cun 4149  ∅c0 4278  {csn 4584  ⟨cop 4834  ran crn 5651  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  Basecbs 17392  +_gcplusg 17433  +_𝑓cplusf 18818

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-plusf 18820

This theorem is used by:  plusfval  18828  plusfeq  18829  plusffn  18830  mgmplusf  18831  rlmscaf  21487  istgp2  24415  oppgtmd  24421  submtmd  24428  prdstmdd  24448  ressplusf  33570  pl1cn  34633