Theorem mulnegs1d 28539

Description: Product with negative is negative of product. Part of theorem 7 of [Conway] p. 19. (Contributed by Scott Fenton, 10-Mar-2025.)

Hypotheses

Ref	Expression
mulnegs1d.1	⊢ (𝜑 → 𝐴 ∈ No )
mulnegs1d.2	⊢ (𝜑 → 𝐵 ∈ No )

Assertion

Ref	Expression
mulnegs1d	⊢ (𝜑 → (( -us ‘𝐴) ·s 𝐵) = ( -us ‘(𝐴 ·s 𝐵)))

Proof of Theorem mulnegs1d

Step	Hyp	Ref	Expression
1		mulnegs1d.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ No )
2	1	negsidd 28421	. . . . 5 ⊢ (𝜑 → (𝐴 +s ( -us ‘𝐴)) = 0s )
3	2	oveq1d 7433	. . . 4 ⊢ (𝜑 → ((𝐴 +s ( -us ‘𝐴)) ·s 𝐵) = ( 0s ·s 𝐵))
4	1	negscld 28416	. . . . 5 ⊢ (𝜑 → ( -us ‘𝐴) ∈ No )
5		mulnegs1d.2	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ No )
6	1, 4, 5	addsdird 28536	. . . 4 ⊢ (𝜑 → ((𝐴 +s ( -us ‘𝐴)) ·s 𝐵) = ((𝐴 ·s 𝐵) +s (( -us ‘𝐴) ·s 𝐵)))
7		muls02 28520	. . . . 5 ⊢ (𝐵 ∈ No → ( 0s ·s 𝐵) = 0s )
8	5, 7	syl 18	. . . 4 ⊢ (𝜑 → ( 0s ·s 𝐵) = 0s )
9	3, 6, 8	3eqtr3d 2804	. . 3 ⊢ (𝜑 → ((𝐴 ·s 𝐵) +s (( -us ‘𝐴) ·s 𝐵)) = 0s )
10	1, 5	mulscld 28514	. . . 4 ⊢ (𝜑 → (𝐴 ·s 𝐵) ∈ No )
11	10	negsidd 28421	. . 3 ⊢ (𝜑 → ((𝐴 ·s 𝐵) +s ( -us ‘(𝐴 ·s 𝐵))) = 0s )
12	9, 11	eqtr4d 2799	. 2 ⊢ (𝜑 → ((𝐴 ·s 𝐵) +s (( -us ‘𝐴) ·s 𝐵)) = ((𝐴 ·s 𝐵) +s ( -us ‘(𝐴 ·s 𝐵))))
13	4, 5	mulscld 28514	. . 3 ⊢ (𝜑 → (( -us ‘𝐴) ·s 𝐵) ∈ No )
14	10	negscld 28416	. . 3 ⊢ (𝜑 → ( -us ‘(𝐴 ·s 𝐵)) ∈ No )
15	13, 14, 10	addscan1d 28379	. 2 ⊢ (𝜑 → (((𝐴 ·s 𝐵) +s (( -us ‘𝐴) ·s 𝐵)) = ((𝐴 ·s 𝐵) +s ( -us ‘(𝐴 ·s 𝐵))) ↔ (( -us ‘𝐴) ·s 𝐵) = ( -us ‘(𝐴 ·s 𝐵))))
16	12, 15	mpbid 235	1 ⊢ (𝜑 → (( -us ‘𝐴) ·s 𝐵) = ( -us ‘(𝐴 ·s 𝐵)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ‘cfv 6537  (class class class)co 7418   No csur 27990   0_s c0s 28184   +_s cadds 28338   -u_s cnegs 28398   ·_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:  mulnegs2d  28540  mul2negsd  28541  precsexlem9  28594  recsex  28598  absmuls  28623