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

Theorem 0ncn 10900
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 5624 . 2 ¬ ∅ ∈ (R × R)
2 df-c 10888 . . 3 ℂ = (R × R)
32eleq2i 2832 . 2 (∅ ∈ ℂ ↔ ∅ ∈ (R × R))
41, 3mtbir 323 1 ¬ ∅ ∈ ℂ
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wcel 2110  c0 4262   × cxp 5588  Rcnr 10632  cc 10880
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2015  ax-8 2112  ax-9 2120  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pr 5356
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-sb 2072  df-clab 2718  df-cleq 2732  df-clel 2818  df-ne 2946  df-v 3433  df-dif 3895  df-un 3897  df-nul 4263  df-if 4466  df-sn 4568  df-pr 4570  df-op 4574  df-opab 5142  df-xp 5596  df-c 10888
This theorem is referenced by:  axaddf  10912  axmulf  10913  bj-inftyexpitaudisj  35385  bj-inftyexpidisj  35390
  Copyright terms: Public domain W3C validator