| 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 11363 | . 2 ⊢ 0 ∈ ℝ* | |
| 2 | pnfge 13266 | . 2 ⊢ (0 ∈ ℝ* → 0 ≤ +∞) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 0 ≤ +∞ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2144 class class class wbr 5102 0cc0 11207 +∞cpnf 11347 ℝ*cxr 11349 ≤ cle 11351 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-addrcl 11268 ax-rnegex 11278 ax-cnre 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-xp 5657 df-cnv 5659 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 |
| This theorem is used by: xnn0ge0 13270 xsubge0 13398 xadddi2 13434 xnn0xrge0 13644 pcge0 17049 leordtval2 23539 iccpnfcnv 25274 taylfval 26695 elxrge02 33548 xrge0adddir 33629 xrge0iifcnv 34615 lmxrge0 34634 esumpinfval 34755 hashf2 34766 esumcvg 34768 aks4d1p1p6 43260 pnfel0pnf 46676 |
| Copyright terms: Public domain | W3C validator |