| 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 11197 | . 2 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 2 | cnex 11199 | . . 3 ⊢ ℂ ∈ V | |
| 3 | 2, 2 | xpex 7761 | . 2 ⊢ (ℂ × ℂ) ∈ V |
| 4 | fex2 7942 | . 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 2146 Vcvv 3458 × cxp 5664 ⟶wf 6539 ℂcc 11116 + caddc 11121 |
| 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 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-addf 11197 |
| 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 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-xp 5672 df-rel 5673 df-cnv 5674 df-dm 5676 df-rn 5677 df-fun 6545 df-fn 6546 df-f 6547 |
| This theorem is used by: cnaddablx 19969 cnaddabl 19970 cnaddid 19971 cnaddinv 19972 zaddablx 19973 cnlmodlem2 25333 cnnvg 31067 cnnvs 31069 cncph 31208 cnaddcom 39787 nn0mnd 48985 |
| Copyright terms: Public domain | W3C validator |