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

Theorem xrpnfdc 10255
Description: An extended real is or is not plus infinity. (Contributed by Jim Kingdon, 13-Apr-2023.)
Assertion
Ref Expression
xrpnfdc  |-  ( A  e.  RR*  -> DECID  A  = +oo )

Proof of Theorem xrpnfdc
StepHypRef Expression
1 elxr 10189 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 renepnf 8374 . . . . . 6  |-  ( A  e.  RR  ->  A  =/= +oo )
32neneqd 2441 . . . . 5  |-  ( A  e.  RR  ->  -.  A  = +oo )
43olcd 746 . . . 4  |-  ( A  e.  RR  ->  ( A  = +oo  \/  -.  A  = +oo )
)
5 df-dc 847 . . . 4  |-  (DECID  A  = +oo  <->  ( A  = +oo  \/  -.  A  = +oo ) )
64, 5sylibr 134 . . 3  |-  ( A  e.  RR  -> DECID  A  = +oo )
7 orc 724 . . . 4  |-  ( A  = +oo  ->  ( A  = +oo  \/  -.  A  = +oo )
)
87, 5sylibr 134 . . 3  |-  ( A  = +oo  -> DECID  A  = +oo )
9 mnfnepnf 8382 . . . . . . 7  |- -oo  =/= +oo
109neii 2422 . . . . . 6  |-  -. -oo  = +oo
11 eqeq1 2245 . . . . . 6  |-  ( A  = -oo  ->  ( A  = +oo  <-> -oo  = +oo ) )
1210, 11mtbiri 686 . . . . 5  |-  ( A  = -oo  ->  -.  A  = +oo )
1312olcd 746 . . . 4  |-  ( A  = -oo  ->  ( A  = +oo  \/  -.  A  = +oo )
)
1413, 5sylibr 134 . . 3  |-  ( A  = -oo  -> DECID  A  = +oo )
156, 8, 143jaoi 1344 . 2  |-  ( ( A  e.  RR  \/  A  = +oo  \/  A  = -oo )  -> DECID  A  = +oo )
161, 15sylbi 121 1  |-  ( A  e.  RR*  -> DECID  A  = +oo )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    \/ wo 720  DECID wdc 846    \/ w3o 1008    = wceq 1402    e. wcel 2209   RRcr 8179   +oocpnf 8358   -oocmnf 8359   RR*cxr 8360
This proof depends on 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 4249  ax-pow 4311  ax-un 4578  ax-cnex 8271  ax-resscn 8272
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-rex 2534  df-rab 2537  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-uni 3936  df-pnf 8363  df-mnf 8364  df-xr 8365
This theorem is used by:  xaddf  10257  xaddval  10258  xaddpnf1  10259  xaddcom  10274  xnegdi  10281  xleadd1a  10286  xlesubadd  10296  xrmaxiflemcl  12030  xrmaxifle  12031  xrmaxiflemab  12032  xrmaxiflemlub  12033  xrmaxiflemcom  12034  xrmaxadd  12046  xblss2ps  15596  xblss2  15597
  Copyright terms: Public domain W3C validator