Theorem mulsge0d 28589

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

Step	Hyp	Ref	Expression
1		0no 28252	. . . . 5 ⊢ 0s ∈ No
2	1	a1i 11	. . . 4 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ∈ No)
3		mulsge0d.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ No)
4		mulsge0d.2	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ No)
5	3, 4	mulscld 28578	. . . . 5 ⊢ (𝜑 → (𝐴 ·s 𝐵) ∈ No)
6	5	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → (𝐴 ·s 𝐵) ∈ No)
7	3	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐴 ∈ No)
8	4	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 𝐵 ∈ No)
9		simplr 781	. . . . 5 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐴)
10		simpr 490	. . . . 5 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s 𝐵)
11	7, 8, 9, 10	mulsgt0d 28588	. . . 4 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
12	2, 6, 11	ltlesd 28187	. . 3 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13		lesid 28181	. . . . . 6 ⊢ ( 0s ∈ No → 0s ≤s 0s )
14	1, 13	ax-mp 5	. . . . 5 ⊢ 0s ≤s 0s
15		oveq2 7459	. . . . . . 7 ⊢ ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
16	15	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17		muls01 28555	. . . . . . . 8 ⊢ (𝐴 ∈ No → (𝐴 ·s 0s ) = 0s )
18	3, 17	syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐴 ·s 0s ) = 0s )
19	18	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = 0s )
20	16, 19	eqtr3d 2800	. . . . 5 ⊢ ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
21	14, 20	breqtrrid 5149	. . . 4 ⊢ ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
22	21	adantlr 728	. . 3 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23		mulsge0d.4	. . . . 5 ⊢ (𝜑 → 0s ≤s 𝐵)
24		lesloe 28168	. . . . . 6 ⊢ (( 0s ∈ No ∧ 𝐵 ∈ No) → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
25	1, 4, 24	sylancr 599	. . . . 5 ⊢ (𝜑 → ( 0s ≤s 𝐵 ↔ ( 0s <s 𝐵 ∨ 0s = 𝐵)))
26	23, 25	mpbid 235	. . . 4 ⊢ (𝜑 → ( 0s <s 𝐵 ∨ 0s = 𝐵))
27	26	adantr 486	. . 3 ⊢ ((𝜑 ∧ 0s <s 𝐴) → ( 0s <s 𝐵 ∨ 0s = 𝐵))
28	12, 22, 27	mpjaodan 973	. 2 ⊢ ((𝜑 ∧ 0s <s 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
29		oveq1 7458	. . . . 5 ⊢ ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
30	29	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31		muls02 28584	. . . . . 6 ⊢ (𝐵 ∈ No → ( 0s ·s 𝐵) = 0s )
32	4, 31	syl 18	. . . . 5 ⊢ (𝜑 → ( 0s ·s 𝐵) = 0s )
33	32	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = 0s )
34	30, 33	eqtr3d 2800	. . 3 ⊢ ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
35	14, 34	breqtrrid 5149	. 2 ⊢ ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36		mulsge0d.3	. . 3 ⊢ (𝜑 → 0s ≤s 𝐴)
37		lesloe 28168	. . . 4 ⊢ (( 0s ∈ No ∧ 𝐴 ∈ No) → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
38	1, 3, 37	sylancr 599	. . 3 ⊢ (𝜑 → ( 0s ≤s 𝐴 ↔ ( 0s <s 𝐴 ∨ 0s = 𝐴)))
39	36, 38	mpbid 235	. 2 ⊢ (𝜑 → ( 0s <s 𝐴 ∨ 0s = 𝐴))
40	28, 35, 39	mpjaodan 973	1 ⊢ (𝜑 → 0s ≤s (𝐴 ·s 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147   class class class wbr 5108  (class class class)co 7451  Nocsur 28054   <s clts 28055   ≤s cles 28158   0_s c0s 28248   ·_s cmuls 28549

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4841  df-ot 4864  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-1o 8514  df-2o 8515  df-nadd 8713  df-no 28057  df-lts 28058  df-bday 28059  df-les 28159  df-slts 28201  df-cuts 28203  df-0s 28250  df-made 28270  df-old 28271  df-left 28273  df-right 28274  df-norec 28381  df-norec2 28392  df-adds 28403  df-negs 28464  df-subs 28465  df-muls 28550

This theorem is used by:  absmuls  28687  zsoring  28852