MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mpoaddf Structured version   Visualization version   GIF version

Theorem mpoaddf 11256
Description: Addition is an operation on complex numbers. Version of ax-addf 11241 using maps-to notation, proved from the axioms of set theory and ax-addcl 11222. (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.
StepHypRef Expression
1 eqid 2737 . . 3 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦))
2 ovex 7471 . . 3 (𝑥 + 𝑦) ∈ V
31, 2fnmpoi 8103 . 2 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) Fn (ℂ × ℂ)
4 simpll 767 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑥 ∈ ℂ)
5 simplr 769 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑦 ∈ ℂ)
6 addcl 11244 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ)
7 eleq1a 2836 . . . . . . 7 ((𝑥 + 𝑦) ∈ ℂ → (𝑧 = (𝑥 + 𝑦) → 𝑧 ∈ ℂ))
86, 7syl 17 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑧 = (𝑥 + 𝑦) → 𝑧 ∈ ℂ))
98imp 406 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑧 ∈ ℂ)
104, 5, 93jca 1129 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ))
1110ssoprab2i 7551 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦))} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
12 df-mpo 7443 . . 3 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦))}
13 dfxp3 8094 . . 3 ((ℂ × ℂ) × ℂ) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
1411, 12, 133sstr4i 4042 . 2 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) ⊆ ((ℂ × ℂ) × ℂ)
15 dff2 7126 . 2 ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ ↔ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) Fn (ℂ × ℂ) ∧ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) ⊆ ((ℂ × ℂ) × ℂ)))
163, 14, 15mpbir2an 711 1 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1539  wcel 2108  wss 3966   × cxp 5691   Fn wfn 6564  wf 6565  (class class class)co 7438  {coprab 7439  cmpo 7440  cc 11160   + caddc 11165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5305  ax-nul 5315  ax-pr 5441  ax-un 7761  ax-addcl 11222
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3483  df-sbc 3795  df-csb 3912  df-dif 3969  df-un 3971  df-in 3973  df-ss 3983  df-nul 4343  df-if 4535  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4916  df-iun 5001  df-br 5152  df-opab 5214  df-mpt 5235  df-id 5587  df-xp 5699  df-rel 5700  df-cnv 5701  df-co 5702  df-dm 5703  df-rn 5704  df-res 5705  df-ima 5706  df-iota 6522  df-fun 6571  df-fn 6572  df-f 6573  df-fv 6577  df-ov 7441  df-oprab 7442  df-mpo 7443  df-1st 8022  df-2nd 8023
This theorem is referenced by:  mpoaddex  13037
  Copyright terms: Public domain W3C validator