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

Theorem mulsge0d 28154
Description: The product of two non-negative surreals is non-negative. (Contributed by Scott Fenton, 6-Mar-2025.)
Hypotheses
Ref Expression
mulsge0d.1 (𝜑𝐴 No )
mulsge0d.2 (𝜑𝐵 No )
mulsge0d.3 (𝜑 → 0s ≤s 𝐴)
mulsge0d.4 (𝜑 → 0s ≤s 𝐵)
Assertion
Ref Expression
mulsge0d (𝜑 → 0s ≤s (𝐴 ·s 𝐵))

Proof of Theorem mulsge0d
StepHypRef Expression
1 0no 27817 . . . . 5 0s No
21a1i 11 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s No )
3 mulsge0d.1 . . . . . 6 (𝜑𝐴 No )
4 mulsge0d.2 . . . . . 6 (𝜑𝐵 No )
53, 4mulscld 28143 . . . . 5 (𝜑 → (𝐴 ·s 𝐵) ∈ No )
65ad2antrr 727 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → (𝐴 ·s 𝐵) ∈ No )
73ad2antrr 727 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐴 No )
84ad2antrr 727 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐵 No )
9 simplr 769 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐴)
10 simpr 484 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐵)
117, 8, 9, 10mulsgt0d 28153 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
122, 6, 11ltlesd 27753 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13 lesid 27747 . . . . . 6 ( 0s No → 0s ≤s 0s )
141, 13ax-mp 5 . . . . 5 0s ≤s 0s
15 oveq2 7376 . . . . . . 7 ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
1615adantl 481 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17 muls01 28120 . . . . . . . 8 (𝐴 No → (𝐴 ·s 0s ) = 0s )
183, 17syl 17 . . . . . . 7 (𝜑 → (𝐴 ·s 0s ) = 0s )
1918adantr 480 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = 0s )
2016, 19eqtr3d 2774 . . . . 5 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
2114, 20breqtrrid 5138 . . . 4 ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
2221adantlr 716 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23 mulsge0d.4 . . . . 5 (𝜑 → 0s ≤s 𝐵)
24 lesloe 27734 . . . . . 6 (( 0s No 𝐵 No ) → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
251, 4, 24sylancr 588 . . . . 5 (𝜑 → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
2623, 25mpbid 232 . . . 4 (𝜑 → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2726adantr 480 . . 3 ((𝜑 ∧ 0s <s 𝐴) → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2812, 22, 27mpjaodan 961 . 2 ((𝜑 ∧ 0s <s 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
29 oveq1 7375 . . . . 5 ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
3029adantl 481 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31 muls02 28149 . . . . . 6 (𝐵 No → ( 0s ·s 𝐵) = 0s )
324, 31syl 17 . . . . 5 (𝜑 → ( 0s ·s 𝐵) = 0s )
3332adantr 480 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = 0s )
3430, 33eqtr3d 2774 . . 3 ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
3514, 34breqtrrid 5138 . 2 ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36 mulsge0d.3 . . 3 (𝜑 → 0s ≤s 𝐴)
37 lesloe 27734 . . . 4 (( 0s No 𝐴 No ) → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
381, 3, 37sylancr 588 . . 3 (𝜑 → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
3936, 38mpbid 232 . 2 (𝜑 → ( 0s <s 𝐴 ∨ 0s = 𝐴))
4028, 35, 39mpjaodan 961 1 (𝜑 → 0s ≤s (𝐴 ·s 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848   = wceq 1542  wcel 2114   class class class wbr 5100  (class class class)co 7368   No csur 27619   <s clts 27620   ≤s cles 27724   0s c0s 27813   ·s cmuls 28114
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 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-ot 4591  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-1o 8407  df-2o 8408  df-nadd 8604  df-no 27622  df-lts 27623  df-bday 27624  df-les 27725  df-slts 27766  df-cuts 27768  df-0s 27815  df-made 27835  df-old 27836  df-left 27838  df-right 27839  df-norec 27946  df-norec2 27957  df-adds 27968  df-negs 28029  df-subs 28030  df-muls 28115
This theorem is referenced by:  absmuls  28252  zsoring  28417
  Copyright terms: Public domain W3C validator