| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpoaddf | Structured version Visualization version GIF version | ||
| Description: Addition is an operation on complex numbers. Version of ax-addf 11107 using maps-to notation, proved from the axioms of set theory and ax-addcl 11088. (Contributed by GG, 31-Mar-2025.) |
| Ref | Expression |
|---|---|
| mpoaddf | ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2735 | . . 3 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) | |
| 2 | ovex 7391 | . . 3 ⊢ (𝑥 + 𝑦) ∈ V | |
| 3 | 1, 2 | fnmpoi 8014 | . 2 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) Fn (ℂ × ℂ) |
| 4 | simpll 767 | . . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑥 ∈ ℂ) | |
| 5 | simplr 769 | . . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑦 ∈ ℂ) | |
| 6 | addcl 11110 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 + 𝑦) ∈ ℂ) | |
| 7 | eleq1a 2830 | . . . . . . 7 ⊢ ((𝑥 + 𝑦) ∈ ℂ → (𝑧 = (𝑥 + 𝑦) → 𝑧 ∈ ℂ)) | |
| 8 | 6, 7 | syl 17 | . . . . . 6 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑧 = (𝑥 + 𝑦) → 𝑧 ∈ ℂ)) |
| 9 | 8 | imp 406 | . . . . 5 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → 𝑧 ∈ ℂ) |
| 10 | 4, 5, 9 | 3jca 1129 | . . . 4 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦)) → (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) |
| 11 | 10 | ssoprab2i 7469 | . . 3 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦))} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)} |
| 12 | df-mpo 7363 | . . 3 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ 𝑧 = (𝑥 + 𝑦))} | |
| 13 | dfxp3 8005 | . . 3 ⊢ ((ℂ × ℂ) × ℂ) = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)} | |
| 14 | 11, 12, 13 | 3sstr4i 3984 | . 2 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) ⊆ ((ℂ × ℂ) × ℂ) |
| 15 | dff2 7044 | . 2 ⊢ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ ↔ ((𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) Fn (ℂ × ℂ) ∧ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)) ⊆ ((ℂ × ℂ) × ℂ))) | |
| 16 | 3, 14, 15 | mpbir2an 712 | 1 ⊢ (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (𝑥 + 𝑦)):(ℂ × ℂ)⟶ℂ |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ⊆ wss 3900 × cxp 5621 Fn wfn 6486 ⟶wf 6487 (class class class)co 7358 {coprab 7359 ∈ cmpo 7360 ℂcc 11026 + caddc 11031 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pr 5376 ax-un 7680 ax-addcl 11088 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4285 df-if 4479 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-fv 6499 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 |
| This theorem is referenced by: mpoaddex 12903 |
| Copyright terms: Public domain | W3C validator |