Theorem absmuls 28240

Description: Surreal absolute value distributes over multiplication. (Contributed by Scott Fenton, 16-Apr-2025.)

Assertion

Ref	Expression
absmuls	⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (abss‘(𝐴 ·s 𝐵)) = ((abss‘𝐴) ·s (abss‘𝐵)))

Proof of Theorem absmuls

Step	Hyp	Ref	Expression
1		mulscl 28130	. . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 ·s 𝐵) ∈ No )
2	1	adantr 480	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) → (𝐴 ·s 𝐵) ∈ No )
3		simplll 774	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → 𝐴 ∈ No )
4		simpllr 775	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → 𝐵 ∈ No )
5		simplr 768	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → 0s ≤s 𝐴)
6		simpr 484	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → 0s ≤s 𝐵)
7	3, 4, 5, 6	mulsge0d 28142	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → 0s ≤s (𝐴 ·s 𝐵))
8		abssid 28237	. . . . . 6 ⊢ (((𝐴 ·s 𝐵) ∈ No ∧ 0s ≤s (𝐴 ·s 𝐵)) → (abss‘(𝐴 ·s 𝐵)) = (𝐴 ·s 𝐵))
9	2, 7, 8	syl2an2r 685	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → (abss‘(𝐴 ·s 𝐵)) = (𝐴 ·s 𝐵))
10		abssid 28237	. . . . . . 7 ⊢ ((𝐵 ∈ No ∧ 0s ≤s 𝐵) → (abss‘𝐵) = 𝐵)
11	10	ad4ant24 754	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → (abss‘𝐵) = 𝐵)
12	11	oveq2d 7374	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → (𝐴 ·s (abss‘𝐵)) = (𝐴 ·s 𝐵))
13	9, 12	eqtr4d 2774	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 0s ≤s 𝐵) → (abss‘(𝐴 ·s 𝐵)) = (𝐴 ·s (abss‘𝐵)))
14		simplll 774	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 𝐴 ∈ No )
15		simpllr 775	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 𝐵 ∈ No )
16	14, 15	mulnegs2d 28157	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (𝐴 ·s ( -us ‘𝐵)) = ( -us ‘(𝐴 ·s 𝐵)))
17		abssnid 28239	. . . . . . 7 ⊢ ((𝐵 ∈ No ∧ 𝐵 ≤s 0s ) → (abss‘𝐵) = ( -us ‘𝐵))
18	17	ad4ant24 754	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (abss‘𝐵) = ( -us ‘𝐵))
19	18	oveq2d 7374	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (𝐴 ·s (abss‘𝐵)) = (𝐴 ·s ( -us ‘𝐵)))
20		neg0s 28022	. . . . . . . 8 ⊢ ( -us ‘ 0s ) = 0s
21	15	negscld 28033	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → ( -us ‘𝐵) ∈ No )
22		simplr 768	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 0s ≤s 𝐴)
23		simpr 484	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 𝐵 ≤s 0s )
24		0no 27805	. . . . . . . . . . . . . 14 ⊢ 0s ∈ No
25	24	a1i 11	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 0s ∈ No )
26	15, 25	lenegsd 28044	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (𝐵 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐵)))
27	23, 26	mpbid 232	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → ( -us ‘ 0s ) ≤s ( -us ‘𝐵))
28	20, 27	eqbrtrrid 5134	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 0s ≤s ( -us ‘𝐵))
29	14, 21, 22, 28	mulsge0d 28142	. . . . . . . . 9 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 0s ≤s (𝐴 ·s ( -us ‘𝐵)))
30	29, 16	breqtrd 5124	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → 0s ≤s ( -us ‘(𝐴 ·s 𝐵)))
31	20, 30	eqbrtrid 5133	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → ( -us ‘ 0s ) ≤s ( -us ‘(𝐴 ·s 𝐵)))
32	2	adantr 480	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (𝐴 ·s 𝐵) ∈ No )
33	32, 25	lenegsd 28044	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → ((𝐴 ·s 𝐵) ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘(𝐴 ·s 𝐵))))
34	31, 33	mpbird 257	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (𝐴 ·s 𝐵) ≤s 0s )
35		abssnid 28239	. . . . . 6 ⊢ (((𝐴 ·s 𝐵) ∈ No ∧ (𝐴 ·s 𝐵) ≤s 0s ) → (abss‘(𝐴 ·s 𝐵)) = ( -us ‘(𝐴 ·s 𝐵)))
36	2, 34, 35	syl2an2r 685	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (abss‘(𝐴 ·s 𝐵)) = ( -us ‘(𝐴 ·s 𝐵)))
37	16, 19, 36	3eqtr4rd 2782	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) ∧ 𝐵 ≤s 0s ) → (abss‘(𝐴 ·s 𝐵)) = (𝐴 ·s (abss‘𝐵)))
38		lestric 27736	. . . . . 6 ⊢ (( 0s ∈ No ∧ 𝐵 ∈ No ) → ( 0s ≤s 𝐵 ∨ 𝐵 ≤s 0s ))
39	24, 38	mpan 690	. . . . 5 ⊢ (𝐵 ∈ No → ( 0s ≤s 𝐵 ∨ 𝐵 ≤s 0s ))
40	39	ad2antlr 727	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) → ( 0s ≤s 𝐵 ∨ 𝐵 ≤s 0s ))
41	13, 37, 40	mpjaodan 960	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) → (abss‘(𝐴 ·s 𝐵)) = (𝐴 ·s (abss‘𝐵)))
42		abssid 28237	. . . . 5 ⊢ ((𝐴 ∈ No ∧ 0s ≤s 𝐴) → (abss‘𝐴) = 𝐴)
43	42	adantlr 715	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) → (abss‘𝐴) = 𝐴)
44	43	oveq1d 7373	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) → ((abss‘𝐴) ·s (abss‘𝐵)) = (𝐴 ·s (abss‘𝐵)))
45	41, 44	eqtr4d 2774	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 0s ≤s 𝐴) → (abss‘(𝐴 ·s 𝐵)) = ((abss‘𝐴) ·s (abss‘𝐵)))
46		simplll 774	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 𝐴 ∈ No )
47		simpllr 775	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 𝐵 ∈ No )
48	46, 47	mulnegs1d 28156	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (( -us ‘𝐴) ·s 𝐵) = ( -us ‘(𝐴 ·s 𝐵)))
49	10	ad4ant24 754	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (abss‘𝐵) = 𝐵)
50	49	oveq2d 7374	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (( -us ‘𝐴) ·s (abss‘𝐵)) = (( -us ‘𝐴) ·s 𝐵))
51	1	adantr 480	. . . . . 6 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) → (𝐴 ·s 𝐵) ∈ No )
52	46	negscld 28033	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → ( -us ‘𝐴) ∈ No )
53		simplr 768	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 𝐴 ≤s 0s )
54	24	a1i 11	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 0s ∈ No )
55	46, 54	lenegsd 28044	. . . . . . . . . . . 12 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴)))
56	53, 55	mpbid 232	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → ( -us ‘ 0s ) ≤s ( -us ‘𝐴))
57	20, 56	eqbrtrrid 5134	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 0s ≤s ( -us ‘𝐴))
58		simpr 484	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 0s ≤s 𝐵)
59	52, 47, 57, 58	mulsge0d 28142	. . . . . . . . 9 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 0s ≤s (( -us ‘𝐴) ·s 𝐵))
60	59, 48	breqtrd 5124	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → 0s ≤s ( -us ‘(𝐴 ·s 𝐵)))
61	20, 60	eqbrtrid 5133	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → ( -us ‘ 0s ) ≤s ( -us ‘(𝐴 ·s 𝐵)))
62	51	adantr 480	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (𝐴 ·s 𝐵) ∈ No )
63	62, 54	lenegsd 28044	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → ((𝐴 ·s 𝐵) ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘(𝐴 ·s 𝐵))))
64	61, 63	mpbird 257	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (𝐴 ·s 𝐵) ≤s 0s )
65	51, 64, 35	syl2an2r 685	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (abss‘(𝐴 ·s 𝐵)) = ( -us ‘(𝐴 ·s 𝐵)))
66	48, 50, 65	3eqtr4rd 2782	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 0s ≤s 𝐵) → (abss‘(𝐴 ·s 𝐵)) = (( -us ‘𝐴) ·s (abss‘𝐵)))
67		simplll 774	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 𝐴 ∈ No )
68		simpllr 775	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 𝐵 ∈ No )
69	67, 68	mul2negsd 28158	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → (( -us ‘𝐴) ·s ( -us ‘𝐵)) = (𝐴 ·s 𝐵))
70	17	ad4ant24 754	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → (abss‘𝐵) = ( -us ‘𝐵))
71	70	oveq2d 7374	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → (( -us ‘𝐴) ·s (abss‘𝐵)) = (( -us ‘𝐴) ·s ( -us ‘𝐵)))
72	67	negscld 28033	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → ( -us ‘𝐴) ∈ No )
73	68	negscld 28033	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → ( -us ‘𝐵) ∈ No )
74		simplr 768	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 𝐴 ≤s 0s )
75	24	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 0s ∈ No )
76	67, 75	lenegsd 28044	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴)))
77	74, 76	mpbid 232	. . . . . . . . 9 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → ( -us ‘ 0s ) ≤s ( -us ‘𝐴))
78	20, 77	eqbrtrrid 5134	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 0s ≤s ( -us ‘𝐴))
79		simpr 484	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 𝐵 ≤s 0s )
80	68, 75	lenegsd 28044	. . . . . . . . . 10 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → (𝐵 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐵)))
81	79, 80	mpbid 232	. . . . . . . . 9 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → ( -us ‘ 0s ) ≤s ( -us ‘𝐵))
82	20, 81	eqbrtrrid 5134	. . . . . . . 8 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 0s ≤s ( -us ‘𝐵))
83	72, 73, 78, 82	mulsge0d 28142	. . . . . . 7 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 0s ≤s (( -us ‘𝐴) ·s ( -us ‘𝐵)))
84	83, 69	breqtrd 5124	. . . . . 6 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → 0s ≤s (𝐴 ·s 𝐵))
85	51, 84, 8	syl2an2r 685	. . . . 5 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → (abss‘(𝐴 ·s 𝐵)) = (𝐴 ·s 𝐵))
86	69, 71, 85	3eqtr4rd 2782	. . . 4 ⊢ ((((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) ∧ 𝐵 ≤s 0s ) → (abss‘(𝐴 ·s 𝐵)) = (( -us ‘𝐴) ·s (abss‘𝐵)))
87	39	ad2antlr 727	. . . 4 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) → ( 0s ≤s 𝐵 ∨ 𝐵 ≤s 0s ))
88	66, 86, 87	mpjaodan 960	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) → (abss‘(𝐴 ·s 𝐵)) = (( -us ‘𝐴) ·s (abss‘𝐵)))
89		abssnid 28239	. . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐴 ≤s 0s ) → (abss‘𝐴) = ( -us ‘𝐴))
90	89	oveq1d 7373	. . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐴 ≤s 0s ) → ((abss‘𝐴) ·s (abss‘𝐵)) = (( -us ‘𝐴) ·s (abss‘𝐵)))
91	90	adantlr 715	. . 3 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) → ((abss‘𝐴) ·s (abss‘𝐵)) = (( -us ‘𝐴) ·s (abss‘𝐵)))
92	88, 91	eqtr4d 2774	. 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 ≤s 0s ) → (abss‘(𝐴 ·s 𝐵)) = ((abss‘𝐴) ·s (abss‘𝐵)))
93		lestric 27736	. . . 4 ⊢ (( 0s ∈ No ∧ 𝐴 ∈ No ) → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s ))
94	24, 93	mpan 690	. . 3 ⊢ (𝐴 ∈ No → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s ))
95	94	adantr 480	. 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s ))
96	45, 92, 95	mpjaodan 960	1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (abss‘(𝐴 ·s 𝐵)) = ((abss‘𝐴) ·s (abss‘𝐵)))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   = wceq 1541   ∈ wcel 2113   class class class wbr 5098  ‘cfv 6492  (class class class)co 7358   No csur 27607   ≤s cles 27712   0_s c0s 27801   -u_s cnegs 28015   ·_s cmuls 28102  abs_scabss 28233

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-ot 4589  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-1o 8397  df-2o 8398  df-nadd 8594  df-no 27610  df-lts 27611  df-bday 27612  df-les 27713  df-slts 27754  df-cuts 27756  df-0s 27803  df-made 27823  df-old 27824  df-left 27826  df-right 27827  df-norec 27934  df-norec2 27945  df-adds 27956  df-negs 28017  df-subs 28018  df-muls 28103  df-abss 28234

This theorem is referenced by:  remulscllem2  28497