Theorem ltmuls2 28322

Description: Multiplication of both sides of surreal less-than by a positive number. (Contributed by Scott Fenton, 10-Mar-2025.)

Assertion

Ref	Expression
ltmuls2	⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 <s 𝐶 ↔ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)))

Proof of Theorem ltmuls2

Step	Hyp	Ref	Expression
1		simpl1l 1241	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → 𝐴 ∈ No )
2		simpl3 1210	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → 𝐶 ∈ No )
3		simpl2 1209	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → 𝐵 ∈ No )
4	2, 3	subscld 28214	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → (𝐶 -s 𝐵) ∈ No )
5		simpl1r 1242	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → 0s <s 𝐴)
6		simp2 1153	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐵 ∈ No )
7		simp3 1154	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐶 ∈ No )
8	6, 7	posdifsd 28249	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 <s 𝐶 ↔ 0s <s (𝐶 -s 𝐵)))
9	8	biimpa 481	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → 0s <s (𝐶 -s 𝐵))
10	1, 4, 5, 9	mulsgt0d 28296	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → 0s <s (𝐴 ·s (𝐶 -s 𝐵)))
11	1, 2, 3	subsdid 28309	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → (𝐴 ·s (𝐶 -s 𝐵)) = ((𝐴 ·s 𝐶) -s (𝐴 ·s 𝐵)))
12	10, 11	breqtrd 5131	. . 3 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → 0s <s ((𝐴 ·s 𝐶) -s (𝐴 ·s 𝐵)))
13	1, 3	mulscld 28286	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → (𝐴 ·s 𝐵) ∈ No )
14	1, 2	mulscld 28286	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → (𝐴 ·s 𝐶) ∈ No )
15	13, 14	posdifsd 28249	. . 3 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → ((𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶) ↔ 0s <s ((𝐴 ·s 𝐶) -s (𝐴 ·s 𝐵))))
16	12, 15	mpbird 260	. 2 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ 𝐵 <s 𝐶) → (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶))
17		simp1l 1214	. . . . . . . 8 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → 𝐴 ∈ No )
18	17, 7	mulscld 28286	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ·s 𝐶) ∈ No )
19		ltsirr 27868	. . . . . . 7 ⊢ ((𝐴 ·s 𝐶) ∈ No → ¬ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐶))
20	18, 19	syl 18	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ¬ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐶))
21		oveq2 7408	. . . . . . . 8 ⊢ (𝐵 = 𝐶 → (𝐴 ·s 𝐵) = (𝐴 ·s 𝐶))
22	21	breq1d 5115	. . . . . . 7 ⊢ (𝐵 = 𝐶 → ((𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶) ↔ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐶)))
23	22	notbid 321	. . . . . 6 ⊢ (𝐵 = 𝐶 → (¬ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶) ↔ ¬ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐶)))
24	20, 23	syl5ibrcom 250	. . . . 5 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 = 𝐶 → ¬ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)))
25	24	con2d 135	. . . 4 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶) → ¬ 𝐵 = 𝐶))
26	25	imp 411	. . 3 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → ¬ 𝐵 = 𝐶)
27	17, 6	mulscld 28286	. . . . . . 7 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐴 ·s 𝐵) ∈ No )
28		ltsasym 27870	. . . . . . 7 ⊢ (((𝐴 ·s 𝐵) ∈ No ∧ (𝐴 ·s 𝐶) ∈ No ) → ((𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶) → ¬ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐵)))
29	27, 18, 28	syl2anc 595	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → ((𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶) → ¬ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐵)))
30	29	imp 411	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → ¬ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐵))
31		simpl1l 1241	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → 𝐴 ∈ No )
32	31	adantr 485	. . . . . . 7 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → 𝐴 ∈ No )
33		simpll2 1230	. . . . . . . 8 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → 𝐵 ∈ No )
34		simpll3 1231	. . . . . . . 8 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → 𝐶 ∈ No )
35	33, 34	subscld 28214	. . . . . . 7 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → (𝐵 -s 𝐶) ∈ No )
36		simpl1r 1242	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → 0s <s 𝐴)
37	36	adantr 485	. . . . . . 7 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → 0s <s 𝐴)
38		simpr 489	. . . . . . 7 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → 0s <s (𝐵 -s 𝐶))
39	32, 35, 37, 38	mulsgt0d 28296	. . . . . 6 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → 0s <s (𝐴 ·s (𝐵 -s 𝐶)))
40	32, 33, 34	subsdid 28309	. . . . . . . 8 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → (𝐴 ·s (𝐵 -s 𝐶)) = ((𝐴 ·s 𝐵) -s (𝐴 ·s 𝐶)))
41	40	breq2d 5117	. . . . . . 7 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → ( 0s <s (𝐴 ·s (𝐵 -s 𝐶)) ↔ 0s <s ((𝐴 ·s 𝐵) -s (𝐴 ·s 𝐶))))
42	18	ad2antrr 738	. . . . . . . 8 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → (𝐴 ·s 𝐶) ∈ No )
43	27	ad2antrr 738	. . . . . . . 8 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → (𝐴 ·s 𝐵) ∈ No )
44	42, 43	posdifsd 28249	. . . . . . 7 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → ((𝐴 ·s 𝐶) <s (𝐴 ·s 𝐵) ↔ 0s <s ((𝐴 ·s 𝐵) -s (𝐴 ·s 𝐶))))
45	41, 44	bitr4d 285	. . . . . 6 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → ( 0s <s (𝐴 ·s (𝐵 -s 𝐶)) ↔ (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐵)))
46	39, 45	mpbid 235	. . . . 5 ⊢ (((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) ∧ 0s <s (𝐵 -s 𝐶)) → (𝐴 ·s 𝐶) <s (𝐴 ·s 𝐵))
47	30, 46	mtand 827	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → ¬ 0s <s (𝐵 -s 𝐶))
48		simpl3 1210	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → 𝐶 ∈ No )
49		simpl2 1209	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → 𝐵 ∈ No )
50	48, 49	posdifsd 28249	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → (𝐶 <s 𝐵 ↔ 0s <s (𝐵 -s 𝐶)))
51	47, 50	mtbird 328	. . 3 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → ¬ 𝐶 <s 𝐵)
52		ltslin 27871	. . . 4 ⊢ ((𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 <s 𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶 <s 𝐵))
53	49, 48, 52	syl2anc 595	. . 3 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → (𝐵 <s 𝐶 ∨ 𝐵 = 𝐶 ∨ 𝐶 <s 𝐵))
54	26, 51, 53	ecase23d 1497	. 2 ⊢ ((((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) ∧ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)) → 𝐵 <s 𝐶)
55	16, 54	impbida 812	1 ⊢ (((𝐴 ∈ No ∧ 0s <s 𝐴) ∧ 𝐵 ∈ No ∧ 𝐶 ∈ No ) → (𝐵 <s 𝐶 ↔ (𝐴 ·s 𝐵) <s (𝐴 ·s 𝐶)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ w3o 1100   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145   class class class wbr 5105  (class class class)co 7400   No csur 27762   <s clts 27763   0_s c0s 27956   -_s csubs 28171   ·_s cmuls 28257

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-tp 4590  df-op 4592  df-ot 4594  df-uni 4869  df-int 4909  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-se 5606  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-1o 8441  df-2o 8442  df-nadd 8640  df-no 27765  df-lts 27766  df-bday 27767  df-les 27867  df-slts 27909  df-cuts 27911  df-0s 27958  df-made 27978  df-old 27979  df-left 27981  df-right 27982  df-norec 28089  df-norec2 28100  df-adds 28111  df-negs 28172  df-subs 28173  df-muls 28258

This theorem is referenced by:  ltmuls2d  28323