xaddrid - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xaddrid		Structured version Visualization version GIF version

Theorem xaddrid 13279

Description: Extended real version of addrid 11401. (Contributed by Mario Carneiro, 20-Aug-2015.)

**Assertion**
Ref	Expression
xaddrid	⊢ (𝐴 ∈ ℝ^* → (𝐴 +_𝑒 0) = 𝐴)

**Proof of Theorem xaddrid**
Step	Hyp	Ref	Expression
1		elxr 13153	. 2 ⊢ (𝐴 ∈ ℝ^* ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞))
2		0re 11221	. . . . 5 ⊢ 0 ∈ ℝ
3		rexadd 13270	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 +_𝑒 0) = (𝐴 + 0))
4	2, 3	mpan2 704	. . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 +_𝑒 0) = (𝐴 + 0))
5		recn 11201	. . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ)
6	5	addridd 11421	. . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + 0) = 𝐴)
7	4, 6	eqtrd 2800	. . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 +_𝑒 0) = 𝐴)
8		0xr 11267	. . . . 5 ⊢ 0 ∈ ℝ^*
9		renemnf 11269	. . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ -∞)
10	2, 9	ax-mp 5	. . . . 5 ⊢ 0 ≠ -∞
11		xaddpnf2 13265	. . . . 5 ⊢ ((0 ∈ ℝ^* ∧ 0 ≠ -∞) → (+∞ +_𝑒 0) = +∞)
12	8, 10, 11	mp2an 705	. . . 4 ⊢ (+∞ +_𝑒 0) = +∞
13		oveq1 7423	. . . 4 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 0) = (+∞ +_𝑒 0))
14		id 23	. . . 4 ⊢ (𝐴 = +∞ → 𝐴 = +∞)
15	12, 13, 14	3eqtr4a 2826	. . 3 ⊢ (𝐴 = +∞ → (𝐴 +_𝑒 0) = 𝐴)
16		renepnf 11268	. . . . . 6 ⊢ (0 ∈ ℝ → 0 ≠ +∞)
17	2, 16	ax-mp 5	. . . . 5 ⊢ 0 ≠ +∞
18		xaddmnf2 13267	. . . . 5 ⊢ ((0 ∈ ℝ^* ∧ 0 ≠ +∞) → (-∞ +_𝑒 0) = -∞)
19	8, 17, 18	mp2an 705	. . . 4 ⊢ (-∞ +_𝑒 0) = -∞
20		oveq1 7423	. . . 4 ⊢ (𝐴 = -∞ → (𝐴 +_𝑒 0) = (-∞ +_𝑒 0))
21		id 23	. . . 4 ⊢ (𝐴 = -∞ → 𝐴 = -∞)
22	19, 20, 21	3eqtr4a 2826	. . 3 ⊢ (𝐴 = -∞ → (𝐴 +_𝑒 0) = 𝐴)
23	7, 15, 22	3jaoi 1454	. 2 ⊢ ((𝐴 ∈ ℝ ∨ 𝐴 = +∞ ∨ 𝐴 = -∞) → (𝐴 +_𝑒 0) = 𝐴)
24	1, 23	sylbi 220	1 ⊢ (𝐴 ∈ ℝ^* → (𝐴 +_𝑒 0) = 𝐴)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∨ w3o 1102 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 (class class class)co 7416 ℝcr 11110 0cc0 11111 + caddc 11114 +∞cpnf 11251 -∞cmnf 11252 ℝ^*cxr 11253 +_𝑒 cxad 13147

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-xadd 13150

This theorem is used by: xaddlid 13280 xaddridd 13281 xnn0xadd0 13285 xpncan 13289 xadddi 13333 xrsnsgrp 21588 imasdsf1olem 24561 vtxdlfgrval 29869 vtxdginducedm1 29927 xraddge02 33148 xlt2addrd 33150 xrs0 33366 xrge0addgt0 33377 xrge0npcan 33380 metideq 34323 metider 34324 esumpad 34485 esumpr2 34497 esumpfinvallem 34504 esumpmono 34509 ddemeas 34667 aean 34675 baselcarsg 34737 carsgclctunlem2 34750 xadd0ge 46071 sge0tsms 47127 sge0ss 47159

W3C validator