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

Theorem xmulpnf1 12645
Description: Multiplication by plus infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xmulpnf1 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e +∞) = +∞)

Proof of Theorem xmulpnf1
StepHypRef Expression
1 pnfxr 10672 . . . 4 +∞ ∈ ℝ*
2 xmulval 12596 . . . 4 ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 ·e +∞) = if((𝐴 = 0 ∨ +∞ = 0), 0, if((((0 < +∞ ∧ 𝐴 = +∞) ∨ (+∞ < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞))), +∞, if((((0 < +∞ ∧ 𝐴 = -∞) ∨ (+∞ < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴 ∧ +∞ = -∞) ∨ (𝐴 < 0 ∧ +∞ = +∞))), -∞, (𝐴 · +∞)))))
31, 2mpan2 690 . . 3 (𝐴 ∈ ℝ* → (𝐴 ·e +∞) = if((𝐴 = 0 ∨ +∞ = 0), 0, if((((0 < +∞ ∧ 𝐴 = +∞) ∨ (+∞ < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞))), +∞, if((((0 < +∞ ∧ 𝐴 = -∞) ∨ (+∞ < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴 ∧ +∞ = -∞) ∨ (𝐴 < 0 ∧ +∞ = +∞))), -∞, (𝐴 · +∞)))))
43adantr 484 . 2 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e +∞) = if((𝐴 = 0 ∨ +∞ = 0), 0, if((((0 < +∞ ∧ 𝐴 = +∞) ∨ (+∞ < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞))), +∞, if((((0 < +∞ ∧ 𝐴 = -∞) ∨ (+∞ < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴 ∧ +∞ = -∞) ∨ (𝐴 < 0 ∧ +∞ = +∞))), -∞, (𝐴 · +∞)))))
5 0xr 10665 . . . . 5 0 ∈ ℝ*
6 xrltne 12534 . . . . 5 ((0 ∈ ℝ*𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 𝐴 ≠ 0)
75, 6mp3an1 1445 . . . 4 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 𝐴 ≠ 0)
8 0re 10620 . . . . . 6 0 ∈ ℝ
9 renepnf 10666 . . . . . 6 (0 ∈ ℝ → 0 ≠ +∞)
108, 9ax-mp 5 . . . . 5 0 ≠ +∞
1110necomi 3061 . . . 4 +∞ ≠ 0
12 neanior 3099 . . . 4 ((𝐴 ≠ 0 ∧ +∞ ≠ 0) ↔ ¬ (𝐴 = 0 ∨ +∞ = 0))
137, 11, 12sylanblc 592 . . 3 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → ¬ (𝐴 = 0 ∨ +∞ = 0))
1413iffalsed 4451 . 2 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → if((𝐴 = 0 ∨ +∞ = 0), 0, if((((0 < +∞ ∧ 𝐴 = +∞) ∨ (+∞ < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞))), +∞, if((((0 < +∞ ∧ 𝐴 = -∞) ∨ (+∞ < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴 ∧ +∞ = -∞) ∨ (𝐴 < 0 ∧ +∞ = +∞))), -∞, (𝐴 · +∞)))) = if((((0 < +∞ ∧ 𝐴 = +∞) ∨ (+∞ < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞))), +∞, if((((0 < +∞ ∧ 𝐴 = -∞) ∨ (+∞ < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴 ∧ +∞ = -∞) ∨ (𝐴 < 0 ∧ +∞ = +∞))), -∞, (𝐴 · +∞))))
15 simpr 488 . . . . . 6 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 0 < 𝐴)
16 eqid 2821 . . . . . 6 +∞ = +∞
1715, 16jctir 524 . . . . 5 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (0 < 𝐴 ∧ +∞ = +∞))
1817orcd 870 . . . 4 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞)))
1918olcd 871 . . 3 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (((0 < +∞ ∧ 𝐴 = +∞) ∨ (+∞ < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞))))
2019iftrued 4448 . 2 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → if((((0 < +∞ ∧ 𝐴 = +∞) ∨ (+∞ < 0 ∧ 𝐴 = -∞)) ∨ ((0 < 𝐴 ∧ +∞ = +∞) ∨ (𝐴 < 0 ∧ +∞ = -∞))), +∞, if((((0 < +∞ ∧ 𝐴 = -∞) ∨ (+∞ < 0 ∧ 𝐴 = +∞)) ∨ ((0 < 𝐴 ∧ +∞ = -∞) ∨ (𝐴 < 0 ∧ +∞ = +∞))), -∞, (𝐴 · +∞))) = +∞)
214, 14, 203eqtrd 2860 1 ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e +∞) = +∞)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399  wo 844   = wceq 1538  wcel 2115  wne 3007  ifcif 4440   class class class wbr 5039  (class class class)co 7130  cr 10513  0cc0 10514   · cmul 10519  +∞cpnf 10649  -∞cmnf 10650  *cxr 10651   < clt 10652   ·e cxmu 12484
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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436  ax-cnex 10570  ax-resscn 10571  ax-1cn 10572  ax-icn 10573  ax-addcl 10574  ax-addrcl 10575  ax-mulcl 10576  ax-i2m1 10582  ax-rnegex 10585  ax-cnre 10587  ax-pre-lttri 10588  ax-pre-lttrn 10589
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-nel 3112  df-ral 3131  df-rex 3132  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-op 4547  df-uni 4812  df-br 5040  df-opab 5102  df-mpt 5120  df-id 5433  df-po 5447  df-so 5448  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-ov 7133  df-oprab 7134  df-mpo 7135  df-er 8264  df-en 8485  df-dom 8486  df-sdom 8487  df-pnf 10654  df-mnf 10655  df-xr 10656  df-ltxr 10657  df-xmul 12487
This theorem is referenced by:  xmulpnf2  12646  xmulmnf1  12647  xmulpnf1n  12649  xmulgt0  12654  xmulasslem3  12657  xlemul1a  12659  xadddilem  12665  nn0xmulclb  30482  hashxpe  30515  xdivpnfrp  30595  xrge0adddir  30686  esumcst  31329  esumpinfval  31339
  Copyright terms: Public domain W3C validator