| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > addex | Structured version Visualization version GIF version | ||
| Description: The addition operation is a set. (Contributed by NM, 19-Oct-2004.) (Revised by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| addex | ⊢ + ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-addf 11309 | . 2 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 2 | cnex 11311 | . . 3 ⊢ ℂ ∈ V | |
| 3 | 2, 2 | xpex 7794 | . 2 ⊢ (ℂ × ℂ) ∈ V |
| 4 | fex2 7975 | . 2 ⊢ (( + :(ℂ × ℂ)⟶ℂ ∧ (ℂ × ℂ) ∈ V ∧ ℂ ∈ V) → + ∈ V) | |
| 5 | 1, 3, 2, 4 | mp3an 1491 | 1 ⊢ + ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2147 Vcvv 3454 × cxp 5654 ⟶wf 6557 ℂcc 11228 + caddc 11233 |
| 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-ext 2735 ax-sep 5253 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-addf 11309 |
| 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-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-xp 5662 df-rel 5663 df-cnv 5664 df-dm 5666 df-rn 5667 df-fun 6563 df-fn 6564 df-f 6565 |
| This theorem is used by: cnaddablx 20115 cnaddabl 20116 cnaddid 20117 cnaddinv 20118 zaddablx 20119 cnlmodlem2 25491 cnnvg 31313 cnnvs 31315 cncph 31454 cnaddcom 40232 nn0mnd 49491 |
| Copyright terms: Public domain | W3C validator |