| 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 11260 | . 2 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 2 | cnex 11262 | . . 3 ⊢ ℂ ∈ V | |
| 3 | 2, 2 | xpex 7756 | . 2 ⊢ (ℂ × ℂ) ∈ V |
| 4 | fex2 7937 | . 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 2145 Vcvv 3451 × cxp 5649 ⟶wf 6527 ℂcc 11179 + caddc 11184 |
| 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 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-addf 11260 |
| 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 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-xp 5657 df-rel 5658 df-cnv 5659 df-dm 5661 df-rn 5662 df-fun 6533 df-fn 6534 df-f 6535 |
| This theorem is used by: cnaddablx 20062 cnaddabl 20063 cnaddid 20064 cnaddinv 20065 zaddablx 20066 cnlmodlem2 25438 cnnvg 31262 cnnvs 31264 cncph 31403 cnaddcom 39997 nn0mnd 49220 |
| Copyright terms: Public domain | W3C validator |