MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mulnegs1d Structured version   Visualization version   GIF version

Theorem mulnegs1d 28353
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
StepHypRef Expression
1 mulnegs1d.1 . . . . . 6 (𝜑𝐴 No )
21negsidd 28235 . . . . 5 (𝜑 → (𝐴 +s ( -us𝐴)) = 0s )
32oveq1d 7425 . . . 4 (𝜑 → ((𝐴 +s ( -us𝐴)) ·s 𝐵) = ( 0s ·s 𝐵))
41negscld 28230 . . . . 5 (𝜑 → ( -us𝐴) ∈ No )
5 mulnegs1d.2 . . . . 5 (𝜑𝐵 No )
61, 4, 5addsdird 28350 . . . 4 (𝜑 → ((𝐴 +s ( -us𝐴)) ·s 𝐵) = ((𝐴 ·s 𝐵) +s (( -us𝐴) ·s 𝐵)))
7 muls02 28334 . . . . 5 (𝐵 No → ( 0s ·s 𝐵) = 0s )
85, 7syl 18 . . . 4 (𝜑 → ( 0s ·s 𝐵) = 0s )
93, 6, 83eqtr3d 2806 . . 3 (𝜑 → ((𝐴 ·s 𝐵) +s (( -us𝐴) ·s 𝐵)) = 0s )
101, 5mulscld 28328 . . . 4 (𝜑 → (𝐴 ·s 𝐵) ∈ No )
1110negsidd 28235 . . 3 (𝜑 → ((𝐴 ·s 𝐵) +s ( -us ‘(𝐴 ·s 𝐵))) = 0s )
129, 11eqtr4d 2801 . 2 (𝜑 → ((𝐴 ·s 𝐵) +s (( -us𝐴) ·s 𝐵)) = ((𝐴 ·s 𝐵) +s ( -us ‘(𝐴 ·s 𝐵))))
134, 5mulscld 28328 . . 3 (𝜑 → (( -us𝐴) ·s 𝐵) ∈ No )
1410negscld 28230 . . 3 (𝜑 → ( -us ‘(𝐴 ·s 𝐵)) ∈ No )
1513, 14, 10addscan1d 28193 . 2 (𝜑 → (((𝐴 ·s 𝐵) +s (( -us𝐴) ·s 𝐵)) = ((𝐴 ·s 𝐵) +s ( -us ‘(𝐴 ·s 𝐵))) ↔ (( -us𝐴) ·s 𝐵) = ( -us ‘(𝐴 ·s 𝐵))))
1612, 15mpbid 235 1 (𝜑 → (( -us𝐴) ·s 𝐵) = ( -us ‘(𝐴 ·s 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  cfv 6536  (class class class)co 7410   No csur 27804   0s c0s 27998   +s cadds 28152   -us cnegs 28212   ·s cmuls 28299
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 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
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 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-ot 4598  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-1o 8449  df-2o 8450  df-nadd 8648  df-no 27807  df-lts 27808  df-bday 27809  df-les 27909  df-slts 27951  df-cuts 27953  df-0s 28000  df-made 28020  df-old 28021  df-left 28023  df-right 28024  df-norec 28131  df-norec2 28142  df-adds 28153  df-negs 28214  df-subs 28215  df-muls 28300
This theorem is referenced by:  mulnegs2d  28354  mul2negsd  28355  precsexlem9  28408  recsex  28412  absmuls  28437
  Copyright terms: Public domain W3C validator