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

Theorem mpomulf 11213
Description: Multiplication is an operation on complex numbers. Version of ax-mulf 11198 using maps-to notation, proved from the axioms of set theory and ax-mulcl 11180. (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 2766 . . 3 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦))
2 ovex 7456 . . 3 (𝑥 · 𝑦) ∈ V
31, 2fnmpoi 8076 . 2 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) Fn (ℂ × ℂ)
4 simpll 779 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑥 ∈ ℂ)
5 simplr 781 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑦 ∈ ℂ)
6 mulcl 11202 . . . . . . 7 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ)
7 eleq1a 2861 . . . . . . 7 ((𝑥 · 𝑦) ∈ ℂ → (𝑧 = (𝑥 · 𝑦) → 𝑧 ∈ ℂ))
86, 7syl 18 . . . . . 6 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑧 = (𝑥 · 𝑦) → 𝑧 ∈ ℂ))
98imp 412 . . . . 5 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑧 ∈ ℂ)
104, 5, 93jca 1146 . . . 4 (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ))
1110ssoprab2i 7534 . . 3 {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦))} ⊆ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
12 df-mpo 7428 . . 3 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦))}
13 dfxp3 8067 . . 3 ((ℂ × ℂ) × ℂ) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)}
1411, 12, 133sstr4i 3991 . 2 (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) ⊆ ((ℂ × ℂ) × ℂ)
15 dff2 7101 . 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 2146  wss 3908   × cxp 5664   Fn wfn 6538  wf 6539  (class class class)co 7423  {coprab 7424  cmpo 7425  cc 11116   · cmul 11123
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409  ax-un 7745  ax-mulcl 11180
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996
This theorem is used by:  mpomulex  13032  cncrng  21580  mpomulcn  25063  mpodvdsmulf1o  27395  fsumdvdsmul  27396
  Copyright terms: Public domain W3C validator