![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mpomulf | Structured version Visualization version GIF version |
Description: Multiplication is an operation on complex numbers. Version of ax-mulf 11264 using maps-to notation, proved from the axioms of set theory and ax-mulcl 11246. (Contributed by GG, 16-Mar-2025.) |
Ref | Expression |
---|---|
mpomulf | ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)):(ℂ × ℂ)⟶ℂ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2740 | . . 3 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) | |
2 | ovex 7481 | . . 3 ⊢ (𝑥 · 𝑦) ∈ V | |
3 | 1, 2 | fnmpoi 8111 | . 2 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) Fn (ℂ × ℂ) |
4 | simpll 766 | . . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑥 ∈ ℂ) | |
5 | simplr 768 | . . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑦 ∈ ℂ) | |
6 | mulcl 11268 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
7 | eleq1a 2839 | . . . . . . 7 ⊢ ((𝑥 · 𝑦) ∈ ℂ → (𝑧 = (𝑥 · 𝑦) → 𝑧 ∈ ℂ)) | |
8 | 6, 7 | syl 17 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑧 = (𝑥 · 𝑦) → 𝑧 ∈ ℂ)) |
9 | 8 | imp 406 | . . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → 𝑧 ∈ ℂ) |
10 | 4, 5, 9 | 3jca 1128 | . . . 4 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦)) → (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) |
11 | 10 | ssoprab2i 7561 | . . 3 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦))} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)} |
12 | df-mpo 7453 | . . 3 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 · 𝑦))} | |
13 | dfxp3 8102 | . . 3 ⊢ ((ℂ × ℂ) × ℂ) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)} | |
14 | 11, 12, 13 | 3sstr4i 4052 | . 2 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) ⊆ ((ℂ × ℂ) × ℂ) |
15 | dff2 7133 | . 2 ⊢ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)):(ℂ × ℂ)⟶ℂ ↔ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) Fn (ℂ × ℂ) ∧ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)) ⊆ ((ℂ × ℂ) × ℂ))) | |
16 | 3, 14, 15 | mpbir2an 710 | 1 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 · 𝑦)):(ℂ × ℂ)⟶ℂ |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ⊆ wss 3976 × cxp 5698 Fn wfn 6568 ⟶wf 6569 (class class class)co 7448 {coprab 7449 ∈ cmpo 7450 ℂcc 11182 · cmul 11189 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-un 7770 ax-mulcl 11246 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-1st 8030 df-2nd 8031 |
This theorem is referenced by: mpomulex 13055 cncrng 21424 mpomulcn 24910 mpodvdsmulf1o 27255 fsumdvdsmul 27256 |
Copyright terms: Public domain | W3C validator |