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

Theorem mpomulf 11322
Description: Multiplication is an operation on complex numbers. Version of ax-mulf 11307 using maps-to notation, proved from the axioms of set theory and ax-mulcl 11289. (Contributed by GG, 16-Mar-2025.)
Assertion
Ref Expression
mpomulf (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)):(ℂ × ℂ)⟶ℂ
Distinct variable group:   𝑥,𝑦

Proof of Theorem mpomulf
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqid 2763 . . 3 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))
2 ovex 7476 . . 3 (𝑥 · 𝑦) ∈ V
31, 2fnmpoi 8106 . 2 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) Fn (ℂ × ℂ)
4 simpll 779 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑥 ∈ ℂ)
5 simplr 781 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑦 ∈ ℂ)
6 mulcl 11311 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ)
7 eleq1a 2859 . . . . . . 7 ((𝑥 · 𝑦) ∈ ℂ → (𝑧 = (𝑥 · 𝑦) → 𝑧 ∈ ℂ))
86, 7syl 18 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑧 = (𝑥 · 𝑦) → 𝑧 ∈ ℂ))
98imp 412 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑧 ∈ ℂ)
104, 5, 93jca 1146 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ))
1110ssoprab2i 7554 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦))} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
12 df-mpo 7448 . . 3 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦))}
13 dfxp3 8097 . . 3 ((ℂ × ℂ) × ℂ) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
1411, 12, 133sstr4i 3964 . 2 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) ⊆ ((ℂ × ℂ) × ℂ)
15 dff2 7123 . 2 ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)):(ℂ × ℂ)⟶ℂ ↔ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) Fn (ℂ × ℂ) ∧ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) ⊆ ((ℂ × ℂ) × ℂ)))
163, 14, 15mpbir2an 724 1 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)):(ℂ × ℂ)⟶ℂ
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   × cxp 5653   Fn wfn 6553  ⟶wf 6554  (class class class)co 7443  {coprab 7444   ∈ cmpo 7445  ℂcc 11225   · cmul 11232
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775  ax-mulcl 11289
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026
This theorem is used by:  mpomulex  13145  cncrng  21729  mpomulcn  25218  mpodvdsmulf1o  27551  fsumdvdsmul  27552
  Copyright terms: Public domain W3C validator