Theorem mulsge0d 28532

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 28195	. . . . 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 28521	. . . . 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 28531	. . . 4 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
12	2, 6, 11	ltlesd 28130	. . 3 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13		lesid 28124	. . . . . 6 ⊢ ( 0s ∈ No → 0s ≤s 0s )
14	1, 13	ax-mp 5	. . . . 5 ⊢ 0s ≤s 0s
15		oveq2 7428	. . . . . . 7 ⊢ ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
16	15	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17		muls01 28498	. . . . . . . 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 2797	. . . . 5 ⊢ ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
21	14, 20	breqtrrid 5142	. . . 4 ⊢ ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
22	21	adantlr 728	. . 3 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23		mulsge0d.4	. . . . 5 ⊢ (𝜑 → 0s ≤s 𝐵)
24		lesloe 28111	. . . . . 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 7427	. . . . 5 ⊢ ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
30	29	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31		muls02 28527	. . . . . 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 2797	. . 3 ⊢ ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
35	14, 34	breqtrrid 5142	. 2 ⊢ ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36		mulsge0d.3	. . 3 ⊢ (𝜑 → 0s ≤s 𝐴)
37		lesloe 28111	. . . 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 1569   ∈ wcel 2144   class class class wbr 5102  (class class class)co 7420  Nocsur 27997   <s clts 27998   ≤s cles 28101   0_s c0s 28191   ·_s cmuls 28492

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-ot 4592  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-1o 8476  df-2o 8477  df-nadd 8675  df-no 28000  df-lts 28001  df-bday 28002  df-les 28102  df-slts 28144  df-cuts 28146  df-0s 28193  df-made 28213  df-old 28214  df-left 28216  df-right 28217  df-norec 28324  df-norec2 28335  df-adds 28346  df-negs 28407  df-subs 28408  df-muls 28493

This theorem is used by:  absmuls  28630  zsoring  28795