| 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 8316 |
. . . 4
| |
| 2 | 1 | neli 2509 |
. . 3
|
| 3 | eleq1 2295 |
. . 3
| |
| 4 | 2, 3 | mtbiri 682 |
. 2
|
| 5 | 4 | necon2ai 2466 |
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-ext 2214 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-v 2815 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-uni 3915 df-pnf 8310 df-mnf 8311 |
| This theorem is referenced by: renemnfd 8325 renfdisj 8333 ltxrlt 8339 xrnemnf 10110 xrlttri3 10130 ngtmnft 10150 xrrebnd 10152 rexneg 10163 xrmnfdc 10176 rexadd 10185 xaddnemnf 10190 xaddcom 10194 xaddid1 10195 xnegdi 10201 xpncan 10204 xleadd1a 10206 xltadd1 10209 xposdif 10215 xrmaxrecl 11940 isxmet2d 15213 |
| Copyright terms: Public domain | W3C validator |