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

Theorem mulsge0d 28227
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 27890 . . . . 5 0s No
21a1i 11 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s No )
3 mulsge0d.1 . . . . . 6 (𝜑𝐴 No )
4 mulsge0d.2 . . . . . 6 (𝜑𝐵 No )
53, 4mulscld 28216 . . . . 5 (𝜑 → (𝐴 ·s 𝐵) ∈ No )
65ad2antrr 736 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → (𝐴 ·s 𝐵) ∈ No )
73ad2antrr 736 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐴 No )
84ad2antrr 736 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐵 No )
9 simplr 778 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐴)
10 simpr 488 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐵)
117, 8, 9, 10mulsgt0d 28226 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
122, 6, 11ltlesd 27825 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13 lesid 27819 . . . . . 6 ( 0s No → 0s ≤s 0s )
141, 13ax-mp 5 . . . . 5 0s ≤s 0s
15 oveq2 7399 . . . . . . 7 ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
1615adantl 485 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17 muls01 28193 . . . . . . . 8 (𝐴 No → (𝐴 ·s 0s ) = 0s )
183, 17syl 17 . . . . . . 7 (𝜑 → (𝐴 ·s 0s ) = 0s )
1918adantr 484 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = 0s )
2016, 19eqtr3d 2798 . . . . 5 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
2114, 20breqtrrid 5135 . . . 4 ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
2221adantlr 725 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23 mulsge0d.4 . . . . 5 (𝜑 → 0s ≤s 𝐵)
24 lesloe 27806 . . . . . 6 (( 0s No 𝐵 No ) → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
251, 4, 24sylancr 596 . . . . 5 (𝜑 → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
2623, 25mpbid 234 . . . 4 (𝜑 → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2726adantr 484 . . 3 ((𝜑 ∧ 0s <s 𝐴) → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2812, 22, 27mpjaodan 971 . 2 ((𝜑 ∧ 0s <s 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
29 oveq1 7398 . . . . 5 ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
3029adantl 485 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31 muls02 28222 . . . . . 6 (𝐵 No → ( 0s ·s 𝐵) = 0s )
324, 31syl 17 . . . . 5 (𝜑 → ( 0s ·s 𝐵) = 0s )
3332adantr 484 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = 0s )
3430, 33eqtr3d 2798 . . 3 ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
3514, 34breqtrrid 5135 . 2 ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36 mulsge0d.3 . . 3 (𝜑 → 0s ≤s 𝐴)
37 lesloe 27806 . . . 4 (( 0s No 𝐴 No ) → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
381, 3, 37sylancr 596 . . 3 (𝜑 → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
3936, 38mpbid 234 . 2 (𝜑 → ( 0s <s 𝐴 ∨ 0s = 𝐴))
4028, 35, 39mpjaodan 971 1 (𝜑 → 0s ≤s (𝐴 ·s 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  wo 858   = wceq 1559  wcel 2141   class class class wbr 5097  (class class class)co 7391   No csur 27692   <s clts 27693   ≤s cles 27796   0s c0s 27886   ·s cmuls 28187
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-ot 4588  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-se 5597  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-riota 7348  df-ov 7394  df-oprab 7395  df-mpo 7396  df-1st 7965  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-recs 8336  df-1o 8431  df-2o 8432  df-nadd 8630  df-no 27695  df-lts 27696  df-bday 27697  df-les 27797  df-slts 27839  df-cuts 27841  df-0s 27888  df-made 27908  df-old 27909  df-left 27911  df-right 27912  df-norec 28019  df-norec2 28030  df-adds 28041  df-negs 28102  df-subs 28103  df-muls 28188
This theorem is referenced by:  absmuls  28325  zsoring  28490
  Copyright terms: Public domain W3C validator