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

Theorem 0ncn 11152
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 5693 . 2 ¬ ∅ ∈ (R × R)
2 df-c 11140 . . 3 ℂ = (R × R)
32eleq2i 2827 . 2 (∅ ∈ ℂ ↔ ∅ ∈ (R × R))
41, 3mtbir 323 1 ¬ ∅ ∈ ℂ
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wcel 2109  c0 4313   × cxp 5657  Rcnr 10884  cc 11132
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pr 5407
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2715  df-cleq 2728  df-clel 2810  df-ne 2934  df-v 3466  df-dif 3934  df-un 3936  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-opab 5187  df-xp 5665  df-c 11140
This theorem is referenced by:  axaddf  11164  axmulf  11165  bj-inftyexpitaudisj  37228  bj-inftyexpidisj  37233
  Copyright terms: Public domain W3C validator