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

Theorem 0ltpnf 10163
Description: Zero is less than plus infinity (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
Assertion
Ref Expression
0ltpnf  |-  0  < +oo

Proof of Theorem 0ltpnf
StepHypRef Expression
1 0re 8316 . 2  |-  0  e.  RR
2 ltpnf 10161 . 2  |-  ( 0  e.  RR  ->  0  < +oo )
31, 2ax-mp 5 1  |-  0  < +oo
Colors of variables: wff set class
Syntax hints:    e. wcel 2209   class class class wbr 4125   RRcr 8168   0cc0 8169   +oocpnf 8347    < clt 8350
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-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-cnex 8260  ax-1re 8263  ax-addrcl 8266  ax-rnegex 8278
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-v 2823  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-br 4126  df-opab 4188  df-xp 4775  df-pnf 8352  df-xr 8354  df-ltxr 8355
This theorem is referenced by:  xposdif  10263
  Copyright terms: Public domain W3C validator