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

Theorem mulsge0d 28156
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 27819 . . . . 5 0s No
21a1i 11 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s No )
3 mulsge0d.1 . . . . . 6 (𝜑𝐴 No )
4 mulsge0d.2 . . . . . 6 (𝜑𝐵 No )
53, 4mulscld 28145 . . . . 5 (𝜑 → (𝐴 ·s 𝐵) ∈ No )
65ad2antrr 732 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → (𝐴 ·s 𝐵) ∈ No )
73ad2antrr 732 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐴 No )
84ad2antrr 732 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐵 No )
9 simplr 774 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐴)
10 simpr 485 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐵)
117, 8, 9, 10mulsgt0d 28155 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
122, 6, 11ltlesd 27755 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13 lesid 27749 . . . . . 6 ( 0s No → 0s ≤s 0s )
141, 13ax-mp 5 . . . . 5 0s ≤s 0s
15 oveq2 7364 . . . . . . 7 ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
1615adantl 482 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17 muls01 28122 . . . . . . . 8 (𝐴 No → (𝐴 ·s 0s ) = 0s )
183, 17syl 17 . . . . . . 7 (𝜑 → (𝐴 ·s 0s ) = 0s )
1918adantr 481 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = 0s )
2016, 19eqtr3d 2776 . . . . 5 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
2114, 20breqtrrid 5110 . . . 4 ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
2221adantlr 721 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23 mulsge0d.4 . . . . 5 (𝜑 → 0s ≤s 𝐵)
24 lesloe 27736 . . . . . 6 (( 0s No 𝐵 No ) → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
251, 4, 24sylancr 593 . . . . 5 (𝜑 → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
2623, 25mpbid 233 . . . 4 (𝜑 → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2726adantr 481 . . 3 ((𝜑 ∧ 0s <s 𝐴) → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2812, 22, 27mpjaodan 966 . 2 ((𝜑 ∧ 0s <s 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
29 oveq1 7363 . . . . 5 ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
3029adantl 482 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31 muls02 28151 . . . . . 6 (𝐵 No → ( 0s ·s 𝐵) = 0s )
324, 31syl 17 . . . . 5 (𝜑 → ( 0s ·s 𝐵) = 0s )
3332adantr 481 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = 0s )
3430, 33eqtr3d 2776 . . 3 ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
3514, 34breqtrrid 5110 . 2 ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36 mulsge0d.3 . . 3 (𝜑 → 0s ≤s 𝐴)
37 lesloe 27736 . . . 4 (( 0s No 𝐴 No ) → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
381, 3, 37sylancr 593 . . 3 (𝜑 → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
3936, 38mpbid 233 . 2 (𝜑 → ( 0s <s 𝐴 ∨ 0s = 𝐴))
4028, 35, 39mpjaodan 966 1 (𝜑 → 0s ≤s (𝐴 ·s 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wo 853   = wceq 1547  wcel 2119   class class class wbr 5072  (class class class)co 7356   No csur 27621   <s clts 27622   ≤s cles 27726   0s c0s 27815   ·s cmuls 28116
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-ot 4564  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-se 5572  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-1o 8395  df-2o 8396  df-nadd 8592  df-no 27624  df-lts 27625  df-bday 27626  df-les 27727  df-slts 27768  df-cuts 27770  df-0s 27817  df-made 27837  df-old 27838  df-left 27840  df-right 27841  df-norec 27948  df-norec2 27959  df-adds 27970  df-negs 28031  df-subs 28032  df-muls 28117
This theorem is referenced by:  absmuls  28254  zsoring  28419
  Copyright terms: Public domain W3C validator