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

Theorem nlt1pig 7604
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 7571 . . 3  |-  ( A  e.  N.  <->  ( A  e.  om  /\  A  =/=  (/) ) )
21simprbi 275 . 2  |-  ( A  e.  N.  ->  A  =/=  (/) )
3 noel 3500 . . . . 5  |-  -.  A  e.  (/)
4 1pi 7578 . . . . . . . . 9  |-  1o  e.  N.
5 ltpiord 7582 . . . . . . . . 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 6625 . . . . . . . . . 10  |-  1o  =  suc  (/)
87eleq2i 2298 . . . . . . . . 9  |-  ( A  e.  1o  <->  A  e.  suc  (/) )
9 elsucg 4507 . . . . . . . . 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 732 . . . . 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 2445 . 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 716    = wceq 1398    e. wcel 2202    =/= wne 2403   (/)c0 3496   class class class wbr 4093   suc csuc 4468   omcom 4694   1oc1o 6618   N.cnpi 7535    <N clti 7538
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-eprel 4392  df-suc 4474  df-iom 4695  df-xp 4737  df-1o 6625  df-ni 7567  df-lti 7570
This theorem is referenced by:  caucvgsr  8065
  Copyright terms: Public domain W3C validator