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

Theorem xmulval 12606
Description: Value of the extended real multiplication operation. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xmulval ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐴 ·e 𝐵) = if((𝐴 = 0 ∨ 𝐵 = 0), 0, if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)))))

Proof of Theorem xmulval
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 486 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑥 = 𝐴)
21eqeq1d 2824 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = 0 ↔ 𝐴 = 0))
3 simpr 488 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑦 = 𝐵)
43eqeq1d 2824 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = 0 ↔ 𝐵 = 0))
52, 4orbi12d 916 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥 = 0 ∨ 𝑦 = 0) ↔ (𝐴 = 0 ∨ 𝐵 = 0)))
63breq2d 5054 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (0 < 𝑦 ↔ 0 < 𝐵))
71eqeq1d 2824 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = +∞ ↔ 𝐴 = +∞))
86, 7anbi12d 633 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑦𝑥 = +∞) ↔ (0 < 𝐵𝐴 = +∞)))
93breq1d 5052 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 < 0 ↔ 𝐵 < 0))
101eqeq1d 2824 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = -∞ ↔ 𝐴 = -∞))
119, 10anbi12d 633 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑦 < 0 ∧ 𝑥 = -∞) ↔ (𝐵 < 0 ∧ 𝐴 = -∞)))
128, 11orbi12d 916 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ↔ ((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞))))
131breq2d 5054 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (0 < 𝑥 ↔ 0 < 𝐴))
143eqeq1d 2824 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = +∞ ↔ 𝐵 = +∞))
1513, 14anbi12d 633 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑥𝑦 = +∞) ↔ (0 < 𝐴𝐵 = +∞)))
161breq1d 5052 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 < 0 ↔ 𝐴 < 0))
173eqeq1d 2824 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = -∞ ↔ 𝐵 = -∞))
1816, 17anbi12d 633 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥 < 0 ∧ 𝑦 = -∞) ↔ (𝐴 < 0 ∧ 𝐵 = -∞)))
1915, 18orbi12d 916 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)) ↔ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))))
2012, 19orbi12d 916 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → ((((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))) ↔ (((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞)))))
216, 10anbi12d 633 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑦𝑥 = -∞) ↔ (0 < 𝐵𝐴 = -∞)))
229, 7anbi12d 633 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑦 < 0 ∧ 𝑥 = +∞) ↔ (𝐵 < 0 ∧ 𝐴 = +∞)))
2321, 22orbi12d 916 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ↔ ((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞))))
2413, 17anbi12d 633 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑥𝑦 = -∞) ↔ (0 < 𝐴𝐵 = -∞)))
2516, 14anbi12d 633 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥 < 0 ∧ 𝑦 = +∞) ↔ (𝐴 < 0 ∧ 𝐵 = +∞)))
2624, 25orbi12d 916 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)) ↔ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))))
2723, 26orbi12d 916 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → ((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))) ↔ (((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞)))))
28 oveq12 7149 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 · 𝑦) = (𝐴 · 𝐵))
2927, 28ifbieq2d 4464 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → if((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)) = if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)))
3020, 29ifbieq2d 4464 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → if((((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦))) = if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵))))
315, 30ifbieq2d 4464 . 2 ((𝑥 = 𝐴𝑦 = 𝐵) → if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))) = if((𝐴 = 0 ∨ 𝐵 = 0), 0, if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)))))
32 df-xmul 12497 . 2 ·e = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))))
33 c0ex 10624 . . 3 0 ∈ V
34 pnfex 10683 . . . 4 +∞ ∈ V
35 mnfxr 10687 . . . . . 6 -∞ ∈ ℝ*
3635elexi 3488 . . . . 5 -∞ ∈ V
37 ovex 7173 . . . . 5 (𝐴 · 𝐵) ∈ V
3836, 37ifex 4487 . . . 4 if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)) ∈ V
3934, 38ifex 4487 . . 3 if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵))) ∈ V
4033, 39ifex 4487 . 2 if((𝐴 = 0 ∨ 𝐵 = 0), 0, if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)))) ∈ V
4131, 32, 40ovmpoa 7289 1 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐴 ·e 𝐵) = if((𝐴 = 0 ∨ 𝐵 = 0), 0, if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wo 844   = wceq 1538  wcel 2114  ifcif 4439   class class class wbr 5042  (class class class)co 7140  0cc0 10526   · cmul 10531  +∞cpnf 10661  -∞cmnf 10662  *cxr 10663   < clt 10664   ·e cxmu 12494
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446  ax-cnex 10582  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-mulcl 10588  ax-i2m1 10594
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-pw 4513  df-sn 4540  df-pr 4542  df-op 4546  df-uni 4814  df-br 5043  df-opab 5105  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-iota 6293  df-fun 6336  df-fv 6342  df-ov 7143  df-oprab 7144  df-mpo 7145  df-pnf 10666  df-mnf 10667  df-xr 10668  df-xmul 12497
This theorem is referenced by:  xmulcom  12647  xmul01  12648  xmulneg1  12650  rexmul  12652  xmulpnf1  12655
  Copyright terms: Public domain W3C validator