| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xaddnepnf | 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 10159 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = -∞)) | |
| 2 | xrnepnf 10159 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) | |
| 3 | rexadd 10233 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 8295 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2315 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ∈ ℝ) |
| 6 | 5 | renepnfd 8366 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 7 | oveq2 6083 | . . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 +𝑒 𝐵) = (𝐴 +𝑒 -∞)) | |
| 8 | rexr 8361 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renepnf 8363 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 10 | xaddmnf1 10229 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +𝑒 -∞) = -∞) | |
| 11 | 8, 9, 10 | syl2anc 415 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 -∞) = -∞) |
| 12 | 7, 11 | sylan9eqr 2293 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) = -∞) |
| 13 | mnfnepnf 8371 | . . . . . . 7 ⊢ -∞ ≠ +∞ | |
| 14 | 13 | a1i 9 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → -∞ ≠ +∞) |
| 15 | 12, 14 | eqnetrd 2444 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 16 | 6, 15 | jaodan 809 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 17 | 2, 16 | sylan2b 287 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 18 | oveq1 6082 | . . . . 5 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 𝐵) = (-∞ +𝑒 𝐵)) | |
| 19 | xaddmnf2 10230 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) → (-∞ +𝑒 𝐵) = -∞) | |
| 20 | 18, 19 | sylan9eq 2291 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) = -∞) |
| 21 | 13 | a1i 9 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → -∞ ≠ +∞) |
| 22 | 20, 21 | eqnetrd 2444 | . . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 23 | 17, 22 | jaoian 807 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 24 | 1, 23 | sylanb 284 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 720 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 (class class class)co 6075 ℝcr 8168 + caddc 8172 +∞cpnf 8347 -∞cmnf 8348 ℝ*cxr 8349 +𝑒 cxad 10151 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1re 8263 ax-addrcl 8266 ax-rnegex 8278 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-if 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 df-ov 6078 df-oprab 6079 df-mpo 6080 df-pnf 8352 df-mnf 8353 df-xr 8354 df-xadd 10154 |
| This theorem is referenced by: xlt2add 10261 |
| Copyright terms: Public domain | W3C validator |