| 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 11374 | . . . 4 ⊢ +∞ ∉ ℝ | |
| 2 | 1 | neli 3067 | . . 3 ⊢ ¬ +∞ ∈ ℝ |
| 3 | eleq1 2852 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 ∈ ℝ ↔ +∞ ∈ ℝ)) | |
| 4 | 2, 3 | mtbiri 330 | . 2 ⊢ (𝐴 = +∞ → ¬ 𝐴 ∈ ℝ) |
| 5 | 4 | necon2ai 2988 | 1 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ℝcr 11223 +∞cpnf 11364 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5252 ax-resscn 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1105 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-nel 3066 df-rab 3417 df-v 3456 df-ss 3901 df-in 4094 df-pw 4562 df-uni 4871 df-pnf 11369 |
| This theorem is used by: renepnfd 11384 renfdisj 11393 xrnepnf 13271 rexneg 13365 rexadd 13386 xaddnepnf 13391 xaddcom 13394 xaddrid 13395 xnn0xadd0 13401 xnegdi 13402 xpncan 13405 xleadd1a 13407 rexmul 13425 xmulpnf1 13428 xadddilem 13448 rpsup 14030 hashneq0 14532 hash1snb 14588 xrsnsgrp 21741 xaddeq0 33412 icorempo 38465 ovoliunnfl 38771 voliunnfl 38773 volsupnfl 38774 supxrgelem 46552 supxrge 46553 infleinflem1 46584 infleinflem2 46585 xrre4 46624 supminfxr2 46682 climxrre 46963 sge0repnf 47599 voliunsge0lem 47685 |
| Copyright terms: Public domain | W3C validator |