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

Theorem xmulf 13406
Description: The extended real multiplication operation is closed in extended reals. (Contributed by Mario Carneiro, 21-Aug-2015.)
Assertion
Ref Expression
xmulf ·e :(ℝ* × ℝ*)⟶ℝ*

Proof of Theorem xmulf
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0xr 11360 . . . . 5 0 ∈ ℝ*
21a1i 11 . . . 4 (((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ (𝑥 = 0 ∨ 𝑦 = 0)) → 0 ∈ ℝ*)
3 pnfxr 11367 . . . . . 6 +∞ ∈ ℝ*
43a1i 11 . . . . 5 ((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) → +∞ ∈ ℝ*)
5 mnfxr 11370 . . . . . . 7 -∞ ∈ ℝ*
65a1i 11 . . . . . 6 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → -∞ ∈ ℝ*)
7 xmullem 13398 . . . . . . . 8 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → 𝑥 ∈ ℝ)
8 ancom 466 . . . . . . . . . . 11 ((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ↔ (𝑦 ∈ ℝ* ∧ 𝑥 ∈ ℝ*))
9 orcom 884 . . . . . . . . . . . 12 ((𝑥 = 0 ∨ 𝑦 = 0) ↔ (𝑦 = 0 ∨ 𝑥 = 0))
109notbii 323 . . . . . . . . . . 11 (¬ (𝑥 = 0 ∨ 𝑦 = 0) ↔ ¬ (𝑦 = 0 ∨ 𝑥 = 0))
118, 10anbi12i 640 . . . . . . . . . 10 (((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ↔ ((𝑦 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ ¬ (𝑦 = 0 ∨ 𝑥 = 0)))
12 orcom 884 . . . . . . . . . . 11 ((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))) ↔ (((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)) ∨ ((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞))))
1312notbii 323 . . . . . . . . . 10 (¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))) ↔ ¬ (((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)) ∨ ((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞))))
1411, 13anbi12i 640 . . . . . . . . 9 ((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ↔ (((𝑦 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ ¬ (𝑦 = 0 ∨ 𝑥 = 0)) ∧ ¬ (((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)) ∨ ((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)))))
15 orcom 884 . . . . . . . . . 10 ((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))) ↔ (((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)) ∨ ((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞))))
1615notbii 323 . . . . . . . . 9 (¬ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))) ↔ ¬ (((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)) ∨ ((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞))))
17 xmullem 13398 . . . . . . . . 9 (((((𝑦 ∈ ℝ* ∧ 𝑥 ∈ ℝ*) ∧ ¬ (𝑦 = 0 ∨ 𝑥 = 0)) ∧ ¬ (((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)) ∨ ((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)))) ∧ ¬ (((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)) ∨ ((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)))) → 𝑦 ∈ ℝ)
1814, 16, 17syl2anb 610 . . . . . . . 8 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → 𝑦 ∈ ℝ)
197, 18remulcld 11343 . . . . . . 7 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → (𝑥 · 𝑦) ∈ ℝ)
2019rexrd 11363 . . . . . 6 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → (𝑥 · 𝑦) ∈ ℝ*)
216, 20ifclda 4517 . . . . 5 ((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) → if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)) ∈ ℝ*)
224, 21ifclda 4517 . . . 4 (((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) → if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦))) ∈ ℝ*)
232, 22ifclda 4517 . . 3 ((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) → if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))) ∈ ℝ*)
2423rgen2 3202 . 2 ∀𝑥 ∈ ℝ* ∀𝑦 ∈ ℝ* if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))) ∈ ℝ*
25 df-xmul 13247 . . 3 ·e = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))))
2625fmpo 8080 . 2 (∀𝑥 ∈ ℝ* ∀𝑦 ∈ ℝ* if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))) ∈ ℝ* ↔ ·e :(ℝ* × ℝ*)⟶ℝ*)
2724, 26mpbi 233 1 ·e :(ℝ* × ℝ*)⟶ℝ*
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ifcif 4481   class class class wbr 5102   × cxp 5648  ⟶wf 6535  (class class class)co 7421  ℝcr 11203  0cc0 11204   · cmul 11209  +∞cpnf 11344  -∞cmnf 11345  ℝ*cxr 11346   < clt 11347   ·e cxmu 13244
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752  ax-cnex 11260  ax-resscn 11261  ax-1cn 11262  ax-addrcl 11265  ax-mulrcl 11267  ax-rnegex 11275  ax-cnre 11277  ax-pre-lttri 11278  ax-pre-lttrn 11279
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-po 5558  df-so 5559  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-oprab 7425  df-mpo 7426  df-1st 8002  df-2nd 8003  df-er 8721  df-en 8978  df-dom 8979  df-sdom 8980  df-pnf 11349  df-mnf 11350  df-xr 11351  df-ltxr 11352  df-xmul 13247
This theorem is used by:  xmulcl  13407  xrsmul  21703
  Copyright terms: Public domain W3C validator