Theorem xaddval 13393

Description: Value of the extended real addition operation. (Contributed by Mario Carneiro, 20-Aug-2015.)

Assertion

Ref	Expression
xaddval	⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +e 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))))

Proof of Theorem xaddval

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 488	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 = 𝐴)
2	1	eqeq1d 2765	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 = +∞ ↔ 𝐴 = +∞))
3		simpr 490	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
4	3	eqeq1d 2765	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑦 = -∞ ↔ 𝐵 = -∞))
5	4	ifbid 4509	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑦 = -∞, 0, +∞) = if(𝐵 = -∞, 0, +∞))
6	1	eqeq1d 2765	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 = -∞ ↔ 𝐴 = -∞))
7	3	eqeq1d 2765	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑦 = +∞ ↔ 𝐵 = +∞))
8	7	ifbid 4509	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑦 = +∞, 0, -∞) = if(𝐵 = +∞, 0, -∞))
9		oveq12 7460	. . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 + 𝑦) = (𝐴 + 𝐵))
10	4, 9	ifbieq2d 4512	. . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑦 = -∞, -∞, (𝑥 + 𝑦)) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))
11	7, 10	ifbieq2d 4512	. . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))
12	6, 8, 11	ifbieq12d 4514	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦)))) = if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))
13	2, 5, 12	ifbieq12d 4514	. 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))))
14		df-xadd 13282	. 2 ⊢ +e = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))))
15		c0ex 11339	. . . 4 ⊢ 0 ∈ V
16		pnfex 11401	. . . 4 ⊢ +∞ ∈ V
17	15, 16	ifex 4536	. . 3 ⊢ if(𝐵 = -∞, 0, +∞) ∈ V
18		mnfxr 11405	. . . . . 6 ⊢ -∞ ∈ ℝ*
19	18	elexi 3476	. . . . 5 ⊢ -∞ ∈ V
20	15, 19	ifex 4536	. . . 4 ⊢ if(𝐵 = +∞, 0, -∞) ∈ V
21		ovex 7484	. . . . . 6 ⊢ (𝐴 + 𝐵) ∈ V
22	19, 21	ifex 4536	. . . . 5 ⊢ if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) ∈ V
23	16, 22	ifex 4536	. . . 4 ⊢ if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) ∈ V
24	20, 23	ifex 4536	. . 3 ⊢ if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) ∈ V
25	17, 24	ifex 4536	. 2 ⊢ if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) ∈ V
26	13, 14, 25	ovmpoa 7607	1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +e 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ifcif 4485  (class class class)co 7451  0cc0 11239   + caddc 11242  +∞cpnf 11379  -∞cmnf 11380  ℝ^*cxr 11381   +_e cxad 13279

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-mulcl 11301  ax-i2m1 11307

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-pnf 11384  df-mnf 11385  df-xr 11386  df-xadd 13282

This theorem is used by:  xaddpnf1  13396  xaddpnf2  13397  xaddmnf1  13398  xaddmnf2  13399  pnfaddmnf  13400  mnfaddpnf  13401  rexadd  13402