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

Theorem elznn 9228
Description: Integer property expressed in terms of positive integers and nonnegative integers. (Contributed by NM, 12-Jul-2005.)
Assertion
Ref Expression
elznn  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )

Proof of Theorem elznn
StepHypRef Expression
1 elz 9214 . 2  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) ) )
2 3orrot 979 . . . . 5  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0
) )
3 3orass 976 . . . . 5  |-  ( ( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0 )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
42, 3bitri 183 . . . 4  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
5 elnn0 9137 . . . . . 6  |-  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  -u N  =  0 ) )
6 recn 7907 . . . . . . . 8  |-  ( N  e.  RR  ->  N  e.  CC )
76negeq0d 8222 . . . . . . 7  |-  ( N  e.  RR  ->  ( N  =  0  <->  -u N  =  0 ) )
87orbi2d 785 . . . . . 6  |-  ( N  e.  RR  ->  (
( -u N  e.  NN  \/  N  =  0
)  <->  ( -u N  e.  NN  \/  -u N  =  0 ) ) )
95, 8bitr4id 198 . . . . 5  |-  ( N  e.  RR  ->  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  N  =  0 ) ) )
109orbi2d 785 . . . 4  |-  ( N  e.  RR  ->  (
( N  e.  NN  \/  -u N  e.  NN0 ) 
<->  ( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) ) )
114, 10bitr4id 198 . . 3  |-  ( N  e.  RR  ->  (
( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) 
<->  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
1211pm5.32i 451 . 2  |-  ( ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) )  <->  ( N  e.  RR  /\  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
131, 12bitri 183 1  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104    \/ wo 703    \/ w3o 972    = wceq 1348    e. wcel 2141   RRcr 7773   0cc0 7774   -ucneg 8091   NNcn 8878   NN0cn0 9135   ZZcz 9212
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-setind 4521  ax-resscn 7866  ax-1cn 7867  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885
This theorem depends on definitions:  df-bi 116  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-sub 8092  df-neg 8093  df-n0 9136  df-z 9213
This theorem is referenced by:  znnen  12353  logbgcd1irraplemexp  13680
  Copyright terms: Public domain W3C validator