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

Theorem xmulf 13440
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 11393 . . . . 5 0 ∈ ℝ*
21a1i 11 . . . 4 (((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ (𝑥 = 0 ∨ 𝑦 = 0)) → 0 ∈ ℝ*)
3 pnfxr 11400 . . . . . 6 +∞ ∈ ℝ*
43a1i 11 . . . . 5 ((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) → +∞ ∈ ℝ*)
5 mnfxr 11403 . . . . . . 7 -∞ ∈ ℝ*
65a1i 11 . . . . . 6 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → -∞ ∈ ℝ*)
7 xmullem 13432 . . . . . . . 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 13432 . . . . . . . . 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 11376 . . . . . . 7 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → (𝑥 · 𝑦) ∈ ℝ)
2019rexrd 11396 . . . . . 6 (((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞)))) → (𝑥 · 𝑦) ∈ ℝ*)
216, 20ifclda 4521 . . . . 5 ((((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) ∧ ¬ (((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞)))) → if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)) ∈ ℝ*)
224, 21ifclda 4521 . . . 4 (((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) ∧ ¬ (𝑥 = 0 ∨ 𝑦 = 0)) → if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦))) ∈ ℝ*)
232, 22ifclda 4521 . . 3 ((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ*) → if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))) ∈ ℝ*)
2423rgen2 3206 . 2 ∀𝑥 ∈ ℝ* ∀𝑦 ∈ ℝ* if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))) ∈ ℝ*
25 df-xmul 13281 . . 3 ·e = (𝑥 ∈ ℝ*, 𝑦 ∈ ℝ* ↦ if((𝑥 = 0 ∨ 𝑦 = 0), 0, if((((0 < 𝑦 ∧ 𝑥 = +∞) ∨ (𝑦 < 0 ∧ 𝑥 = -∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = +∞) ∨ (𝑥 < 0 ∧ 𝑦 = -∞))), +∞, if((((0 < 𝑦 ∧ 𝑥 = -∞) ∨ (𝑦 < 0 ∧ 𝑥 = +∞)) ∨ ((0 < 𝑥 ∧ 𝑦 = -∞) ∨ (𝑥 < 0 ∧ 𝑦 = +∞))), -∞, (𝑥 · 𝑦)))))
2625fmpo 8112 . 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 1570   ∈ wcel 2147  ∀wral 3080  ifcif 4485   class class class wbr 5106   × cxp 5654  ⟶wf 6560  (class class class)co 7449  ℝcr 11236  0cc0 11237   · cmul 11242  +∞cpnf 11377  -∞cmnf 11378  ℝ*cxr 11379   < clt 11380   ·e cxmu 13278
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781  ax-cnex 11293  ax-resscn 11294  ax-1cn 11295  ax-addrcl 11298  ax-mulrcl 11300  ax-rnegex 11308  ax-cnre 11310  ax-pre-lttri 11311  ax-pre-lttrn 11312
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-po 5564  df-so 5565  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-oprab 7453  df-mpo 7454  df-1st 8033  df-2nd 8034  df-er 8753  df-en 9010  df-dom 9011  df-sdom 9012  df-pnf 11382  df-mnf 11383  df-xr 11384  df-ltxr 11385  df-xmul 13281
This theorem is used by:  xmulcl  13441  xrsmul  21739
  Copyright terms: Public domain W3C validator