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

Theorem xnn0lenn0nn0 9867
Description: An extended nonnegative integer which is less than or equal to a nonnegative integer is a nonnegative integer. (Contributed by AV, 24-Nov-2021.)
Assertion
Ref Expression
xnn0lenn0nn0  |-  ( ( M  e. NN0*  /\  N  e.  NN0  /\  M  <_  N )  ->  M  e.  NN0 )

Proof of Theorem xnn0lenn0nn0
StepHypRef Expression
1 elxnn0 9243 . . 3  |-  ( M  e. NN0* 
<->  ( M  e.  NN0  \/  M  = +oo )
)
2 2a1 25 . . . 4  |-  ( M  e.  NN0  ->  ( N  e.  NN0  ->  ( M  <_  N  ->  M  e.  NN0 ) ) )
3 breq1 4008 . . . . . . 7  |-  ( M  = +oo  ->  ( M  <_  N  <-> +oo  <_  N
) )
43adantr 276 . . . . . 6  |-  ( ( M  = +oo  /\  N  e.  NN0 )  -> 
( M  <_  N  <-> +oo 
<_  N ) )
5 nn0re 9187 . . . . . . . . . 10  |-  ( N  e.  NN0  ->  N  e.  RR )
65rexrd 8009 . . . . . . . . 9  |-  ( N  e.  NN0  ->  N  e. 
RR* )
7 xgepnf 9818 . . . . . . . . 9  |-  ( N  e.  RR*  ->  ( +oo  <_  N  <->  N  = +oo ) )
86, 7syl 14 . . . . . . . 8  |-  ( N  e.  NN0  ->  ( +oo  <_  N  <->  N  = +oo ) )
9 pnfnre 8001 . . . . . . . . 9  |- +oo  e/  RR
10 eleq1 2240 . . . . . . . . . . 11  |-  ( N  = +oo  ->  ( N  e.  NN0  <-> +oo  e.  NN0 ) )
11 nn0re 9187 . . . . . . . . . . . 12  |-  ( +oo  e.  NN0  -> +oo  e.  RR )
12 elnelall 2454 . . . . . . . . . . . 12  |-  ( +oo  e.  RR  ->  ( +oo  e/  RR  ->  M  e.  NN0 ) )
1311, 12syl 14 . . . . . . . . . . 11  |-  ( +oo  e.  NN0  ->  ( +oo  e/  RR  ->  M  e.  NN0 ) )
1410, 13biimtrdi 163 . . . . . . . . . 10  |-  ( N  = +oo  ->  ( N  e.  NN0  ->  ( +oo  e/  RR  ->  M  e.  NN0 ) ) )
1514com13 80 . . . . . . . . 9  |-  ( +oo  e/  RR  ->  ( N  e.  NN0  ->  ( N  = +oo  ->  M  e.  NN0 ) ) )
169, 15ax-mp 5 . . . . . . . 8  |-  ( N  e.  NN0  ->  ( N  = +oo  ->  M  e.  NN0 ) )
178, 16sylbid 150 . . . . . . 7  |-  ( N  e.  NN0  ->  ( +oo  <_  N  ->  M  e.  NN0 ) )
1817adantl 277 . . . . . 6  |-  ( ( M  = +oo  /\  N  e.  NN0 )  -> 
( +oo  <_  N  ->  M  e.  NN0 ) )
194, 18sylbid 150 . . . . 5  |-  ( ( M  = +oo  /\  N  e.  NN0 )  -> 
( M  <_  N  ->  M  e.  NN0 )
)
2019ex 115 . . . 4  |-  ( M  = +oo  ->  ( N  e.  NN0  ->  ( M  <_  N  ->  M  e.  NN0 ) ) )
212, 20jaoi 716 . . 3  |-  ( ( M  e.  NN0  \/  M  = +oo )  ->  ( N  e.  NN0  ->  ( M  <_  N  ->  M  e.  NN0 )
) )
221, 21sylbi 121 . 2  |-  ( M  e. NN0*  ->  ( N  e. 
NN0  ->  ( M  <_  N  ->  M  e.  NN0 ) ) )
23223imp 1193 1  |-  ( ( M  e. NN0*  /\  N  e.  NN0  /\  M  <_  N )  ->  M  e.  NN0 )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708    /\ w3a 978    = wceq 1353    e. wcel 2148    e/ wnel 2442   class class class wbr 4005   RRcr 7812   +oocpnf 7991   RR*cxr 7993    <_ cle 7995   NN0cn0 9178  NN0*cxnn0 9241
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1re 7907  ax-addrcl 7910  ax-rnegex 7922  ax-pre-ltirr 7925
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-xp 4634  df-cnv 4636  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-inn 8922  df-n0 9179  df-xnn0 9242
This theorem is referenced by:  xnn0le2is012  9868
  Copyright terms: Public domain W3C validator