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

Theorem mulsge0d 28339
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 28002 . . . . 5 0s No
21a1i 11 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s No )
3 mulsge0d.1 . . . . . 6 (𝜑𝐴 No )
4 mulsge0d.2 . . . . . 6 (𝜑𝐵 No )
53, 4mulscld 28328 . . . . 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 28338 . . . 4 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
122, 6, 11ltlesd 27937 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13 lesid 27931 . . . . . 6 ( 0s No → 0s ≤s 0s )
141, 13ax-mp 5 . . . . 5 0s ≤s 0s
15 oveq2 7418 . . . . . . 7 ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
1615adantl 486 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17 muls01 28305 . . . . . . . 8 (𝐴 No → (𝐴 ·s 0s ) = 0s )
183, 17syl 18 . . . . . . 7 (𝜑 → (𝐴 ·s 0s ) = 0s )
1918adantr 485 . . . . . 6 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = 0s )
2016, 19eqtr3d 2800 . . . . 5 ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
2114, 20breqtrrid 5149 . . . 4 ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
2221adantlr 727 . . 3 (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23 mulsge0d.4 . . . . 5 (𝜑 → 0s ≤s 𝐵)
24 lesloe 27918 . . . . . 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 7417 . . . . 5 ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
3029adantl 486 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31 muls02 28334 . . . . . 6 (𝐵 No → ( 0s ·s 𝐵) = 0s )
324, 31syl 18 . . . . 5 (𝜑 → ( 0s ·s 𝐵) = 0s )
3332adantr 485 . . . 4 ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = 0s )
3430, 33eqtr3d 2800 . . 3 ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
3514, 34breqtrrid 5149 . 2 ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36 mulsge0d.3 . . 3 (𝜑 → 0s ≤s 𝐴)
37 lesloe 27918 . . . 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 1570  wcel 2143   class class class wbr 5109  (class class class)co 7410   No csur 27804   <s clts 27805   ≤s cles 27908   0s c0s 27998   ·s cmuls 28299
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-ot 4598  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  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 27807  df-lts 27808  df-bday 27809  df-les 27909  df-slts 27951  df-cuts 27953  df-0s 28000  df-made 28020  df-old 28021  df-left 28023  df-right 28024  df-norec 28131  df-norec2 28142  df-adds 28153  df-negs 28214  df-subs 28215  df-muls 28300
This theorem is referenced by:  absmuls  28437  zsoring  28602
  Copyright terms: Public domain W3C validator