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

Theorem ltpnfd 10117
Description: Any (finite) real is less than plus infinity. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
Hypothesis
Ref Expression
ltpnfd.a  |-  ( ph  ->  A  e.  RR )
Assertion
Ref Expression
ltpnfd  |-  ( ph  ->  A  < +oo )

Proof of Theorem ltpnfd
StepHypRef Expression
1 ltpnfd.a . 2  |-  ( ph  ->  A  e.  RR )
2 ltpnf 10116 . 2  |-  ( A  e.  RR  ->  A  < +oo )
31, 2syl 14 1  |-  ( ph  ->  A  < +oo )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2205   class class class wbr 4111   RRcr 8128   +oocpnf 8307    < clt 8310
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 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 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-cnex 8220
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-br 4112  df-opab 4174  df-xp 4757  df-pnf 8312  df-xr 8314  df-ltxr 8315
This theorem is referenced by:  xnn0dcle  10138  xqltnle  10631  fprodge1  12329  pcadd  13042  repiecelem  16826  repiecele0  16827  repiecege0  16828
  Copyright terms: Public domain W3C validator