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

Theorem elznn0nn 9658
Description: Integer property expressed in terms nonnegative integers and positive integers. (Contributed by NM, 10-May-2004.)
Assertion
Ref Expression
elznn0nn  |-  ( N  e.  ZZ  <->  ( N  e.  NN0  \/  ( N  e.  RR  /\  -u N  e.  NN ) ) )

Proof of Theorem elznn0nn
StepHypRef Expression
1 elz 9646 . 2  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) ) )
2 andi 830 . . 3  |-  ( ( N  e.  RR  /\  ( ( N  =  0  \/  N  e.  NN )  \/  -u N  e.  NN ) )  <->  ( ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN )
)  \/  ( N  e.  RR  /\  -u N  e.  NN ) ) )
3 df-3or 1010 . . . 4  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( ( N  =  0  \/  N  e.  NN )  \/  -u N  e.  NN ) )
43anbi2i 461 . . 3  |-  ( ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) )  <->  ( N  e.  RR  /\  ( ( N  =  0  \/  N  e.  NN )  \/  -u N  e.  NN ) ) )
5 nn0re 9572 . . . . . 6  |-  ( N  e.  NN0  ->  N  e.  RR )
65pm4.71ri 396 . . . . 5  |-  ( N  e.  NN0  <->  ( N  e.  RR  /\  N  e. 
NN0 ) )
7 elnn0 9565 . . . . . . 7  |-  ( N  e.  NN0  <->  ( N  e.  NN  \/  N  =  0 ) )
8 orcom 740 . . . . . . 7  |-  ( ( N  e.  NN  \/  N  =  0 )  <-> 
( N  =  0  \/  N  e.  NN ) )
97, 8bitri 184 . . . . . 6  |-  ( N  e.  NN0  <->  ( N  =  0  \/  N  e.  NN ) )
109anbi2i 461 . . . . 5  |-  ( ( N  e.  RR  /\  N  e.  NN0 )  <->  ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN ) ) )
116, 10bitri 184 . . . 4  |-  ( N  e.  NN0  <->  ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN ) ) )
1211orbi1i 775 . . 3  |-  ( ( N  e.  NN0  \/  ( N  e.  RR  /\  -u N  e.  NN ) )  <->  ( ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN )
)  \/  ( N  e.  RR  /\  -u N  e.  NN ) ) )
132, 4, 123bitr4i 212 . 2  |-  ( ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) )  <->  ( N  e.  NN0  \/  ( N  e.  RR  /\  -u N  e.  NN ) ) )
141, 13bitri 184 1  |-  ( N  e.  ZZ  <->  ( N  e.  NN0  \/  ( N  e.  RR  /\  -u N  e.  NN ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    <-> wb 105    \/ wo 720    \/ w3o 1008    = wceq 1402    e. wcel 2209   RRcr 8178   0cc0 8179   -ucneg 8498   NNcn 9304   NN0cn0 9563   ZZcz 9644
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-sep 4249  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-i2m1 8284  ax-rnegex 8288
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645
This theorem is used by:  peano2z  9680  zindd  9764  expcl2lemap  10988  mulexpzap  11016  expaddzap  11020  expmulzap  11022  absexpzap  11846  bitsfzo  12722  pcid  13103  mulgsubcl  13939  mulgneg  13943  ghmmulg  14059
  Copyright terms: Public domain W3C validator