| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > renepnf | Unicode version | ||
| Description: No (finite) real equals plus infinity. (Contributed by NM, 14-Oct-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.) |
| Ref | Expression |
|---|---|
| renepnf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pnfnre 8280 |
. . . 4
| |
| 2 | 1 | neli 2500 |
. . 3
|
| 3 | eleq1 2294 |
. . 3
| |
| 4 | 2, 3 | mtbiri 682 |
. 2
|
| 5 | 4 | necon2ai 2457 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-un 4536 ax-cnex 8183 ax-resscn 8184 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-rex 2517 df-rab 2520 df-v 2805 df-in 3207 df-ss 3214 df-pw 3658 df-uni 3899 df-pnf 8275 |
| This theorem is referenced by: renepnfd 8289 renfdisj 8298 ltxrlt 8304 xrnepnf 10074 xrlttri3 10093 nltpnft 10110 xrrebnd 10115 rexneg 10126 xrpnfdc 10138 rexadd 10148 xaddnepnf 10154 xaddcom 10157 xaddid1 10158 xnn0xadd0 10163 xnegdi 10164 xpncan 10167 xleadd1a 10169 xltadd1 10172 xsubge0 10177 xposdif 10178 xleaddadd 10183 xrmaxrecl 11895 |
| Copyright terms: Public domain | W3C validator |