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

Theorem xaddf 11929
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 9965 . . . . . 6 0 ∈ ℝ*
2 pnfxr 9971 . . . . . 6 +∞ ∈ ℝ*
31, 2keepel 4105 . . . . 5 if(𝑦 = -∞, 0, +∞) ∈ ℝ*
43a1i 11 . . . 4 (((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ 𝑥 = +∞) → if(𝑦 = -∞, 0, +∞) ∈ ℝ*)
5 mnfxr 9975 . . . . . . 7 -∞ ∈ ℝ*
61, 5keepel 4105 . . . . . 6 if(𝑦 = +∞, 0, -∞) ∈ ℝ*
76a1i 11 . . . . 5 ((((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ ¬ 𝑥 = +∞) ∧ 𝑥 = -∞) → if(𝑦 = +∞, 0, -∞) ∈ ℝ*)
82a1i 11 . . . . . . . 8 ((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ 𝑦 = +∞) → +∞ ∈ ℝ*)
95a1i 11 . . . . . . . . 9 (((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ ¬ 𝑦 = +∞) ∧ 𝑦 = -∞) → -∞ ∈ ℝ*)
10 ioran 510 . . . . . . . . . . . . . 14 (¬ (𝑥 = +∞ ∨ 𝑥 = -∞) ↔ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞))
11 elxr 11826 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ ℝ* ↔ (𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞))
12 3orass 1034 . . . . . . . . . . . . . . . . . 18 ((𝑥 ∈ ℝ ∨ 𝑥 = +∞ ∨ 𝑥 = -∞) ↔ (𝑥 ∈ ℝ ∨ (𝑥 = +∞ ∨ 𝑥 = -∞)))
1311, 12sylbb 208 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ ℝ* → (𝑥 ∈ ℝ ∨ (𝑥 = +∞ ∨ 𝑥 = -∞)))
1413ord 391 . . . . . . . . . . . . . . . 16 (𝑥 ∈ ℝ* → (¬ 𝑥 ∈ ℝ → (𝑥 = +∞ ∨ 𝑥 = -∞)))
1514con1d 138 . . . . . . . . . . . . . . 15 (𝑥 ∈ ℝ* → (¬ (𝑥 = +∞ ∨ 𝑥 = -∞) → 𝑥 ∈ ℝ))
1615imp 444 . . . . . . . . . . . . . 14 ((𝑥 ∈ ℝ* ∧ ¬ (𝑥 = +∞ ∨ 𝑥 = -∞)) → 𝑥 ∈ ℝ)
1710, 16sylan2br 492 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) → 𝑥 ∈ ℝ)
18 ioran 510 . . . . . . . . . . . . . 14 (¬ (𝑦 = +∞ ∨ 𝑦 = -∞) ↔ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞))
19 elxr 11826 . . . . . . . . . . . . . . . . . 18 (𝑦 ∈ ℝ* ↔ (𝑦 ∈ ℝ ∨ 𝑦 = +∞ ∨ 𝑦 = -∞))
20 3orass 1034 . . . . . . . . . . . . . . . . . 18 ((𝑦 ∈ ℝ ∨ 𝑦 = +∞ ∨ 𝑦 = -∞) ↔ (𝑦 ∈ ℝ ∨ (𝑦 = +∞ ∨ 𝑦 = -∞)))
2119, 20sylbb 208 . . . . . . . . . . . . . . . . 17 (𝑦 ∈ ℝ* → (𝑦 ∈ ℝ ∨ (𝑦 = +∞ ∨ 𝑦 = -∞)))
2221ord 391 . . . . . . . . . . . . . . . 16 (𝑦 ∈ ℝ* → (¬ 𝑦 ∈ ℝ → (𝑦 = +∞ ∨ 𝑦 = -∞)))
2322con1d 138 . . . . . . . . . . . . . . 15 (𝑦 ∈ ℝ* → (¬ (𝑦 = +∞ ∨ 𝑦 = -∞) → 𝑦 ∈ ℝ))
2423imp 444 . . . . . . . . . . . . . 14 ((𝑦 ∈ ℝ* ∧ ¬ (𝑦 = +∞ ∨ 𝑦 = -∞)) → 𝑦 ∈ ℝ)
2518, 24sylan2br 492 . . . . . . . . . . . . 13 ((𝑦 ∈ ℝ* ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞)) → 𝑦 ∈ ℝ)
26 readdcl 9898 . . . . . . . . . . . . 13 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 + 𝑦) ∈ ℝ)
2717, 25, 26syl2an 493 . . . . . . . . . . . 12 (((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ (𝑦 ∈ ℝ* ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞))) → (𝑥 + 𝑦) ∈ ℝ)
2827rexrd 9968 . . . . . . . . . . 11 (((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ (𝑦 ∈ ℝ* ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞))) → (𝑥 + 𝑦) ∈ ℝ*)
2928anassrs 678 . . . . . . . . . 10 ((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ (¬ 𝑦 = +∞ ∧ ¬ 𝑦 = -∞)) → (𝑥 + 𝑦) ∈ ℝ*)
3029anassrs 678 . . . . . . . . 9 (((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ ¬ 𝑦 = +∞) ∧ ¬ 𝑦 = -∞) → (𝑥 + 𝑦) ∈ ℝ*)
319, 30ifclda 4070 . . . . . . . 8 ((((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) ∧ ¬ 𝑦 = +∞) → if(𝑦 = -∞, -∞, (𝑥 + 𝑦)) ∈ ℝ*)
328, 31ifclda 4070 . . . . . . 7 (((𝑥 ∈ ℝ* ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) ∧ 𝑦 ∈ ℝ*) → if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))) ∈ ℝ*)
3332an32s 842 . . . . . 6 (((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ (¬ 𝑥 = +∞ ∧ ¬ 𝑥 = -∞)) → if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))) ∈ ℝ*)
3433anassrs 678 . . . . 5 ((((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ ¬ 𝑥 = +∞) ∧ ¬ 𝑥 = -∞) → if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))) ∈ ℝ*)
357, 34ifclda 4070 . . . 4 (((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) ∧ ¬ 𝑥 = +∞) → if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦)))) ∈ ℝ*)
364, 35ifclda 4070 . . 3 ((𝑥 ∈ ℝ*𝑦 ∈ ℝ*) → if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))) ∈ ℝ*)
3736rgen2a 2960 . 2 𝑥 ∈ ℝ*𝑦 ∈ ℝ* if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))) ∈ ℝ*
38 df-xadd 11823 . . 3 +𝑒 = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))))
3938fmpt2 7126 . 2 (∀𝑥 ∈ ℝ*𝑦 ∈ ℝ* if(𝑥 = +∞, if(𝑦 = -∞, 0, +∞), if(𝑥 = -∞, if(𝑦 = +∞, 0, -∞), if(𝑦 = +∞, +∞, if(𝑦 = -∞, -∞, (𝑥 + 𝑦))))) ∈ ℝ* ↔ +𝑒 :(ℝ* × ℝ*)⟶ℝ*)
4037, 39mpbi 219 1 +𝑒 :(ℝ* × ℝ*)⟶ℝ*
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wo 382  wa 383  w3o 1030   = wceq 1475  wcel 1977  wral 2896  ifcif 4036   × cxp 5036  wf 5800  (class class class)co 6549  cr 9814  0cc0 9815   + caddc 9818  +∞cpnf 9950  -∞cmnf 9951  *cxr 9952   +𝑒 cxad 11820
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-i2m1 9883  ax-1ne0 9884  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-pnf 9955  df-mnf 9956  df-xr 9957  df-xadd 11823
This theorem is referenced by:  xaddcl  11944  xrsadd  19582  xrofsup  28923  xrge0pluscn  29314  xrge0tmdOLD  29319
  Copyright terms: Public domain W3C validator