Theorem mulsge0d 28525

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 28188	. . . . 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 28514	. . . . 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 28524	. . . 4 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s <s (𝐴 ·s 𝐵))
12	2, 6, 11	ltlesd 28123	. . 3 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s <s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
13		lesid 28117	. . . . . 6 ⊢ ( 0s ∈ No → 0s ≤s 0s )
14	1, 13	ax-mp 5	. . . . 5 ⊢ 0s ≤s 0s
15		oveq2 7426	. . . . . . 7 ⊢ ( 0s = 𝐵 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
16	15	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 0s ) = (𝐴 ·s 𝐵))
17		muls01 28491	. . . . . . . 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 2798	. . . . 5 ⊢ ((𝜑 ∧ 0s = 𝐵) → (𝐴 ·s 𝐵) = 0s )
21	14, 20	breqtrrid 5143	. . . 4 ⊢ ((𝜑 ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
22	21	adantlr 728	. . 3 ⊢ (((𝜑 ∧ 0s <s 𝐴) ∧ 0s = 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
23		mulsge0d.4	. . . . 5 ⊢ (𝜑 → 0s ≤s 𝐵)
24		lesloe 28104	. . . . . 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 7425	. . . . 5 ⊢ ( 0s = 𝐴 → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
30	29	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 0s = 𝐴) → ( 0s ·s 𝐵) = (𝐴 ·s 𝐵))
31		muls02 28520	. . . . . 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 2798	. . 3 ⊢ ((𝜑 ∧ 0s = 𝐴) → (𝐴 ·s 𝐵) = 0s )
35	14, 34	breqtrrid 5143	. 2 ⊢ ((𝜑 ∧ 0s = 𝐴) → 0s ≤s (𝐴 ·s 𝐵))
36		mulsge0d.3	. . 3 ⊢ (𝜑 → 0s ≤s 𝐴)
37		lesloe 28104	. . . 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 2145   class class class wbr 5103  (class class class)co 7418   No csur 27990   <s clts 27991   ≤s cles 28094   0_s c0s 28184   ·_s cmuls 28485

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-1o 8469  df-2o 8470  df-nadd 8668  df-no 27993  df-lts 27994  df-bday 27995  df-les 28095  df-slts 28137  df-cuts 28139  df-0s 28186  df-made 28206  df-old 28207  df-left 28209  df-right 28210  df-norec 28317  df-norec2 28328  df-adds 28339  df-negs 28400  df-subs 28401  df-muls 28486

This theorem is used by:  absmuls  28623  zsoring  28788