| 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 11273 | . 2 ⊢ 0 ∈ ℝ* | |
| 2 | pnfge 13173 | . 2 ⊢ (0 ∈ ℝ* → 0 ≤ +∞) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 0 ≤ +∞ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2146 class class class wbr 5111 0cc0 11117 +∞cpnf 11257 ℝ*cxr 11259 ≤ cle 11261 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-addrcl 11178 ax-rnegex 11188 ax-cnre 11190 |
| 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 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-xp 5669 df-cnv 5671 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 |
| This theorem is used by: xnn0ge0 13177 xsubge0 13305 xadddi2 13341 xnn0xrge0 13551 pcge0 16946 leordtval2 23421 iccpnfcnv 25156 taylfval 26575 elxrge02 33323 xrge0adddir 33404 xrge0iifcnv 34389 lmxrge0 34408 esumpinfval 34529 hashf2 34540 esumcvg 34542 aks4d1p1p6 42900 pnfel0pnf 46304 |
| Copyright terms: Public domain | W3C validator |