Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  0ncn Structured version   Unicode version

Theorem 0ncn 9013
 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. (Contributed by NM, 2-May-1996.) (New usage is discouraged.)
Assertion
Ref Expression
0ncn

Proof of Theorem 0ncn
StepHypRef Expression
1 0nelxp 4909 . 2
2 df-c 9001 . . 3
32eleq2i 2502 . 2
41, 3mtbir 292 1
 Colors of variables: wff set class Syntax hints:   wn 3   wcel 1726  c0 3630   cxp 4879  cnr 8747  cc 8993 This theorem is referenced by:  axaddf  9025  axmulf  9026 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4333  ax-nul 4341  ax-pr 4406 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-v 2960  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-op 3825  df-opab 4270  df-xp 4887  df-c 9001
 Copyright terms: Public domain W3C validator