| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > renemnf | Unicode version | ||
| Description: No real equals minus infinity. (Contributed by NM, 14-Oct-2005.) (Proof shortened by Andrew Salmon, 19-Nov-2011.) |
| Ref | Expression |
|---|---|
| renemnf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mnfnre 8369 |
. . . 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-ext 2220 ax-setind 4684 ax-cnex 8271 ax-resscn 8272 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 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-ral 2533 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-uni 3936 df-pnf 8363 df-mnf 8364 |
| This theorem is used by: renemnfd 8378 renfdisj 8386 ltxrlt 8392 xrnemnf 10190 xrlttri3 10210 ngtmnft 10230 xrrebnd 10232 rexneg 10243 xrmnfdc 10256 rexadd 10265 xaddnemnf 10270 xaddcom 10274 xaddid1 10275 xnegdi 10281 xpncan 10284 xleadd1a 10286 xltadd1 10289 xposdif 10295 xrmaxrecl 12039 isxmet2d 15501 |
| Copyright terms: Public domain | W3C validator |