| 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 8221 |
. . . 4
| |
| 2 | 1 | neli 2499 |
. . 3
|
| 3 | eleq1 2294 |
. . 3
| |
| 4 | 2, 3 | mtbiri 681 |
. 2
|
| 5 | 4 | necon2ai 2456 |
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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-un 4530 ax-cnex 8123 ax-resscn 8124 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-rex 2516 df-rab 2519 df-v 2804 df-in 3206 df-ss 3213 df-pw 3654 df-uni 3894 df-pnf 8216 |
| This theorem is referenced by: renepnfd 8230 renfdisj 8239 ltxrlt 8245 xrnepnf 10013 xrlttri3 10032 nltpnft 10049 xrrebnd 10054 rexneg 10065 xrpnfdc 10077 rexadd 10087 xaddnepnf 10093 xaddcom 10096 xaddid1 10097 xnn0xadd0 10102 xnegdi 10103 xpncan 10106 xleadd1a 10108 xltadd1 10111 xsubge0 10116 xposdif 10117 xleaddadd 10122 xrmaxrecl 11833 |
| Copyright terms: Public domain | W3C validator |