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

Theorem xaddf 12006
Description: The extended real addition operation is closed in extended reals. (Contributed by Mario Carneiro, 21-Aug-2015.)
Assertion
Ref Expression
xaddf +𝑒 :(ℝ* × ℝ*)⟶ℝ*

Proof of Theorem xaddf
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0xr 10038 . . . . . 6 0 ∈ ℝ*
2 pnfxr 10044 . . . . . 6 +∞ ∈ ℝ*
31, 2keepel 4132 . . . . 5 if(𝑦 = -∞, 0, +∞) ∈ ℝ*
43a1i 11 . . . 4 (((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ 𝑥 = +∞) → if(𝑦 = -∞, 0, +∞) ∈ ℝ*)
5 mnfxr 10048 . . . . . . 7 -∞ ∈ ℝ*
61, 5keepel 4132 . . . . . 6 if(𝑦 = +∞, 0, -∞) ∈ ℝ*
76a1i 11 . . . . 5 ((((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ ¬ 𝑥 = +∞) ∧ 𝑥 = -∞) → if(𝑦 = +∞, 0, -∞) ∈ ℝ*)
82a1i 11 . . . . . . . 8 ((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ 𝑦 = +∞) → +∞ ∈ ℝ*)
95a1i 11 . . . . . . . . 9 (((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ ¬ 𝑦 = +∞) ∧ 𝑦 = -∞) → -∞ ∈ ℝ*)
10 ioran 511 . . . . . . . . . . . . . 14 (¬ (𝑥 = +∞ ∨ 𝑥 = -∞) ↔ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞))
11 elxr 11902 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ ℝ* ↔ (𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞))
12 3orass 1039 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞) ↔ (𝑥 ∈ ℝ ∨ (𝑥 = +∞ ∨ 𝑥 = -∞)))
1311, 12sylbb 209 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ ℝ* → (𝑥 ∈ ℝ ∨ (𝑥 = +∞ ∨ 𝑥 = -∞)))
1413ord 392 . . . . . . . . . . . . . . . 16 (𝑥 ∈ ℝ* → (¬ 𝑥 ∈ ℝ → (𝑥 = +∞ ∨ 𝑥 = -∞)))
1514con1d 139 . . . . . . . . . . . . . . 15 (𝑥 ∈ ℝ* → (¬ (𝑥 = +∞ ∨ 𝑥 = -∞) → 𝑥 ∈ ℝ))
1615imp 445 . . . . . . . . . . . . . 14 ((𝑥 ∈ ℝ* ∧ ¬ (𝑥 = +∞ ∨ 𝑥 = -∞)) → 𝑥 ∈ ℝ)
1710, 16sylan2br 493 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) → 𝑥 ∈ ℝ)
18 ioran 511 . . . . . . . . . . . . . 14 (¬ (𝑦 = +∞ ∨ 𝑦 = -∞) ↔ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞))
19 elxr 11902 . . . . . . . . . . . . . . . . . 18 (𝑦 ∈ ℝ* ↔ (𝑦 ∈ ℝ ∨ 𝑦 = +∞ ∨ 𝑦 = -∞))
20 3orass 1039 . . . . . . . . . . . . . . . . . 18 ((𝑦 ∈ ℝ ∨ 𝑦 = +∞ ∨ 𝑦 = -∞) ↔ (𝑦 ∈ ℝ ∨ (𝑦 = +∞ ∨ 𝑦 = -∞)))
2119, 20sylbb 209 . . . . . . . . . . . . . . . . 17 (𝑦 ∈ ℝ* → (𝑦 ∈ ℝ ∨ (𝑦 = +∞ ∨ 𝑦 = -∞)))
2221ord 392 . . . . . . . . . . . . . . . 16 (𝑦 ∈ ℝ* → (¬ 𝑦 ∈ ℝ → (𝑦 = +∞ ∨ 𝑦 = -∞)))
2322con1d 139 . . . . . . . . . . . . . . 15 (𝑦 ∈ ℝ* → (¬ (𝑦 = +∞ ∨ 𝑦 = -∞) → 𝑦 ∈ ℝ))
2423imp 445 . . . . . . . . . . . . . 14 ((𝑦 ∈ ℝ* ∧ ¬ (𝑦 = +∞ ∨ 𝑦 = -∞)) → 𝑦 ∈ ℝ)
2518, 24sylan2br 493 . . . . . . . . . . . . 13 ((𝑦 ∈ ℝ* ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞)) → 𝑦 ∈ ℝ)
26 readdcl 9971 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 + 𝑦) ∈ ℝ)
2717, 25, 26syl2an 494 . . . . . . . . . . . 12 (((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ (𝑦 ∈ ℝ* ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞))) → (𝑥 + 𝑦) ∈ ℝ)
2827rexrd 10041 . . . . . . . . . . 11 (((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ (𝑦 ∈ ℝ* ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞))) → (𝑥 + 𝑦) ∈ ℝ*)
2928anassrs 679 . . . . . . . . . 10 ((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞)) → (𝑥 + 𝑦) ∈ ℝ*)
3029anassrs 679 . . . . . . . . 9 (((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ ¬ 𝑦 = +∞) ∧ ¬ 𝑦 = -∞) → (𝑥 + 𝑦) ∈ ℝ*)
319, 30ifclda 4097 . . . . . . . 8 ((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ ¬ 𝑦 = +∞) → if(𝑦 = -∞, -∞, (𝑥 + 𝑦)) ∈ ℝ*)
328, 31ifclda 4097 . . . . . . 7 (((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) → if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))) ∈ ℝ*)
3332an32s 845 . . . . . 6 (((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) → if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))) ∈ ℝ*)
3433anassrs 679 . . . . 5 ((((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ ¬ 𝑥 = +∞) ∧ ¬ 𝑥 = -∞) → if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))) ∈ ℝ*)
357, 34ifclda 4097 . . . 4 (((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ ¬ 𝑥 = +∞) → if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦)))) ∈ ℝ*)
364, 35ifclda 4097 . . 3 ((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) → if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))) ∈ ℝ*)
3736rgen2a 2972 . 2 𝑥 ∈ ℝ*𝑦 ∈ ℝ* if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))) ∈ ℝ*
38 df-xadd 11899 . . 3 +𝑒 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))))
3938fmpt2 7189 . 2 (∀𝑥 ∈ ℝ*𝑦 ∈ ℝ* if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))) ∈ ℝ* ↔ +𝑒 :(ℝ* × ℝ*)⟶ℝ*)
4037, 39mpbi 220 1 +𝑒 :(ℝ* × ℝ*)⟶ℝ*
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wo 383  wa 384  w3o 1035   = wceq 1480  wcel 1987  wral 2907  ifcif 4063   × cxp 5077  wf 5848  (class class class)co 6610  cr 9887  0cc0 9888   + caddc 9891  +∞cpnf 10023  -∞cmnf 10024  *cxr 10025   +𝑒 cxad 11896
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909  ax-cnex 9944  ax-1cn 9946  ax-icn 9947  ax-addcl 9948  ax-addrcl 9949  ax-mulcl 9950  ax-mulrcl 9951  ax-i2m1 9956  ax-1ne0 9957  ax-rnegex 9959  ax-rrecex 9960  ax-cnre 9961
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-fv 5860  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-1st 7120  df-2nd 7121  df-pnf 10028  df-mnf 10029  df-xr 10030  df-xadd 11899
This theorem is referenced by:  xaddcl  12021  xrsadd  19695  xrofsup  29400  xrge0pluscn  29792  xrge0tmdOLD  29797
  Copyright terms: Public domain W3C validator