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

Theorem elznn 8261
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 8247 . 2  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) ) )
2 recn 7014 . . . . . . . 8  |-  ( N  e.  RR  ->  N  e.  CC )
32negeq0d 7314 . . . . . . 7  |-  ( N  e.  RR  ->  ( N  =  0  <->  -u N  =  0 ) )
43orbi2d 704 . . . . . 6  |-  ( N  e.  RR  ->  (
( -u N  e.  NN  \/  N  =  0
)  <->  ( -u N  e.  NN  \/  -u N  =  0 ) ) )
5 elnn0 8183 . . . . . 6  |-  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  -u N  =  0 ) )
64, 5syl6rbbr 188 . . . . 5  |-  ( N  e.  RR  ->  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  N  =  0 ) ) )
76orbi2d 704 . . . 4  |-  ( N  e.  RR  ->  (
( N  e.  NN  \/  -u N  e.  NN0 ) 
<->  ( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) ) )
8 3orrot 891 . . . . 5  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0
) )
9 3orass 888 . . . . 5  |-  ( ( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0 )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
108, 9bitri 173 . . . 4  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
117, 10syl6rbbr 188 . . 3  |-  ( N  e.  RR  ->  (
( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) 
<->  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
1211pm5.32i 427 . 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 173 1  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 97    <-> wb 98    \/ wo 629    \/ w3o 884    = wceq 1243    e. wcel 1393   RRcr 6888   0cc0 6889   -ucneg 7183   NNcn 7914   NN0cn0 8181   ZZcz 8245
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-setind 4262  ax-resscn 6976  ax-1cn 6977  ax-icn 6979  ax-addcl 6980  ax-addrcl 6981  ax-mulcl 6982  ax-addcom 6984  ax-addass 6986  ax-distr 6988  ax-i2m1 6989  ax-0id 6992  ax-rnegex 6993  ax-cnre 6995
This theorem depends on definitions:  df-bi 110  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-iota 4867  df-fun 4904  df-fv 4910  df-riota 5468  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-sub 7184  df-neg 7185  df-n0 8182  df-z 8246
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator