ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  0ncn Unicode version

Theorem 0ncn 7000
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.)
Assertion
Ref Expression
0ncn  |-  -.  (/)  e.  CC

Proof of Theorem 0ncn
StepHypRef Expression
1 0nelxp 4390 . 2  |-  -.  (/)  e.  ( R.  X.  R. )
2 df-c 6987 . . 3  |-  CC  =  ( R.  X.  R. )
32eleq2i 2145 . 2  |-  ( (/)  e.  CC  <->  (/)  e.  ( R. 
X.  R. ) )
41, 3mtbir 628 1  |-  -.  (/)  e.  CC
Colors of variables: wff set class
Syntax hints:   -. wn 3    e. wcel 1433   (/)c0 3251    X. cxp 4361   R.cnr 6487   CCcc 6979
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-v 2603  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-opab 3840  df-xp 4369  df-c 6987
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator