| 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 11282 | . 2 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 2 | cnex 11284 | . . 3 ⊢ ℂ ∈ V | |
| 3 | 2, 2 | xpex 7767 | . 2 ⊢ (ℂ × ℂ) ∈ V |
| 4 | fex2 7948 | . 2 ⊢ (( + :(ℂ × ℂ)⟶ℂ ∧ (ℂ × ℂ) ∈ V ∧ ℂ ∈ V) → + ∈ V) | |
| 5 | 1, 3, 2, 4 | mp3an 1490 | 1 ⊢ + ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2144 Vcvv 3450 × cxp 5648 ⟶wf 6534 ℂcc 11201 + caddc 11206 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-addf 11282 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-cnv 5658 df-dm 5660 df-rn 5661 df-fun 6540 df-fn 6541 df-f 6542 |
| This theorem is used by: cnaddablx 20087 cnaddabl 20088 cnaddid 20089 cnaddinv 20090 zaddablx 20091 cnlmodlem2 25463 cnnvg 31285 cnnvs 31287 cncph 31426 cnaddcom 40122 nn0mnd 49369 |
| Copyright terms: Public domain | W3C validator |