| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xaddnemnf | GIF version | ||
| Description: Closure of extended real addition in the subset ℝ* / {-∞}. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddnemnf | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnemnf 9898 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞)) | |
| 2 | xrnemnf 9898 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞)) | |
| 3 | rexadd 9973 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 8050 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2281 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ∈ ℝ) |
| 6 | 5 | renemnfd 8123 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 7 | oveq2 5951 | . . . . . . 7 ⊢ (𝐵 = +∞ → (𝐴 +𝑒 𝐵) = (𝐴 +𝑒 +∞)) | |
| 8 | rexr 8117 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renemnf 8120 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
| 10 | xaddpnf1 9967 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞) | |
| 11 | 8, 9, 10 | syl2anc 411 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 +∞) = +∞) |
| 12 | 7, 11 | sylan9eqr 2259 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +𝑒 𝐵) = +∞) |
| 13 | pnfnemnf 8126 | . . . . . . 7 ⊢ +∞ ≠ -∞ | |
| 14 | 13 | a1i 9 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → +∞ ≠ -∞) |
| 15 | 12, 14 | eqnetrd 2399 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 16 | 6, 15 | jaodan 798 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 17 | 2, 16 | sylan2b 287 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 18 | oveq1 5950 | . . . . 5 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 𝐵) = (+∞ +𝑒 𝐵)) | |
| 19 | xaddpnf2 9968 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞) → (+∞ +𝑒 𝐵) = +∞) | |
| 20 | 18, 19 | sylan9eq 2257 | . . . 4 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) = +∞) |
| 21 | 13 | a1i 9 | . . . 4 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → +∞ ≠ -∞) |
| 22 | 20, 21 | eqnetrd 2399 | . . 3 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 23 | 17, 22 | jaoian 796 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 24 | 1, 23 | sylanb 284 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∨ wo 709 = wceq 1372 ∈ wcel 2175 ≠ wne 2375 (class class class)co 5943 ℝcr 7923 + caddc 7927 +∞cpnf 8103 -∞cmnf 8104 ℝ*cxr 8105 +𝑒 cxad 9891 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 ax-cnex 8015 ax-resscn 8016 ax-1re 8018 ax-addrcl 8021 ax-rnegex 8033 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-rab 2492 df-v 2773 df-sbc 2998 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-if 3571 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-br 4044 df-opab 4105 df-id 4339 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-iota 5231 df-fun 5272 df-fv 5278 df-ov 5946 df-oprab 5947 df-mpo 5948 df-pnf 8108 df-mnf 8109 df-xr 8110 df-xadd 9894 |
| This theorem is referenced by: xaddass 9990 xlt2add 10001 xadd4d 10006 xleaddadd 10008 |
| Copyright terms: Public domain | W3C validator |