| 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 11256 | . . . 4 ⊢ +∞ ∉ ℝ | |
| 2 | 1 | neli 3065 | . . 3 ⊢ ¬ +∞ ∈ ℝ |
| 3 | eleq1 2850 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 ∈ ℝ ↔ +∞ ∈ ℝ)) | |
| 4 | 2, 3 | mtbiri 330 | . 2 ⊢ (𝐴 = +∞ → ¬ 𝐴 ∈ ℝ) |
| 5 | 4 | necon2ai 2986 | 1 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 ℝcr 11105 +∞cpnf 11246 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-resscn 11163 |
| This proof depends on definitions: df-bi 210 df-an 401 df-3an 1104 df-tru 1572 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-nel 3064 df-rab 3416 df-v 3456 df-in 3911 df-ss 3921 df-pw 4563 df-uni 4872 df-pnf 11251 |
| This theorem is used by: renepnfd 11266 renfdisj 11275 xrnepnf 13149 rexneg 13243 rexadd 13264 xaddnepnf 13269 xaddcom 13272 xaddrid 13273 xnn0xadd0 13279 xnegdi 13280 xpncan 13283 xleadd1a 13285 rexmul 13303 xmulpnf1 13306 xadddilem 13326 rpsup 13906 hashneq0 14407 hash1snb 14463 xrsnsgrp 21569 xaddeq0 33109 icorempo 38025 ovoliunnfl 38341 voliunnfl 38343 volsupnfl 38344 supxrgelem 46081 supxrge 46082 infleinflem1 46113 infleinflem2 46114 xrre4 46153 supminfxr2 46211 climxrre 46492 sge0repnf 47128 voliunsge0lem 47214 |
| Copyright terms: Public domain | W3C validator |