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

Theorem nltpnft 10093
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 10055 . 2  |-  ( A  e.  RR*  <->  ( A  e.  RR  \/  A  = +oo  \/  A  = -oo ) )
2 renepnf 8269 . . . . 5  |-  ( A  e.  RR  ->  A  =/= +oo )
32neneqd 2424 . . . 4  |-  ( A  e.  RR  ->  -.  A  = +oo )
4 ltpnf 10059 . . . . 5  |-  ( A  e.  RR  ->  A  < +oo )
5 notnot 634 . . . . 5  |-  ( A  < +oo  ->  -.  -.  A  < +oo )
64, 5syl 14 . . . 4  |-  ( A  e.  RR  ->  -.  -.  A  < +oo )
73, 62falsed 710 . . 3  |-  ( A  e.  RR  ->  ( A  = +oo  <->  -.  A  < +oo ) )
8 id 19 . . . 4  |-  ( A  = +oo  ->  A  = +oo )
9 pnfxr 8274 . . . . . 6  |- +oo  e.  RR*
10 xrltnr 10058 . . . . . 6  |-  ( +oo  e.  RR*  ->  -. +oo  < +oo )
119, 10ax-mp 5 . . . . 5  |-  -. +oo  < +oo
12 breq1 4096 . . . . 5  |-  ( A  = +oo  ->  ( A  < +oo  <-> +oo  < +oo )
)
1311, 12mtbiri 682 . . . 4  |-  ( A  = +oo  ->  -.  A  < +oo )
148, 132thd 175 . . 3  |-  ( A  = +oo  ->  ( A  = +oo  <->  -.  A  < +oo ) )
15 mnfnepnf 8277 . . . . . 6  |- -oo  =/= +oo
1615neii 2405 . . . . 5  |-  -. -oo  = +oo
17 eqeq1 2238 . . . . 5  |-  ( A  = -oo  ->  ( A  = +oo  <-> -oo  = +oo ) )
1816, 17mtbiri 682 . . . 4  |-  ( A  = -oo  ->  -.  A  = +oo )
19 mnfltpnf 10064 . . . . . . 7  |- -oo  < +oo
20 breq1 4096 . . . . . . 7  |-  ( A  = -oo  ->  ( A  < +oo  <-> -oo  < +oo )
)
2119, 20mpbiri 168 . . . . . 6  |-  ( A  = -oo  ->  A  < +oo )
2221necon3bi 2453 . . . . 5  |-  ( -.  A  < +oo  ->  A  =/= -oo )
2322necon2bi 2458 . . . 4  |-  ( A  = -oo  ->  -.  -.  A  < +oo )
2418, 232falsed 710 . . 3  |-  ( A  = -oo  ->  ( A  = +oo  <->  -.  A  < +oo ) )
257, 14, 243jaoi 1340 . 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 1004    = wceq 1398    e. wcel 2202   class class class wbr 4093   RRcr 8074   +oocpnf 8253   -oocmnf 8254   RR*cxr 8255    < clt 8256
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-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-pre-ltirr 8187
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  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-nel 2499  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-xp 4737  df-pnf 8258  df-mnf 8259  df-xr 8260  df-ltxr 8261
This theorem is referenced by:  npnflt  10094  xgepnf  10095  xrmaxiflemlub  11871
  Copyright terms: Public domain W3C validator