Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > renepnf | Structured version Visualization version GIF 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 10081 | . . . 4 ⊢ +∞ ∉ ℝ | |
2 | 1 | neli 2899 | . . 3 ⊢ ¬ +∞ ∈ ℝ |
3 | eleq1 2689 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 ∈ ℝ ↔ +∞ ∈ ℝ)) | |
4 | 2, 3 | mtbiri 317 | . 2 ⊢ (𝐴 = +∞ → ¬ 𝐴 ∈ ℝ) |
5 | 4 | necon2ai 2823 | 1 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ℝcr 9935 +∞cpnf 10071 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 ax-un 6949 ax-resscn 9993 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-pw 4160 df-sn 4178 df-pr 4180 df-uni 4437 df-pnf 10076 |
This theorem is referenced by: renepnfd 10090 renfdisj 10098 xrnepnf 11952 rexneg 12042 rexadd 12063 xaddnepnf 12068 xaddcom 12071 xaddid1 12072 xnn0xadd0 12077 xnegdi 12078 xpncan 12081 xleadd1a 12083 rexmul 12101 xmulpnf1 12104 xadddilem 12124 rpsup 12665 hashneq0 13155 hash1snb 13207 xrsnsgrp 19782 xaddeq0 29518 icorempt2 33199 ovoliunnfl 33451 voliunnfl 33453 volsupnfl 33454 supxrgelem 39553 supxrge 39554 infleinflem1 39586 infleinflem2 39587 xrre4 39638 supminfxr2 39699 climxrre 39982 sge0repnf 40603 voliunsge0lem 40689 |
Copyright terms: Public domain | W3C validator |