| 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 11327. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddrid | ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 0) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxr 13044 | . 2 ⊢ (𝐴 ∈ ℝ* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞)) | |
| 2 | 0re 11148 | . . . . 5 ⊢ 0 ∈ ℝ | |
| 3 | rexadd 13161 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 +𝑒 0) = (𝐴 + 0)) | |
| 4 | 2, 3 | mpan2 692 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 0) = (𝐴 + 0)) |
| 5 | recn 11130 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 6 | 5 | addridd 11347 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + 0) = 𝐴) |
| 7 | 4, 6 | eqtrd 2772 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 0) = 𝐴) |
| 8 | 0xr 11193 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 9 | renemnf 11195 | . . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ -∞) | |
| 10 | 2, 9 | ax-mp 5 | . . . . 5 ⊢ 0 ≠ -∞ |
| 11 | xaddpnf2 13156 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ 0 ≠ -∞) → (+∞ +𝑒 0) = +∞) | |
| 12 | 8, 10, 11 | mp2an 693 | . . . 4 ⊢ (+∞ +𝑒 0) = +∞ |
| 13 | oveq1 7377 | . . . 4 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 0) = (+∞ +𝑒 0)) | |
| 14 | id 22 | . . . 4 ⊢ (𝐴 = +∞ → 𝐴 = +∞) | |
| 15 | 12, 13, 14 | 3eqtr4a 2798 | . . 3 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 0) = 𝐴) |
| 16 | renepnf 11194 | . . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ +∞) | |
| 17 | 2, 16 | ax-mp 5 | . . . . 5 ⊢ 0 ≠ +∞ |
| 18 | xaddmnf2 13158 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ 0 ≠ +∞) → (-∞ +𝑒 0) = -∞) | |
| 19 | 8, 17, 18 | mp2an 693 | . . . 4 ⊢ (-∞ +𝑒 0) = -∞ |
| 20 | oveq1 7377 | . . . 4 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 0) = (-∞ +𝑒 0)) | |
| 21 | id 22 | . . . 4 ⊢ (𝐴 = -∞ → 𝐴 = -∞) | |
| 22 | 19, 20, 21 | 3eqtr4a 2798 | . . 3 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 0) = 𝐴) |
| 23 | 7, 15, 22 | 3jaoi 1431 | . 2 ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) → (𝐴 +𝑒 0) = 𝐴) |
| 24 | 1, 23 | sylbi 217 | 1 ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 0) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ w3o 1086 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 (class class class)co 7370 ℝcr 11039 0cc0 11040 + caddc 11043 +∞cpnf 11177 -∞cmnf 11178 ℝ*cxr 11179 +𝑒 cxad 13038 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-po 5542 df-so 5543 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-ov 7373 df-oprab 7374 df-mpo 7375 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-xadd 13041 |
| This theorem is referenced by: xaddlid 13171 xaddridd 13172 xnn0xadd0 13176 xpncan 13180 xadddi 13224 xrsnsgrp 21379 imasdsf1olem 24334 vtxdlfgrval 29577 vtxdginducedm1 29635 xraddge02 32854 xlt2addrd 32856 xrs0 33105 xrge0addgt0 33116 xrge0npcan 33119 metideq 34077 metider 34078 esumpad 34239 esumpr2 34251 esumpfinvallem 34258 esumpmono 34263 ddemeas 34420 aean 34428 baselcarsg 34490 carsgclctunlem2 34503 xadd0ge 45710 sge0tsms 46767 sge0ss 46799 |
| Copyright terms: Public domain | W3C validator |