| 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 11281 | . 2 ⊢ 0 ∈ ℝ* | |
| 2 | pnfge 13182 | . 2 ⊢ (0 ∈ ℝ* → 0 ≤ +∞) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 0 ≤ +∞ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 class class class wbr 5103 0cc0 11125 +∞cpnf 11265 ℝ*cxr 11267 ≤ cle 11269 |
| 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 2147 ax-9 2155 ax-ext 2732 ax-sep 5251 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-addrcl 11186 ax-rnegex 11196 ax-cnre 11198 |
| 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 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-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-xp 5661 df-cnv 5663 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 |
| This theorem is used by: xnn0ge0 13186 xsubge0 13314 xadddi2 13350 xnn0xrge0 13560 pcge0 16955 leordtval2 23438 iccpnfcnv 25173 taylfval 26596 elxrge02 33378 xrge0adddir 33459 xrge0iifcnv 34444 lmxrge0 34463 esumpinfval 34584 hashf2 34595 esumcvg 34597 aks4d1p1p6 42940 pnfel0pnf 46359 |
| Copyright terms: Public domain | W3C validator |