HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem 0ncn 5316
Description: The empty set is not a complex number. Note: do not use this after the real number axioms are developed, since it is a construction-dependent property.
Assertion
Ref Expression
0ncn |- -. (/) e. CC

Proof of Theorem 0ncn
StepHypRef Expression
1 0nelxp 3297 . 2 |- -. (/) e. (R. X. R.)
2 df-c 5305 . . 3 |- CC = (R. X. R.)
32eleq2i 1585 . 2 |- ((/) e. CC <-> (/) e. (R. X. R.))
41, 3mtbir 199 1 |- -. (/) e. CC
Colors of variables: wff set class
Syntax hints:  -. wn 2   e. wcel 999  (/)c0 2331   X. cxp 3225  R.cnr 5058  CCcc 5297
This theorem is referenced by:  axaddopr 5330  axmulopr 5331
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1003  ax-gen 1004  ax-8 1005  ax-10 1007  ax-11 1008  ax-12 1009  ax-13 1010  ax-14 1011  ax-17 1012  ax-4 1014  ax-5o 1016  ax-6o 1019  ax-9o 1164  ax-10o 1182  ax-16 1252  ax-11o 1260  ax-ext 1504  ax-sep 2758  ax-pow 2798  ax-pr 2835
This theorem depends on definitions:  df-bi 154  df-or 231  df-an 232  df-ex 1022  df-sb 1214  df-eu 1424  df-mo 1425  df-clab 1510  df-cleq 1515  df-clel 1518  df-ne 1634  df-v 1859  df-dif 2100  df-un 2101  df-in 2102  df-ss 2104  df-nul 2332  df-pw 2454  df-sn 2464  df-pr 2465  df-op 2468  df-opab 2722  df-xp 3241  df-c 5305
Copyright terms: Public domain