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 10682 | . 2 ⊢ 0 ∈ ℝ* | |
2 | pnfge 12519 | . 2 ⊢ (0 ∈ ℝ* → 0 ≤ +∞) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ 0 ≤ +∞ |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2110 class class class wbr 5058 0cc0 10531 +∞cpnf 10666 ℝ*cxr 10668 ≤ cle 10670 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-addrcl 10592 ax-rnegex 10602 ax-cnre 10604 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-xp 5555 df-cnv 5557 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 |
This theorem is referenced by: xnn0ge0 12522 xsubge0 12648 xadddi2 12684 xnn0xrge0 12885 pcge0 16192 leordtval2 21814 iccpnfcnv 23542 taylfval 24941 elxrge02 30603 xrge0adddir 30674 xrge0iifcnv 31171 lmxrge0 31190 esumpinfval 31327 hashf2 31338 esumcvg 31340 pnfel0pnf 41797 |
Copyright terms: Public domain | W3C validator |