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

Theorem nlt1pig 7453
Description: No positive integer is less than one. (Contributed by Jim Kingdon, 31-Aug-2019.)
Assertion
Ref Expression
nlt1pig  |-  ( A  e.  N.  ->  -.  A  <N  1o )

Proof of Theorem nlt1pig
StepHypRef Expression
1 elni 7420 . . 3  |-  ( A  e.  N.  <->  ( A  e.  om  /\  A  =/=  (/) ) )
21simprbi 275 . 2  |-  ( A  e.  N.  ->  A  =/=  (/) )
3 noel 3463 . . . . 5  |-  -.  A  e.  (/)
4 1pi 7427 . . . . . . . . 9  |-  1o  e.  N.
5 ltpiord 7431 . . . . . . . . 9  |-  ( ( A  e.  N.  /\  1o  e.  N. )  -> 
( A  <N  1o  <->  A  e.  1o ) )
64, 5mpan2 425 . . . . . . . 8  |-  ( A  e.  N.  ->  ( A  <N  1o  <->  A  e.  1o ) )
7 df-1o 6501 . . . . . . . . . 10  |-  1o  =  suc  (/)
87eleq2i 2271 . . . . . . . . 9  |-  ( A  e.  1o  <->  A  e.  suc  (/) )
9 elsucg 4450 . . . . . . . . 9  |-  ( A  e.  N.  ->  ( A  e.  suc  (/)  <->  ( A  e.  (/)  \/  A  =  (/) ) ) )
108, 9bitrid 192 . . . . . . . 8  |-  ( A  e.  N.  ->  ( A  e.  1o  <->  ( A  e.  (/)  \/  A  =  (/) ) ) )
116, 10bitrd 188 . . . . . . 7  |-  ( A  e.  N.  ->  ( A  <N  1o  <->  ( A  e.  (/)  \/  A  =  (/) ) ) )
1211biimpa 296 . . . . . 6  |-  ( ( A  e.  N.  /\  A  <N  1o )  -> 
( A  e.  (/)  \/  A  =  (/) ) )
1312ord 725 . . . . 5  |-  ( ( A  e.  N.  /\  A  <N  1o )  -> 
( -.  A  e.  (/)  ->  A  =  (/) ) )
143, 13mpi 15 . . . 4  |-  ( ( A  e.  N.  /\  A  <N  1o )  ->  A  =  (/) )
1514ex 115 . . 3  |-  ( A  e.  N.  ->  ( A  <N  1o  ->  A  =  (/) ) )
1615necon3ad 2417 . 2  |-  ( A  e.  N.  ->  ( A  =/=  (/)  ->  -.  A  <N  1o ) )
172, 16mpd 13 1  |-  ( A  e.  N.  ->  -.  A  <N  1o )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 709    = wceq 1372    e. wcel 2175    =/= wne 2375   (/)c0 3459   class class class wbr 4043   suc csuc 4411   omcom 4637   1oc1o 6494   N.cnpi 7384    <N clti 7387
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 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4479
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-v 2773  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-br 4044  df-opab 4105  df-eprel 4335  df-suc 4417  df-iom 4638  df-xp 4680  df-1o 6501  df-ni 7416  df-lti 7419
This theorem is referenced by:  caucvgsr  7914
  Copyright terms: Public domain W3C validator