| 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 8331 |
. . . 4
| |
| 2 | 1 | neli 2511 |
. . 3
|
| 3 | eleq1 2297 |
. . 3
| |
| 4 | 2, 3 | mtbiri 682 |
. 2
|
| 5 | 4 | necon2ai 2468 |
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 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-un 4559 ax-cnex 8234 ax-resscn 8235 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-rex 2528 df-rab 2531 df-v 2817 df-in 3220 df-ss 3227 df-pw 3676 df-uni 3920 df-pnf 8326 |
| This theorem is referenced by: renepnfd 8340 renfdisj 8349 ltxrlt 8355 xrnepnf 10130 xrlttri3 10149 nltpnft 10166 xrrebnd 10171 rexneg 10182 xrpnfdc 10194 rexadd 10204 xaddnepnf 10210 xaddcom 10213 xaddid1 10214 xnn0xadd0 10219 xnegdi 10220 xpncan 10223 xleadd1a 10225 xltadd1 10228 xsubge0 10233 xposdif 10234 xleaddadd 10239 xrmaxrecl 11965 |
| Copyright terms: Public domain | W3C validator |