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

Theorem renepnf 8226
Description: No (finite) real equals plus infinity. (Contributed by NM, 14-Oct-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.)
Assertion
Ref Expression
renepnf  |-  ( A  e.  RR  ->  A  =/= +oo )

Proof of Theorem renepnf
StepHypRef Expression
1 pnfnre 8220 . . . 4  |- +oo  e/  RR
21neli 2499 . . 3  |-  -. +oo  e.  RR
3 eleq1 2294 . . 3  |-  ( A  = +oo  ->  ( A  e.  RR  <-> +oo  e.  RR ) )
42, 3mtbiri 681 . 2  |-  ( A  = +oo  ->  -.  A  e.  RR )
54necon2ai 2456 1  |-  ( A  e.  RR  ->  A  =/= +oo )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1397    e. wcel 2202    =/= wne 2402   RRcr 8030   +oocpnf 8210
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-un 4530  ax-cnex 8122  ax-resscn 8123
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-rex 2516  df-rab 2519  df-v 2804  df-in 3206  df-ss 3213  df-pw 3654  df-uni 3894  df-pnf 8215
This theorem is referenced by:  renepnfd  8229  renfdisj  8238  ltxrlt  8244  xrnepnf  10012  xrlttri3  10031  nltpnft  10048  xrrebnd  10053  rexneg  10064  xrpnfdc  10076  rexadd  10086  xaddnepnf  10092  xaddcom  10095  xaddid1  10096  xnn0xadd0  10101  xnegdi  10102  xpncan  10105  xleadd1a  10107  xltadd1  10110  xsubge0  10115  xposdif  10116  xleaddadd  10121  xrmaxrecl  11815
  Copyright terms: Public domain W3C validator