Theorem lemuls1ad 28353

Description: Multiplication of both sides of surreal less-than or equal by a non-negative number. (Contributed by Scott Fenton, 17-Apr-2025.)

Hypotheses

Ref	Expression
lemuls1ad.1	⊢ (𝜑 → 𝐴 ∈ No )
lemuls1ad.2	⊢ (𝜑 → 𝐵 ∈ No )
lemuls1ad.3	⊢ (𝜑 → 𝐶 ∈ No )
lemuls1ad.4	⊢ (𝜑 → 0s ≤s 𝐶)
lemuls1ad.5	⊢ (𝜑 → 𝐴 ≤s 𝐵)

Assertion

Ref	Expression
lemuls1ad	⊢ (𝜑 → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶))

Proof of Theorem lemuls1ad

Step	Hyp	Ref	Expression
1		lemuls1ad.5	. . . 4 ⊢ (𝜑 → 𝐴 ≤s 𝐵)
2	1	adantr 485	. . 3 ⊢ ((𝜑 ∧ 0s <s 𝐶) → 𝐴 ≤s 𝐵)
3		lemuls1ad.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ No )
4	3	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 0s <s 𝐶) → 𝐴 ∈ No )
5		lemuls1ad.2	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ No )
6	5	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 0s <s 𝐶) → 𝐵 ∈ No )
7		lemuls1ad.3	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ No )
8	7	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 0s <s 𝐶) → 𝐶 ∈ No )
9		simpr 489	. . . 4 ⊢ ((𝜑 ∧ 0s <s 𝐶) → 0s <s 𝐶)
10	4, 6, 8, 9	lemuls1d 28346	. . 3 ⊢ ((𝜑 ∧ 0s <s 𝐶) → (𝐴 ≤s 𝐵 ↔ (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶)))
11	2, 10	mpbid 235	. 2 ⊢ ((𝜑 ∧ 0s <s 𝐶) → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶))
12		0no 27980	. . . . . 6 ⊢ 0s ∈ No
13		lesid 27909	. . . . . 6 ⊢ ( 0s ∈ No → 0s ≤s 0s )
14	12, 13	mp1i 14	. . . . 5 ⊢ (𝜑 → 0s ≤s 0s )
15		muls01 28283	. . . . . 6 ⊢ (𝐴 ∈ No → (𝐴 ·s 0s ) = 0s )
16	3, 15	syl 18	. . . . 5 ⊢ (𝜑 → (𝐴 ·s 0s ) = 0s )
17		muls01 28283	. . . . . 6 ⊢ (𝐵 ∈ No → (𝐵 ·s 0s ) = 0s )
18	5, 17	syl 18	. . . . 5 ⊢ (𝜑 → (𝐵 ·s 0s ) = 0s )
19	14, 16, 18	3brtr4d 5144	. . . 4 ⊢ (𝜑 → (𝐴 ·s 0s ) ≤s (𝐵 ·s 0s ))
20		oveq2 7420	. . . . 5 ⊢ ( 0s = 𝐶 → (𝐴 ·s 0s ) = (𝐴 ·s 𝐶))
21		oveq2 7420	. . . . 5 ⊢ ( 0s = 𝐶 → (𝐵 ·s 0s ) = (𝐵 ·s 𝐶))
22	20, 21	breq12d 5123	. . . 4 ⊢ ( 0s = 𝐶 → ((𝐴 ·s 0s ) ≤s (𝐵 ·s 0s ) ↔ (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶)))
23	19, 22	syl5ibcom 248	. . 3 ⊢ (𝜑 → ( 0s = 𝐶 → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶)))
24	23	imp 411	. 2 ⊢ ((𝜑 ∧ 0s = 𝐶) → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶))
25		lemuls1ad.4	. . 3 ⊢ (𝜑 → 0s ≤s 𝐶)
26		lesloe 27896	. . . 4 ⊢ (( 0s ∈ No ∧ 𝐶 ∈ No ) → ( 0s ≤s 𝐶 ↔ ( 0s <s 𝐶 ∨ 0s = 𝐶)))
27	12, 7, 26	sylancr 598	. . 3 ⊢ (𝜑 → ( 0s ≤s 𝐶 ↔ ( 0s <s 𝐶 ∨ 0s = 𝐶)))
28	25, 27	mpbid 235	. 2 ⊢ (𝜑 → ( 0s <s 𝐶 ∨ 0s = 𝐶))
29	11, 24, 28	mpjaodan 973	1 ⊢ (𝜑 → (𝐴 ·s 𝐶) ≤s (𝐵 ·s 𝐶))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1570   ∈ wcel 2143   class class class wbr 5110  (class class class)co 7412   No csur 27782   <s clts 27783   ≤s cles 27886   0_s c0s 27976   ·_s cmuls 28277

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 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734

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 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-tp 4595  df-op 4597  df-ot 4599  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  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 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-1o 8454  df-2o 8455  df-nadd 8653  df-no 27785  df-lts 27786  df-bday 27787  df-les 27887  df-slts 27929  df-cuts 27931  df-0s 27978  df-made 27998  df-old 27999  df-left 28001  df-right 28002  df-norec 28109  df-norec2 28120  df-adds 28131  df-negs 28192  df-subs 28193  df-muls 28278

This theorem is referenced by:  ltmuls12ad  28354