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 7950 | . . . 4 | |
2 | 1 | neli 2437 | . . 3 |
3 | eleq1 2233 | . . 3 | |
4 | 2, 3 | mtbiri 670 | . 2 |
5 | 4 | necon2ai 2394 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1348 wcel 2141 wne 2340 cr 7762 cpnf 7940 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4105 ax-un 4416 ax-cnex 7854 ax-resscn 7855 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-rex 2454 df-rab 2457 df-v 2732 df-in 3127 df-ss 3134 df-pw 3566 df-uni 3795 df-pnf 7945 |
This theorem is referenced by: renepnfd 7959 renfdisj 7968 ltxrlt 7974 xrnepnf 9724 xrlttri3 9743 nltpnft 9760 xrrebnd 9765 rexneg 9776 xrpnfdc 9788 rexadd 9798 xaddnepnf 9804 xaddcom 9807 xaddid1 9808 xnn0xadd0 9813 xnegdi 9814 xpncan 9817 xleadd1a 9819 xltadd1 9822 xsubge0 9827 xposdif 9828 xleaddadd 9833 xrmaxrecl 11207 |
Copyright terms: Public domain | W3C validator |