| 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 11388 | . . . 4 ⊢ +∞ ∉ ℝ | |
| 2 | 1 | neli 3070 | . . 3 ⊢ ¬ +∞ ∈ ℝ |
| 3 | eleq1 2855 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 ∈ ℝ ↔ +∞ ∈ ℝ)) | |
| 4 | 2, 3 | mtbiri 330 | . 2 ⊢ (𝐴 = +∞ → ¬ 𝐴 ∈ ℝ) |
| 5 | 4 | necon2ai 2991 | 1 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ℝcr 11237 +∞cpnf 11378 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-resscn 11295 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1106 df-tru 1575 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-ne 2963 df-nel 3069 df-rab 3416 df-v 3455 df-ss 3900 df-in 4093 df-pw 4561 df-uni 4872 df-pnf 11383 |
| This theorem is used by: renepnfd 11398 renfdisj 11407 xrnepnf 13286 rexneg 13380 rexadd 13401 xaddnepnf 13406 xaddcom 13409 xaddrid 13410 xnn0xadd0 13416 xnegdi 13417 xpncan 13420 xleadd1a 13422 rexmul 13440 xmulpnf1 13443 xadddilem 13463 rpsup 14045 hashneq0 14548 hash1snb 14604 xrsnsgrp 21768 xaddeq0 33443 icorempo 38544 ovoliunnfl 38850 voliunnfl 38852 volsupnfl 38853 supxrgelem 46682 supxrge 46683 infleinflem1 46714 infleinflem2 46715 xrre4 46754 supminfxr2 46812 climxrre 47093 sge0repnf 47729 voliunsge0lem 47815 |
| Copyright terms: Public domain | W3C validator |