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

Theorem 0ncn 11113
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 5695 . 2 ¬ ∅ ∈ (R × R)
2 df-c 11101 . . 3 ℂ = (R × R)
32eleq2i 2855 . 2 (∅ ∈ ℂ ↔ ∅ ∈ (R × R))
41, 3mtbir 326 1 ¬ ∅ ∈ ℂ
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wcel 2143  c0 4286   × cxp 5659  Rcnr 10845  cc 11093
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5174  df-xp 5667  df-c 11101
This theorem is referenced by:  axaddf  11125  axmulf  11126  bj-inftyexpitaudisj  37849  bj-inftyexpidisj  37854
  Copyright terms: Public domain W3C validator