| 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 10114 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = -∞)) | |
| 2 | xrnepnf 10114 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) | |
| 3 | rexadd 10188 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 8255 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2311 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ∈ ℝ) |
| 6 | 5 | renepnfd 8326 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 7 | oveq2 6060 | . . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 +𝑒 𝐵) = (𝐴 +𝑒 -∞)) | |
| 8 | rexr 8321 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renepnf 8323 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 10 | xaddmnf1 10184 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +𝑒 -∞) = -∞) | |
| 11 | 8, 9, 10 | syl2anc 411 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 -∞) = -∞) |
| 12 | 7, 11 | sylan9eqr 2289 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) = -∞) |
| 13 | mnfnepnf 8331 | . . . . . . 7 ⊢ -∞ ≠ +∞ | |
| 14 | 13 | a1i 9 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → -∞ ≠ +∞) |
| 15 | 12, 14 | eqnetrd 2438 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 16 | 6, 15 | jaodan 805 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 17 | 2, 16 | sylan2b 287 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 18 | oveq1 6059 | . . . . 5 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 𝐵) = (-∞ +𝑒 𝐵)) | |
| 19 | xaddmnf2 10185 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) → (-∞ +𝑒 𝐵) = -∞) | |
| 20 | 18, 19 | sylan9eq 2287 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) = -∞) |
| 21 | 13 | a1i 9 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → -∞ ≠ +∞) |
| 22 | 20, 21 | eqnetrd 2438 | . . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 23 | 17, 22 | jaoian 803 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 24 | 1, 23 | sylanb 284 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 716 = wceq 1398 ∈ wcel 2205 ≠ wne 2414 (class class class)co 6052 ℝcr 8128 + caddc 8132 +∞cpnf 8307 -∞cmnf 8308 ℝ*cxr 8309 +𝑒 cxad 10106 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8220 ax-resscn 8221 ax-1re 8223 ax-addrcl 8226 ax-rnegex 8238 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3045 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-br 4112 df-opab 4174 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-iota 5314 df-fun 5356 df-fv 5362 df-ov 6055 df-oprab 6056 df-mpo 6057 df-pnf 8312 df-mnf 8313 df-xr 8314 df-xadd 10109 |
| This theorem is referenced by: xlt2add 10216 |
| Copyright terms: Public domain | W3C validator |