| 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 8373 |
. . . 4
| |
| 2 | 1 | neli 2517 |
. . 3
|
| 3 | eleq1 2301 |
. . 3
| |
| 4 | 2, 3 | mtbiri 686 |
. 2
|
| 5 | 4 | necon2ai 2474 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-un 4580 ax-cnex 8276 ax-resscn 8277 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-rex 2534 df-rab 2537 df-v 2823 df-in 3226 df-ss 3233 df-pw 3690 df-uni 3936 df-pnf 8368 |
| This theorem is used by: renepnfd 8382 renfdisj 8391 ltxrlt 8397 xrnepnf 10196 xrlttri3 10215 nltpnft 10232 xrrebnd 10237 rexneg 10248 xrpnfdc 10260 rexadd 10270 xaddnepnf 10276 xaddcom 10279 xaddid1 10280 xnn0xadd0 10285 xnegdi 10286 xpncan 10289 xleadd1a 10291 xltadd1 10294 xsubge0 10299 xposdif 10300 xleaddadd 10305 xrmaxrecl 12045 |
| Copyright terms: Public domain | W3C validator |