![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > mnfnepnf | Unicode version |
Description: Minus and plus infinity are different (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
Ref | Expression |
---|---|
mnfnepnf |
![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pnfnemnf 8074 |
. 2
![]() ![]() ![]() ![]() | |
2 | 1 | necomi 2449 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-un 4464 ax-cnex 7963 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-rex 2478 df-rab 2481 df-v 2762 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-uni 3836 df-pnf 8056 df-mnf 8057 df-xr 8058 |
This theorem is referenced by: xrnepnf 9844 xrlttri3 9863 nltpnft 9880 xnegmnf 9895 xrpnfdc 9908 xaddmnf1 9914 xaddmnf2 9915 mnfaddpnf 9917 xaddnepnf 9924 xsubge0 9947 xposdif 9948 xleaddadd 9953 |
Copyright terms: Public domain | W3C validator |