Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > xaddid1 | GIF version |
Description: Extended real version of addid1 8027. (Contributed by Mario Carneiro, 20-Aug-2015.) |
Ref | Expression |
---|---|
xaddid1 | ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 0) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elxr 9703 | . 2 ⊢ (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) | |
2 | 0re 7890 | . . . . 5 ⊢ 0 ∈ ℝ | |
3 | rexadd 9779 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 +𝑒 0) = (𝐴 + 0)) | |
4 | 2, 3 | mpan2 422 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 0) = (𝐴 + 0)) |
5 | recn 7877 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
6 | 5 | addid1d 8038 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + 0) = 𝐴) |
7 | 4, 6 | eqtrd 2197 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 0) = 𝐴) |
8 | 0xr 7936 | . . . . 5 ⊢ 0 ∈ ℝ* | |
9 | renemnf 7938 | . . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ -∞) | |
10 | 2, 9 | ax-mp 5 | . . . . 5 ⊢ 0 ≠ -∞ |
11 | xaddpnf2 9774 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ 0 ≠ -∞) → (+∞ +𝑒 0) = +∞) | |
12 | 8, 10, 11 | mp2an 423 | . . . 4 ⊢ (+∞ +𝑒 0) = +∞ |
13 | oveq1 5843 | . . . 4 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 0) = (+∞ +𝑒 0)) | |
14 | id 19 | . . . 4 ⊢ (𝐴 = +∞ → 𝐴 = +∞) | |
15 | 12, 13, 14 | 3eqtr4a 2223 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 0) = 𝐴) |
16 | renepnf 7937 | . . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ +∞) | |
17 | 2, 16 | ax-mp 5 | . . . . 5 ⊢ 0 ≠ +∞ |
18 | xaddmnf2 9776 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ 0 ≠ +∞) → (-∞ +𝑒 0) = -∞) | |
19 | 8, 17, 18 | mp2an 423 | . . . 4 ⊢ (-∞ +𝑒 0) = -∞ |
20 | oveq1 5843 | . . . 4 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 0) = (-∞ +𝑒 0)) | |
21 | id 19 | . . . 4 ⊢ (𝐴 = -∞ → 𝐴 = -∞) | |
22 | 19, 20, 21 | 3eqtr4a 2223 | . . 3 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 0) = 𝐴) |
23 | 7, 15, 22 | 3jaoi 1292 | . 2 ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) → (𝐴 +𝑒 0) = 𝐴) |
24 | 1, 23 | sylbi 120 | 1 ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 0) = 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∨ w3o 966 = wceq 1342 ∈ wcel 2135 ≠ wne 2334 (class class class)co 5836 ℝcr 7743 0cc0 7744 + caddc 7747 +∞cpnf 7921 -∞cmnf 7922 ℝ*cxr 7923 +𝑒 cxad 9697 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 ax-cnex 7835 ax-resscn 7836 ax-1re 7838 ax-addrcl 7841 ax-0id 7852 ax-rnegex 7853 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 968 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-nel 2430 df-ral 2447 df-rex 2448 df-rab 2451 df-v 2723 df-sbc 2947 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-if 3516 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-br 3977 df-opab 4038 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-iota 5147 df-fun 5184 df-fv 5190 df-ov 5839 df-oprab 5840 df-mpo 5841 df-pnf 7926 df-mnf 7927 df-xr 7928 df-xadd 9700 |
This theorem is referenced by: xaddid2 9790 xaddid1d 9791 xnn0xadd0 9794 xpncan 9798 psmetsym 12870 psmetge0 12872 xmetge0 12906 xmetsym 12909 |
Copyright terms: Public domain | W3C validator |