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

Theorem elznn 8367
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 8353 . 2  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) ) )
2 recn 7106 . . . . . . . 8  |-  ( N  e.  RR  ->  N  e.  CC )
32negeq0d 7411 . . . . . . 7  |-  ( N  e.  RR  ->  ( N  =  0  <->  -u N  =  0 ) )
43orbi2d 736 . . . . . 6  |-  ( N  e.  RR  ->  (
( -u N  e.  NN  \/  N  =  0
)  <->  ( -u N  e.  NN  \/  -u N  =  0 ) ) )
5 elnn0 8290 . . . . . 6  |-  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  -u N  =  0 ) )
64, 5syl6rbbr 197 . . . . 5  |-  ( N  e.  RR  ->  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  N  =  0 ) ) )
76orbi2d 736 . . . 4  |-  ( N  e.  RR  ->  (
( N  e.  NN  \/  -u N  e.  NN0 ) 
<->  ( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) ) )
8 3orrot 925 . . . . 5  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0
) )
9 3orass 922 . . . . 5  |-  ( ( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0 )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
108, 9bitri 182 . . . 4  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
117, 10syl6rbbr 197 . . 3  |-  ( N  e.  RR  ->  (
( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) 
<->  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
1211pm5.32i 441 . 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 182 1  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 102    <-> wb 103    \/ wo 661    \/ w3o 918    = wceq 1284    e. wcel 1433   RRcr 6980   0cc0 6981   -ucneg 7280   NNcn 8039   NN0cn0 8288   ZZcz 8351
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  ax-setind 4280  ax-resscn 7068  ax-1cn 7069  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-addass 7078  ax-distr 7080  ax-i2m1 7081  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087
This theorem depends on definitions:  df-bi 115  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-iota 4887  df-fun 4924  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-sub 7281  df-neg 7282  df-n0 8289  df-z 8352
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator