| 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 11177 | . 2 ⊢ 0 ∈ ℝ* | |
| 2 | pnfge 13042 | . 2 ⊢ (0 ∈ ℝ* → 0 ≤ +∞) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ 0 ≤ +∞ |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2113 class class class wbr 5096 0cc0 11024 +∞cpnf 11161 ℝ*cxr 11163 ≤ cle 11165 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-addrcl 11085 ax-rnegex 11095 ax-cnre 11097 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-xp 5628 df-cnv 5630 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 |
| This theorem is referenced by: xnn0ge0 13046 xsubge0 13174 xadddi2 13210 xnn0xrge0 13420 pcge0 16788 leordtval2 23154 iccpnfcnv 24896 taylfval 26320 elxrge02 32962 xrge0adddir 33049 xrge0iifcnv 34039 lmxrge0 34058 esumpinfval 34179 hashf2 34190 esumcvg 34192 aks4d1p1p6 42266 pnfel0pnf 45716 |
| Copyright terms: Public domain | W3C validator |