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

Theorem xmulval 13242
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 487 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑥 = 𝐴)
21eqeq1d 2767 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = 0 ↔ 𝐴 = 0))
3 simpr 489 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → 𝑦 = 𝐵)
43eqeq1d 2767 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = 0 ↔ 𝐵 = 0))
52, 4orbi12d 931 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥 = 0 ∨ 𝑦 = 0) ↔ (𝐴 = 0 ∨ 𝐵 = 0)))
63breq2d 5117 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (0 < 𝑦 ↔ 0 < 𝐵))
71eqeq1d 2767 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = +∞ ↔ 𝐴 = +∞))
86, 7anbi12d 643 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑦𝑥 = +∞) ↔ (0 < 𝐵𝐴 = +∞)))
93breq1d 5115 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 < 0 ↔ 𝐵 < 0))
101eqeq1d 2767 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 = -∞ ↔ 𝐴 = -∞))
119, 10anbi12d 643 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑦 < 0 ∧ 𝑥 = -∞) ↔ (𝐵 < 0 ∧ 𝐴 = -∞)))
128, 11orbi12d 931 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ↔ ((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞))))
131breq2d 5117 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (0 < 𝑥 ↔ 0 < 𝐴))
143eqeq1d 2767 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = +∞ ↔ 𝐵 = +∞))
1513, 14anbi12d 643 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑥𝑦 = +∞) ↔ (0 < 𝐴𝐵 = +∞)))
161breq1d 5115 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 < 0 ↔ 𝐴 < 0))
173eqeq1d 2767 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑦 = -∞ ↔ 𝐵 = -∞))
1816, 17anbi12d 643 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥 < 0 ∧ 𝑦 = -∞) ↔ (𝐴 < 0 ∧ 𝐵 = -∞)))
1915, 18orbi12d 931 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)) ↔ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))))
2012, 19orbi12d 931 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → ((((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))) ↔ (((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞)))))
216, 10anbi12d 643 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑦𝑥 = -∞) ↔ (0 < 𝐵𝐴 = -∞)))
229, 7anbi12d 643 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑦 < 0 ∧ 𝑥 = +∞) ↔ (𝐵 < 0 ∧ 𝐴 = +∞)))
2321, 22orbi12d 931 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ↔ ((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞))))
2413, 17anbi12d 643 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((0 < 𝑥𝑦 = -∞) ↔ (0 < 𝐴𝐵 = -∞)))
2516, 14anbi12d 643 . . . . . . 7 ((𝑥 = 𝐴𝑦 = 𝐵) → ((𝑥 < 0 ∧ 𝑦 = +∞) ↔ (𝐴 < 0 ∧ 𝐵 = +∞)))
2624, 25orbi12d 931 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐵) → (((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)) ↔ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))))
2723, 26orbi12d 931 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → ((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))) ↔ (((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞)))))
28 oveq12 7409 . . . . 5 ((𝑥 = 𝐴𝑦 = 𝐵) → (𝑥 · 𝑦) = (𝐴 · 𝐵))
2927, 28ifbieq2d 4510 . . . 4 ((𝑥 = 𝐴𝑦 = 𝐵) → if((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)) = if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)))
3020, 29ifbieq2d 4510 . . 3 ((𝑥 = 𝐴𝑦 = 𝐵) → if((((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦))) = if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵))))
315, 30ifbieq2d 4510 . 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 13130 . 2 ·e = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))))
33 c0ex 11188 . . 3 0 ∈ V
34 pnfex 11250 . . . 4 +∞ ∈ V
35 mnfxr 11254 . . . . . 6 -∞ ∈ ℝ*
3635elexi 3479 . . . . 5 -∞ ∈ V
37 ovex 7433 . . . . 5 (𝐴 · 𝐵) ∈ V
3836, 37ifex 4534 . . . 4 if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)) ∈ V
3934, 38ifex 4534 . . 3 if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵))) ∈ V
4033, 39ifex 4534 . 2 if((𝐴 = 0 ∨ 𝐵 = 0), 0, if((((0 < 𝐵𝐴 = +∞) ∨ (𝐵 < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴𝐵 = +∞) ∨ (𝐴 < 0 ∧ 𝐵 = -∞))), +∞, if((((0 < 𝐵𝐴 = -∞) ∨ (𝐵 < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴𝐵 = -∞) ∨ (𝐴 < 0 ∧ 𝐵 = +∞))), -∞, (𝐴 · 𝐵)))) ∈ V
4131, 32, 40ovmpoa 7555 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 400  wo 860   = wceq 1563  wcel 2145  ifcif 4483   class class class wbr 5105  (class class class)co 7400  0cc0 11088   · cmul 11093  +∞cpnf 11228  -∞cmnf 11229  *cxr 11230   < clt 11231   ·e cxmu 13127
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-cnex 11144  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-mulcl 11150  ax-i2m1 11156
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-iota 6481  df-fun 6527  df-fv 6533  df-ov 7403  df-oprab 7404  df-mpo 7405  df-pnf 11233  df-mnf 11234  df-xr 11235  df-xmul 13130
This theorem is referenced by:  xmulcom  13283  xmul01  13284  xmulneg1  13286  rexmul  13288  xmulpnf1  13291
  Copyright terms: Public domain W3C validator