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

Theorem mulsge0d 28301
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 27964 . . . . 5 0s No
21a1i 11 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s No )
3 mulsge0d.1 . . . . . 6 (𝜑𝐴 No )
4 mulsge0d.2 . . . . . 6 (𝜑𝐵 No )
53, 4mulscld 28290 . . . . 5 (𝜑 → (𝐴 ·s 𝐵) ∈ No )
65ad2antrr 738 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → (𝐴 ·s 𝐵) ∈ No )
73ad2antrr 738 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐴 No )
84ad2antrr 738 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐵 No )
9 simplr 780 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐴)
10 simpr 489 . . . . 5 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐵)
117, 8, 9, 10mulsgt0d 28300 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
122, 6, 11ltlesd 27899 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13 lesid 27893 . . . . . 6 ( 0s No → 0s ≤s 0s )
141, 13ax-mp 5 . . . . 5 0s ≤s 0s
15 oveq2 7416 . . . . . . 7 ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
1615adantl 486 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17 muls01 28267 . . . . . . . 8 (𝐴 No → (𝐴 ·s 0s ) = 0s )
183, 17syl 18 . . . . . . 7 (𝜑 → (𝐴 ·s 0s ) = 0s )
1918adantr 485 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = 0s )
2016, 19eqtr3d 2806 . . . . 5 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
2114, 20breqtrrid 5150 . . . 4 ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
2221adantlr 727 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23 mulsge0d.4 . . . . 5 (𝜑 → 0s ≤s 𝐵)
24 lesloe 27880 . . . . . 6 (( 0s No 𝐵 No ) → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
251, 4, 24sylancr 598 . . . . 5 (𝜑 → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
2623, 25mpbid 235 . . . 4 (𝜑 → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2726adantr 485 . . 3 ((𝜑 ∧ 0s <s 𝐴) → ( 0s <s 𝐵 ∨ 0s = 𝐵))
2812, 22, 27mpjaodan 973 . 2 ((𝜑 ∧ 0s <s 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
29 oveq1 7415 . . . . 5 ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
3029adantl 486 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31 muls02 28296 . . . . . 6 (𝐵 No → ( 0s ·s 𝐵) = 0s )
324, 31syl 18 . . . . 5 (𝜑 → ( 0s ·s 𝐵) = 0s )
3332adantr 485 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = 0s )
3430, 33eqtr3d 2806 . . 3 ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
3514, 34breqtrrid 5150 . 2 ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36 mulsge0d.3 . . 3 (𝜑 → 0s ≤s 𝐴)
37 lesloe 27880 . . . 4 (( 0s No 𝐴 No ) → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
381, 3, 37sylancr 598 . . 3 (𝜑 → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
3936, 38mpbid 235 . 2 (𝜑 → ( 0s <s 𝐴 ∨ 0s = 𝐴))
4028, 35, 39mpjaodan 973 1 (𝜑 → 0s ≤s (𝐴 ·s 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wo 860   = wceq 1567  wcel 2149   class class class wbr 5110  (class class class)co 7408   No csur 27766   <s clts 27767   ≤s cles 27870   0s c0s 27960   ·s cmuls 28261
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-ot 4600  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6299  df-ord 6360  df-on 6361  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-1o 8449  df-2o 8450  df-nadd 8648  df-no 27769  df-lts 27770  df-bday 27771  df-les 27871  df-slts 27913  df-cuts 27915  df-0s 27962  df-made 27982  df-old 27983  df-left 27985  df-right 27986  df-norec 28093  df-norec2 28104  df-adds 28115  df-negs 28176  df-subs 28177  df-muls 28262
This theorem is referenced by:  absmuls  28399  zsoring  28564
  Copyright terms: Public domain W3C validator