Theorem mpoaddf 11200

Description: Addition is an operation on complex numbers. Version of ax-addf 11185 using maps-to notation, proved from the axioms of set theory and ax-addcl 11166. (Contributed by GG, 31-Mar-2025.)

Assertion

Ref	Expression
mpoaddf	⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ

Distinct variable group:   𝑥,𝑦

Proof of Theorem mpoaddf

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2762	. . 3 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))
2		ovex 7445	. . 3 ⊢ (𝑥 + 𝑦) ∈ V
3	1, 2	fnmpoi 8065	. 2 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) Fn (ℂ × ℂ)
4		simpll 778	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑥 ∈ ℂ)
5		simplr 780	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑦 ∈ ℂ)
6		addcl 11188	. . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ)
7		eleq1a 2857	. . . . . . 7 ⊢ ((𝑥 + 𝑦) ∈ ℂ → (𝑧 = (𝑥 + 𝑦) → 𝑧 ∈ ℂ))
8	6, 7	syl 18	. . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑧 = (𝑥 + 𝑦) → 𝑧 ∈ ℂ))
9	8	imp 411	. . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑧 ∈ ℂ)
10	4, 5, 9	3jca 1145	. . . 4 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ))
11	10	ssoprab2i 7523	. . 3 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦))} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
12		df-mpo 7417	. . 3 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦))}
13		dfxp3 8056	. . 3 ⊢ ((ℂ × ℂ) × ℂ) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
14	11, 12, 13	3sstr4i 3987	. 2 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) ⊆ ((ℂ × ℂ) × ℂ)
15		dff2 7094	. 2 ⊢ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ ↔ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) Fn (ℂ × ℂ) ∧ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) ⊆ ((ℂ × ℂ) × ℂ)))
16	3, 14, 15	mpbir2an 723	1 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142   ⊆ wss 3904   × cxp 5658   Fn wfn 6531  ⟶wf 6532  (class class class)co 7412  {coprab 7413   ∈ cmpo 7414  ℂcc 11104   + caddc 11109

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734  ax-addcl 11166

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  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 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985

This theorem is used by:  mpoaddex  13018