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

Theorem 0ncn 11117
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 5696 . 2 ¬ ∅ ∈ (R × R)
2 df-c 11105 . . 3 ℂ = (R × R)
32eleq2i 2861 . 2 (∅ ∈ ℂ ↔ ∅ ∈ (R × R))
41, 3mtbir 326 1 ¬ ∅ ∈ ℂ
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wcel 2149  c0 4294   × cxp 5660  Rcnr 10849  cc 11097
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-opab 5178  df-xp 5668  df-c 11105
This theorem is referenced by:  axaddf  11129  axmulf  11130  bj-inftyexpitaudisj  37736  bj-inftyexpidisj  37741
  Copyright terms: Public domain W3C validator