ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elnnz Unicode version
Theorem elnnz 9197
Description: Positive integer property expressed in terms of integers. (Contributed by NM, 8-Jan-2002.)
Assertion
Ref Expression
elnnz |- ( N e. NN <-> ( N e. ZZ /\ 0 < N ) )
Proof of Theorem elnnz
StepHypRef Expression
1 nnre 8860 . . . 4 |- ( N e. NN -> N e. RR )
2 orc 702 . . . 4 |- ( N e. NN -> ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) )
3 nngt0 8878 . . . 4 |- ( N e. NN -> 0 < N )
41, 2, 3jca31 307 . . 3 |- ( N e. NN -> ( ( N e. RR /\ ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) ) /\ 0 < N ) )
5 idd 21 . . . . . . 7 |- ( ( N e. RR /\ 0 < N ) -> ( N e. NN -> N e. NN ) )
6 lt0neg2 8363 . . . . . . . . . . . 12 |- ( N e. RR -> ( 0 < N <-> -u N < 0 ) )
7 renegcl 8155 . . . . . . . . . . . . 13 |- ( N e. RR -> -u N e. RR )
8 0re 7895 . . . . . . . . . . . . 13 |- 0 e. RR
9 ltnsym 7980 . . . . . . . . . . . . 13 |- ( ( -u N e. RR /\ 0 e. RR ) -> ( -u N < 0 -> -. 0 < -u N ) )
107, 8, 9sylancl 410 . . . . . . . . . . . 12 |- ( N e. RR -> ( -u N < 0 -> -. 0 < -u N ) )
116, 10sylbid 149 . . . . . . . . . . 11 |- ( N e. RR -> ( 0 < N -> -. 0 < -u N ) )
1211imp 123 . . . . . . . . . 10 |- ( ( N e. RR /\ 0 < N ) -> -. 0 < -u N )
13 nngt0 8878 . . . . . . . . . 10 |- ( -u N e. NN -> 0 < -u N )
1412, 13nsyl 618 . . . . . . . . 9 |- ( ( N e. RR /\ 0 < N ) -> -. -u N e. NN )
15 gt0ne0 8321 . . . . . . . . . 10 |- ( ( N e. RR /\ 0 < N ) -> N =/= 0 )
1615neneqd 2356 . . . . . . . . 9 |- ( ( N e. RR /\ 0 < N ) -> -. N = 0 )
17 ioran 742 . . . . . . . . 9 |- ( -. ( -u N e. NN \/ N = 0 ) <-> ( -. -u N e. NN /\ -. N = 0 ) )
1814, 16, 17sylanbrc 414 . . . . . . . 8 |- ( ( N e. RR /\ 0 < N ) -> -. ( -u N e. NN \/ N = 0 ) )
1918pm2.21d 609 . . . . . . 7 |- ( ( N e. RR /\ 0 < N ) -> ( ( -u N e. NN \/ N = 0 ) -> N e. NN ) )
205, 19jaod 707 . . . . . 6 |- ( ( N e. RR /\ 0 < N ) -> ( ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) -> N e. NN ) )
2120ex 114 . . . . 5 |- ( N e. RR -> ( 0 < N -> ( ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) -> N e. NN ) ) )
2221com23 78 . . . 4 |- ( N e. RR -> ( ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) -> ( 0 < N -> N e. NN ) ) )
2322imp31 254 . . 3 |- ( ( ( N e. RR /\ ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) ) /\ 0 < N ) -> N e. NN )
244, 23impbii 125 . 2 |- ( N e. NN <-> ( ( N e. RR /\ ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) ) /\ 0 < N ) )
25 elz 9189 . . . 4 |- ( N e. ZZ <-> ( N e. RR /\ ( N = 0 \/ N e. NN \/ -u N e. NN ) ) )
26 3orrot 974 . . . . . 6 |- ( ( N = 0 \/ N e. NN \/ -u N e. NN ) <-> ( N e. NN \/ -u N e. NN \/ N = 0 ) )
27 3orass 971 . . . . . 6 |- ( ( N e. NN \/ -u N e. NN \/ N = 0 ) <-> ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) )
2826, 27bitri 183 . . . . 5 |- ( ( N = 0 \/ N e. NN \/ -u N e. NN ) <-> ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) )
2928anbi2i 453 . . . 4 |- ( ( N e. RR /\ ( N = 0 \/ N e. NN \/ -u N e. NN ) ) <-> ( N e. RR /\ ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) ) )
3025, 29bitri 183 . . 3 |- ( N e. ZZ <-> ( N e. RR /\ ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) ) )
3130anbi1i 454 . 2 |- ( ( N e. ZZ /\ 0 < N ) <-> ( ( N e. RR /\ ( N e. NN \/ ( -u N e. NN \/ N = 0 ) ) ) /\ 0 < N ) )
3224, 31bitr4i 186 1 |- ( N e. NN <-> ( N e. ZZ /\ 0 < N ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3   -> wi 4   /\ wa 103   <-> wb 104   \/ wo 698   \/ w3o 967   = wceq 1343   e. wcel 2136   class class class wbr 3981   RRcr 7748   0cc0 7749   < clt 7929   -ucneg 8066   NNcn 8853   ZZcz 9187
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4099  ax-pow 4152  ax-pr 4186  ax-un 4410  ax-setind 4513  ax-cnex 7840  ax-resscn 7841  ax-1cn 7842  ax-1re 7843  ax-icn 7844  ax-addcl 7845  ax-addrcl 7846  ax-mulcl 7847  ax-addcom 7849  ax-addass 7851  ax-distr 7853  ax-i2m1 7854  ax-0lt1 7855  ax-0id 7857  ax-rnegex 7858  ax-cnre 7860  ax-pre-ltirr 7861  ax-pre-ltwlin 7862  ax-pre-lttrn 7863  ax-pre-ltadd 7865
This theorem depends on definitions:  df-bi 116  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2296  df-ne 2336  df-nel 2431  df-ral 2448  df-rex 2449  df-reu 2450  df-rab 2452  df-v 2727  df-sbc 2951  df-dif 3117  df-un 3119  df-in 3121  df-ss 3128  df-pw 3560  df-sn 3581  df-pr 3582  df-op 3584  df-uni 3789  df-int 3824  df-br 3982  df-opab 4043  df-id 4270  df-xp 4609  df-rel 4610  df-cnv 4611  df-co 4612  df-dm 4613  df-iota 5152  df-fun 5189  df-fv 5195  df-riota 5797  df-ov 5844  df-oprab 5845  df-mpo 5846  df-pnf 7931  df-mnf 7932  df-xr 7933  df-ltxr 7934  df-le 7935  df-sub 8067  df-neg 8068  df-inn 8854  df-z 9188
This theorem is referenced by:  nnssz  9204  elnnz1  9210  znnsub  9238  nn0ge0div  9274  msqznn  9287  elpq  9582  elfz1b  10021  lbfzo0  10112  fzo1fzo0n0  10114  elfzo0z  10115  fzofzim  10119  elfzodifsumelfzo  10132  exp3val  10453  nnesq  10570  nnabscl  11038  cvgratnnlemabsle  11464  p1modz1  11730  nndivdvds  11732  zdvdsdc  11748  oddge22np1  11814  evennn2n  11816  nno  11839  nnoddm1d2  11843  divalglemex  11855  divalglemeuneg  11856  divalg  11857  ndvdsadd  11864  sqgcd  11958  qredeu  12025  prmind2  12048  sqrt2irrlem  12089  sqrt2irrap  12108  qgt0numnn  12127  oddprm  12187  pythagtriplem6  12198  pythagtriplem11  12202  pythagtriplem13  12204  pythagtriplem19  12210  pc2dvds  12257  pcadd  12267  2sqlem8  13559
  Copyright terms: Public domain W3C validator