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

Theorem 0ncn 11047
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 5652 . 2 ¬ ∅ ∈ (R × R)
2 df-c 11035 . . 3 ℂ = (R × R)
32eleq2i 2831 . 2 (∅ ∈ ℂ ↔ ∅ ∈ (R × R))
41, 3mtbir 324 1 ¬ ∅ ∈ ℂ
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wcel 2119  c0 4261   × cxp 5616  Rcnr 10779  cc 11027
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 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-opab 5135  df-xp 5624  df-c 11035
This theorem is referenced by:  axaddf  11059  axmulf  11060  bj-inftyexpitaudisj  37565  bj-inftyexpidisj  37570
  Copyright terms: Public domain W3C validator