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

Theorem xnn0letri 10184
Description: Dichotomy for extended nonnegative integers. (Contributed by Jim Kingdon, 13-Oct-2024.)
Assertion
Ref Expression
xnn0letri  |-  ( ( A  e. NN0*  /\  B  e. NN0* )  ->  ( A  <_  B  \/  B  <_  A ) )

Proof of Theorem xnn0letri
StepHypRef Expression
1 simpr 110 . . . . 5  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  e.  NN0 )  ->  A  e.  NN0 )
21nn0zd 9745 . . . 4  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  e.  NN0 )  ->  A  e.  ZZ )
3 simplr 533 . . . . 5  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  e.  NN0 )  ->  B  e.  NN0 )
43nn0zd 9745 . . . 4  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  e.  NN0 )  ->  B  e.  ZZ )
5 zletric 9667 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  <_  B  \/  B  <_  A ) )
62, 4, 5syl2anc 415 . . 3  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  e.  NN0 )  -> 
( A  <_  B  \/  B  <_  A ) )
7 xnn0xr 9614 . . . . . . 7  |-  ( B  e. NN0*  ->  B  e.  RR* )
8 pnfge 10170 . . . . . . 7  |-  ( B  e.  RR*  ->  B  <_ +oo )
97, 8syl 14 . . . . . 6  |-  ( B  e. NN0*  ->  B  <_ +oo )
109ad3antlr 497 . . . . 5  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  = +oo )  ->  B  <_ +oo )
11 simpr 110 . . . . 5  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  = +oo )  ->  A  = +oo )
1210, 11breqtrrd 4153 . . . 4  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  = +oo )  ->  B  <_  A )
1312olcd 746 . . 3  |-  ( ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  /\  A  = +oo )  ->  ( A  <_  B  \/  B  <_  A ) )
14 elxnn0 9611 . . . . 5  |-  ( A  e. NN0* 
<->  ( A  e.  NN0  \/  A  = +oo )
)
1514biimpi 120 . . . 4  |-  ( A  e. NN0*  ->  ( A  e. 
NN0  \/  A  = +oo ) )
1615ad2antrr 492 . . 3  |-  ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  ->  ( A  e.  NN0  \/  A  = +oo ) )
176, 13, 16mpjaodan 810 . 2  |-  ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  e.  NN0 )  ->  ( A  <_  B  \/  B  <_  A ) )
18 xnn0xr 9614 . . . . . 6  |-  ( A  e. NN0*  ->  A  e.  RR* )
1918ad2antrr 492 . . . . 5  |-  ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  = +oo )  ->  A  e.  RR* )
20 pnfge 10170 . . . . 5  |-  ( A  e.  RR*  ->  A  <_ +oo )
2119, 20syl 14 . . . 4  |-  ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  = +oo )  ->  A  <_ +oo )
22 simpr 110 . . . 4  |-  ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  = +oo )  ->  B  = +oo )
2321, 22breqtrrd 4153 . . 3  |-  ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  = +oo )  ->  A  <_  B )
2423orcd 745 . 2  |-  ( ( ( A  e. NN0*  /\  B  e. NN0* )  /\  B  = +oo )  ->  ( A  <_  B  \/  B  <_  A ) )
25 elxnn0 9611 . . . 4  |-  ( B  e. NN0* 
<->  ( B  e.  NN0  \/  B  = +oo )
)
2625biimpi 120 . . 3  |-  ( B  e. NN0*  ->  ( B  e. 
NN0  \/  B  = +oo ) )
2726adantl 277 . 2  |-  ( ( A  e. NN0*  /\  B  e. NN0* )  ->  ( B  e.  NN0  \/  B  = +oo ) )
2817, 24, 27mpjaodan 810 1  |-  ( ( A  e. NN0*  /\  B  e. NN0* )  ->  ( A  <_  B  \/  B  <_  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 720    = wceq 1402    e. wcel 2209   class class class wbr 4125   +oocpnf 8347   RR*cxr 8349    <_ cle 8351   NN0cn0 9542  NN0*cxnn0 9609   ZZcz 9623
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-iota 5332  df-fun 5374  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-n0 9543  df-xnn0 9610  df-z 9624
This theorem is referenced by:  pcgcd  13086
  Copyright terms: Public domain W3C validator