| 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 11395 | . 2 ⊢ 0 ∈ ℝ* | |
| 2 | pnfge 13299 | . 2 ⊢ (0 ∈ ℝ* → 0 ≤ +∞) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 0 ≤ +∞ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2147 class class class wbr 5108 0cc0 11239 +∞cpnf 11379 ℝ*cxr 11381 ≤ cle 11383 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-addrcl 11300 ax-rnegex 11310 ax-cnre 11312 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-xp 5664 df-cnv 5666 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 |
| This theorem is used by: xnn0ge0 13303 xsubge0 13431 xadddi2 13467 xnn0xrge0 13677 pcge0 17084 leordtval2 23585 iccpnfcnv 25320 taylfval 26743 elxrge02 33594 xrge0adddir 33678 xrge0iifcnv 34676 lmxrge0 34695 esumpinfval 34816 hashf2 34827 esumcvg 34829 aks4d1p1p6 43389 pnfel0pnf 46813 |
| Copyright terms: Public domain | W3C validator |