Theorem addex 9855

Description: The addition operation is a set. (Contributed by NM, 19-Oct-2004.) (Revised by Mario Carneiro, 17-Nov-2014.)

Assertion

Ref	Expression
addex	⊢ + ∈ V

Proof of Theorem addex

Step	Hyp	Ref	Expression
1		ax-addf 8129	. 2 ⊢ + :(ℂ × ℂ)⟶ℂ
2		cnex 8131	. . 3 ⊢ ℂ ∈ V
3	2, 2	xpex 4834	. 2 ⊢ (ℂ × ℂ) ∈ V
4		fex2 5494	. 2 ⊢ (( + :(ℂ × ℂ)⟶ℂ ∧ (ℂ × ℂ) ∈ V ∧ ℂ ∈ V) → + ∈ V)
5	1, 3, 2, 4	mp3an 1371	1 ⊢ + ∈ V

Syntax hints:   ∈ wcel 2200  Vcvv 2799   × cxp 4717  ⟶wf 5314  ℂcc 8005   + caddc 8010

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-cnex 8098  ax-addf 8129

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-rel 4726  df-cnv 4727  df-dm 4729  df-rn 4730  df-fun 5320  df-fn 5321  df-f 5322

This theorem is referenced by: (None)