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

Theorem nltpnft 9880
Description: An extended real is not less than plus infinity iff they are equal. (Contributed by NM, 30-Jan-2006.)
Assertion
Ref Expression
nltpnft  |-  ( A  e.  RR*  ->  ( A  = +oo  <->  -.  A  < +oo ) )

Proof of Theorem nltpnft
StepHypRef Expression
1 elxr 9842 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 renepnf 8067 . . . . 5  |-  ( A  e.  RR  ->  A  =/= +oo )
32neneqd 2385 . . . 4  |-  ( A  e.  RR  ->  -.  A  = +oo )
4 ltpnf 9846 . . . . 5  |-  ( A  e.  RR  ->  A  < +oo )
5 notnot 630 . . . . 5  |-  ( A  < +oo  ->  -.  -.  A  < +oo )
64, 5syl 14 . . . 4  |-  ( A  e.  RR  ->  -.  -.  A  < +oo )
73, 62falsed 703 . . 3  |-  ( A  e.  RR  ->  ( A  = +oo  <->  -.  A  < +oo ) )
8 id 19 . . . 4  |-  ( A  = +oo  ->  A  = +oo )
9 pnfxr 8072 . . . . . 6  |- +oo  e.  RR*
10 xrltnr 9845 . . . . . 6  |-  ( +oo  e.  RR*  ->  -. +oo  < +oo )
119, 10ax-mp 5 . . . . 5  |-  -. +oo  < +oo
12 breq1 4032 . . . . 5  |-  ( A  = +oo  ->  ( A  < +oo  <-> +oo  < +oo )
)
1311, 12mtbiri 676 . . . 4  |-  ( A  = +oo  ->  -.  A  < +oo )
148, 132thd 175 . . 3  |-  ( A  = +oo  ->  ( A  = +oo  <->  -.  A  < +oo ) )
15 mnfnepnf 8075 . . . . . 6  |- -oo  =/= +oo
1615neii 2366 . . . . 5  |-  -. -oo  = +oo
17 eqeq1 2200 . . . . 5  |-  ( A  = -oo  ->  ( A  = +oo  <-> -oo  = +oo ) )
1816, 17mtbiri 676 . . . 4  |-  ( A  = -oo  ->  -.  A  = +oo )
19 mnfltpnf 9851 . . . . . . 7  |- -oo  < +oo
20 breq1 4032 . . . . . . 7  |-  ( A  = -oo  ->  ( A  < +oo  <-> -oo  < +oo )
)
2119, 20mpbiri 168 . . . . . 6  |-  ( A  = -oo  ->  A  < +oo )
2221necon3bi 2414 . . . . 5  |-  ( -.  A  < +oo  ->  A  =/= -oo )
2322necon2bi 2419 . . . 4  |-  ( A  = -oo  ->  -.  -.  A  < +oo )
2418, 232falsed 703 . . 3  |-  ( A  = -oo  ->  ( A  = +oo  <->  -.  A  < +oo ) )
257, 14, 243jaoi 1314 . 2  |-  ( ( A  e.  RR  \/  A  = +oo  \/  A  = -oo )  ->  ( A  = +oo  <->  -.  A  < +oo ) )
261, 25sylbi 121 1  |-  ( A  e.  RR*  ->  ( A  = +oo  <->  -.  A  < +oo ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105    \/ w3o 979    = wceq 1364    e. wcel 2164   class class class wbr 4029   RRcr 7871   +oocpnf 8051   -oocmnf 8052   RR*cxr 8053    < clt 8054
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-pre-ltirr 7984
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-xp 4665  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059
This theorem is referenced by:  npnflt  9881  xgepnf  9882  xrmaxiflemlub  11391
  Copyright terms: Public domain W3C validator