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

Theorem elznn 9423
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 9409 . 2  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) ) )
2 3orrot 987 . . . . 5  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0
) )
3 3orass 984 . . . . 5  |-  ( ( N  e.  NN  \/  -u N  e.  NN  \/  N  =  0 )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
42, 3bitri 184 . . . 4  |-  ( ( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN )  <-> 
( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) )
5 elnn0 9332 . . . . . 6  |-  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  -u N  =  0 ) )
6 recn 8093 . . . . . . . 8  |-  ( N  e.  RR  ->  N  e.  CC )
76negeq0d 8410 . . . . . . 7  |-  ( N  e.  RR  ->  ( N  =  0  <->  -u N  =  0 ) )
87orbi2d 792 . . . . . 6  |-  ( N  e.  RR  ->  (
( -u N  e.  NN  \/  N  =  0
)  <->  ( -u N  e.  NN  \/  -u N  =  0 ) ) )
95, 8bitr4id 199 . . . . 5  |-  ( N  e.  RR  ->  ( -u N  e.  NN0  <->  ( -u N  e.  NN  \/  N  =  0 ) ) )
109orbi2d 792 . . . 4  |-  ( N  e.  RR  ->  (
( N  e.  NN  \/  -u N  e.  NN0 ) 
<->  ( N  e.  NN  \/  ( -u N  e.  NN  \/  N  =  0 ) ) ) )
114, 10bitr4id 199 . . 3  |-  ( N  e.  RR  ->  (
( N  =  0  \/  N  e.  NN  \/  -u N  e.  NN ) 
<->  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
1211pm5.32i 454 . 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 184 1  |-  ( N  e.  ZZ  <->  ( N  e.  RR  /\  ( N  e.  NN  \/  -u N  e.  NN0 ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    \/ wo 710    \/ w3o 980    = wceq 1373    e. wcel 2178   RRcr 7959   0cc0 7960   -ucneg 8279   NNcn 9071   NN0cn0 9330   ZZcz 9407
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-setind 4603  ax-resscn 8052  ax-1cn 8053  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-distr 8064  ax-i2m1 8065  ax-0id 8068  ax-rnegex 8069  ax-cnre 8071
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-iota 5251  df-fun 5292  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-sub 8280  df-neg 8281  df-n0 9331  df-z 9408
This theorem is referenced by:  zzlesq  10890  znnen  12884  logbgcd1irraplemexp  15555
  Copyright terms: Public domain W3C validator