| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xaddrid | Structured version Visualization version GIF version | ||
| Description: Extended real version of addrid 11313. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddrid | ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 0) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxr 13030 | . 2 ⊢ (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) | |
| 2 | 0re 11134 | . . . . 5 ⊢ 0 ∈ ℝ | |
| 3 | rexadd 13147 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 +𝑒 0) = (𝐴 + 0)) | |
| 4 | 2, 3 | mpan2 691 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 0) = (𝐴 + 0)) |
| 5 | recn 11116 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 6 | 5 | addridd 11333 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + 0) = 𝐴) |
| 7 | 4, 6 | eqtrd 2771 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 0) = 𝐴) |
| 8 | 0xr 11179 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 9 | renemnf 11181 | . . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ -∞) | |
| 10 | 2, 9 | ax-mp 5 | . . . . 5 ⊢ 0 ≠ -∞ |
| 11 | xaddpnf2 13142 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ 0 ≠ -∞) → (+∞ +𝑒 0) = +∞) | |
| 12 | 8, 10, 11 | mp2an 692 | . . . 4 ⊢ (+∞ +𝑒 0) = +∞ |
| 13 | oveq1 7365 | . . . 4 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 0) = (+∞ +𝑒 0)) | |
| 14 | id 22 | . . . 4 ⊢ (𝐴 = +∞ → 𝐴 = +∞) | |
| 15 | 12, 13, 14 | 3eqtr4a 2797 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 0) = 𝐴) |
| 16 | renepnf 11180 | . . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ +∞) | |
| 17 | 2, 16 | ax-mp 5 | . . . . 5 ⊢ 0 ≠ +∞ |
| 18 | xaddmnf2 13144 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ 0 ≠ +∞) → (-∞ +𝑒 0) = -∞) | |
| 19 | 8, 17, 18 | mp2an 692 | . . . 4 ⊢ (-∞ +𝑒 0) = -∞ |
| 20 | oveq1 7365 | . . . 4 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 0) = (-∞ +𝑒 0)) | |
| 21 | id 22 | . . . 4 ⊢ (𝐴 = -∞ → 𝐴 = -∞) | |
| 22 | 19, 20, 21 | 3eqtr4a 2797 | . . 3 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 0) = 𝐴) |
| 23 | 7, 15, 22 | 3jaoi 1430 | . 2 ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) → (𝐴 +𝑒 0) = 𝐴) |
| 24 | 1, 23 | sylbi 217 | 1 ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 0) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ w3o 1085 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 (class class class)co 7358 ℝcr 11025 0cc0 11026 + caddc 11029 +∞cpnf 11163 -∞cmnf 11164 ℝ*cxr 11165 +𝑒 cxad 13024 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-xadd 13027 |
| This theorem is referenced by: xaddlid 13157 xaddridd 13158 xnn0xadd0 13162 xpncan 13166 xadddi 13210 xrsnsgrp 21362 imasdsf1olem 24317 vtxdlfgrval 29559 vtxdginducedm1 29617 xraddge02 32837 xlt2addrd 32839 xrs0 33088 xrge0addgt0 33099 xrge0npcan 33102 metideq 34050 metider 34051 esumpad 34212 esumpr2 34224 esumpfinvallem 34231 esumpmono 34236 ddemeas 34393 aean 34401 baselcarsg 34463 carsgclctunlem2 34476 xadd0ge 45567 sge0tsms 46624 sge0ss 46656 |
| Copyright terms: Public domain | W3C validator |