Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0lepnf | Structured version Visualization version Unicode version |
Description: 0 less than or equal to positive infinity. (Contributed by David A. Wheeler, 8-Dec-2018.) |
Ref | Expression |
---|---|
0lepnf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0xr 10086 | . 2 | |
2 | pnfge 11964 | . 2 | |
3 | 1, 2 | ax-mp 5 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wcel 1990 class class class wbr 4653 cc0 9936 cpnf 10071 cxr 10073 cle 10075 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-i2m1 10004 ax-1ne0 10005 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-xp 5120 df-cnv 5122 df-iota 5851 df-fv 5896 df-ov 6653 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 |
This theorem is referenced by: xnn0ge0 11967 nn0pnfge0OLD 11968 xsubge0 12091 xadddi2 12127 xnn0xrge0 12325 pcge0 15566 leordtval2 21016 iccpnfcnv 22743 taylfval 24113 elxrge02 29640 xrge0adddir 29692 xrge0iifcnv 29979 lmxrge0 29998 esumpinfval 30135 hashf2 30146 esumcvg 30148 pnfel0pnf 39754 |
Copyright terms: Public domain | W3C validator |