| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xaddnepnf | Structured version Visualization version GIF version | ||
| Description: Closure of extended real addition in the subset ℝ* / {+∞}. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddnepnf | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnepnf 13171 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = -∞)) | |
| 2 | xrnepnf 13171 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) | |
| 3 | rexadd 13286 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 11210 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2862 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ∈ ℝ) |
| 6 | 5 | renepnfd 11287 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 7 | oveq2 7424 | . . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 +𝑒 𝐵) = (𝐴 +𝑒 -∞)) | |
| 8 | rexr 11282 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renepnf 11284 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 10 | xaddmnf1 13282 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +𝑒 -∞) = -∞) | |
| 11 | 8, 9, 10 | syl2anc 596 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 -∞) = -∞) |
| 12 | 7, 11 | sylan9eqr 2819 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) = -∞) |
| 13 | mnfnepnf 11292 | . . . . . . 7 ⊢ -∞ ≠ +∞ | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → -∞ ≠ +∞) |
| 15 | 12, 14 | eqnetrd 3024 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 16 | 6, 15 | jaodan 972 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 17 | 2, 16 | sylan2b 606 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 18 | oveq1 7423 | . . . . 5 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 𝐵) = (-∞ +𝑒 𝐵)) | |
| 19 | xaddmnf2 13283 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) → (-∞ +𝑒 𝐵) = -∞) | |
| 20 | 18, 19 | sylan9eq 2817 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) = -∞) |
| 21 | 13 | a1i 11 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → -∞ ≠ +∞) |
| 22 | 20, 21 | eqnetrd 3024 | . . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 23 | 17, 22 | jaoian 971 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 24 | 1, 23 | sylanb 593 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ≠ wne 2957 (class class class)co 7416 ℝcr 11126 + caddc 11130 +∞cpnf 11267 -∞cmnf 11268 ℝ*cxr 11269 +𝑒 cxad 13163 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-i2m1 11195 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-xadd 13166 |
| This theorem is used by: xlt2add 13314 |
| Copyright terms: Public domain | W3C validator |