| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0lepnf | Structured version Visualization version GIF version | ||
| Description: 0 less than or equal to positive infinity. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| Ref | Expression |
|---|---|
| 0lepnf | ⊢ 0 ≤ +∞ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0xr 11255 | . 2 ⊢ 0 ∈ ℝ* | |
| 2 | pnfge 13154 | . 2 ⊢ (0 ∈ ℝ* → 0 ≤ +∞) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 0 ≤ +∞ |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2149 class class class wbr 5113 0cc0 11099 +∞cpnf 11239 ℝ*cxr 11241 ≤ cle 11243 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-addrcl 11160 ax-rnegex 11170 ax-cnre 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-xp 5668 df-cnv 5670 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 |
| This theorem is referenced by: xnn0ge0 13158 xsubge0 13286 xadddi2 13322 xnn0xrge0 13532 pcge0 16921 leordtval2 23337 iccpnfcnv 25071 taylfval 26487 elxrge02 33191 xrge0adddir 33278 xrge0iifcnv 34267 lmxrge0 34286 esumpinfval 34407 hashf2 34418 esumcvg 34420 aks4d1p1p6 42729 pnfel0pnf 46135 |
| Copyright terms: Public domain | W3C validator |