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 10676 | . . . 4 ⊢ +∞ ∉ ℝ | |
2 | 1 | neli 3125 | . . 3 ⊢ ¬ +∞ ∈ ℝ |
3 | eleq1 2900 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 ∈ ℝ ↔ +∞ ∈ ℝ)) | |
4 | 2, 3 | mtbiri 329 | . 2 ⊢ (𝐴 = +∞ → ¬ 𝐴 ∈ ℝ) |
5 | 4 | necon2ai 3045 | 1 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ℝcr 10530 +∞cpnf 10666 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 ax-un 7455 ax-resscn 10588 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-pw 4540 df-sn 4561 df-pr 4563 df-uni 4832 df-pnf 10671 |
This theorem is referenced by: renepnfd 10686 renfdisj 10695 xrnepnf 12507 rexneg 12598 rexadd 12619 xaddnepnf 12624 xaddcom 12627 xaddid1 12628 xnn0xadd0 12634 xnegdi 12635 xpncan 12638 xleadd1a 12640 rexmul 12658 xmulpnf1 12661 xadddilem 12681 rpsup 13228 hashneq0 13719 hash1snb 13774 xrsnsgrp 20575 xaddeq0 30471 icorempo 34626 ovoliunnfl 34928 voliunnfl 34930 volsupnfl 34931 supxrgelem 41598 supxrge 41599 infleinflem1 41631 infleinflem2 41632 xrre4 41678 supminfxr2 41738 climxrre 42024 sge0repnf 42662 voliunsge0lem 42748 |
Copyright terms: Public domain | W3C validator |