ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulsub Unicode version

Theorem mulsub 8728
Description: Product of two differences. (Contributed by NM, 14-Jan-2006.)
Assertion
Ref Expression
mulsub  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  -  B )  x.  ( C  -  D )
)  =  ( ( ( A  x.  C
)  +  ( D  x.  B ) )  -  ( ( A  x.  D )  +  ( C  x.  B
) ) ) )

Proof of Theorem mulsub
StepHypRef Expression
1 negsub 8574 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  +  -u B )  =  ( A  -  B ) )
2 negsub 8574 . . 3  |-  ( ( C  e.  CC  /\  D  e.  CC )  ->  ( C  +  -u D )  =  ( C  -  D ) )
31, 2oveqan12d 6104 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  -u B )  x.  ( C  +  -u D ) )  =  ( ( A  -  B )  x.  ( C  -  D ) ) )
4 negcl 8526 . . . 4  |-  ( B  e.  CC  ->  -u B  e.  CC )
5 negcl 8526 . . . . 5  |-  ( D  e.  CC  ->  -u D  e.  CC )
6 muladd 8711 . . . . 5  |-  ( ( ( A  e.  CC  /\  -u B  e.  CC )  /\  ( C  e.  CC  /\  -u D  e.  CC ) )  -> 
( ( A  +  -u B )  x.  ( C  +  -u D ) )  =  ( ( ( A  x.  C
)  +  ( -u D  x.  -u B ) )  +  ( ( A  x.  -u D
)  +  ( C  x.  -u B ) ) ) )
75, 6sylanr2 409 . . . 4  |-  ( ( ( A  e.  CC  /\  -u B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  -u B )  x.  ( C  +  -u D ) )  =  ( ( ( A  x.  C
)  +  ( -u D  x.  -u B ) )  +  ( ( A  x.  -u D
)  +  ( C  x.  -u B ) ) ) )
84, 7sylanl2 407 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  -u B )  x.  ( C  +  -u D ) )  =  ( ( ( A  x.  C
)  +  ( -u D  x.  -u B ) )  +  ( ( A  x.  -u D
)  +  ( C  x.  -u B ) ) ) )
9 mul2neg 8725 . . . . . . 7  |-  ( ( D  e.  CC  /\  B  e.  CC )  ->  ( -u D  x.  -u B )  =  ( D  x.  B ) )
109ancoms 268 . . . . . 6  |-  ( ( B  e.  CC  /\  D  e.  CC )  ->  ( -u D  x.  -u B )  =  ( D  x.  B ) )
1110oveq2d 6101 . . . . 5  |-  ( ( B  e.  CC  /\  D  e.  CC )  ->  ( ( A  x.  C )  +  (
-u D  x.  -u B
) )  =  ( ( A  x.  C
)  +  ( D  x.  B ) ) )
1211ad2ant2l 512 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  x.  C )  +  (
-u D  x.  -u B
) )  =  ( ( A  x.  C
)  +  ( D  x.  B ) ) )
13 mulneg2 8723 . . . . . . . 8  |-  ( ( A  e.  CC  /\  D  e.  CC )  ->  ( A  x.  -u D
)  =  -u ( A  x.  D )
)
14 mulneg2 8723 . . . . . . . 8  |-  ( ( C  e.  CC  /\  B  e.  CC )  ->  ( C  x.  -u B
)  =  -u ( C  x.  B )
)
1513, 14oveqan12d 6104 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  D  e.  CC )  /\  ( C  e.  CC  /\  B  e.  CC ) )  -> 
( ( A  x.  -u D )  +  ( C  x.  -u B
) )  =  (
-u ( A  x.  D )  +  -u ( C  x.  B
) ) )
16 mulcl 8306 . . . . . . . 8  |-  ( ( A  e.  CC  /\  D  e.  CC )  ->  ( A  x.  D
)  e.  CC )
17 mulcl 8306 . . . . . . . 8  |-  ( ( C  e.  CC  /\  B  e.  CC )  ->  ( C  x.  B
)  e.  CC )
18 negdi 8583 . . . . . . . 8  |-  ( ( ( A  x.  D
)  e.  CC  /\  ( C  x.  B
)  e.  CC )  ->  -u ( ( A  x.  D )  +  ( C  x.  B
) )  =  (
-u ( A  x.  D )  +  -u ( C  x.  B
) ) )
1916, 17, 18syl2an 289 . . . . . . 7  |-  ( ( ( A  e.  CC  /\  D  e.  CC )  /\  ( C  e.  CC  /\  B  e.  CC ) )  ->  -u ( ( A  x.  D )  +  ( C  x.  B ) )  =  ( -u ( A  x.  D
)  +  -u ( C  x.  B )
) )
2015, 19eqtr4d 2274 . . . . . 6  |-  ( ( ( A  e.  CC  /\  D  e.  CC )  /\  ( C  e.  CC  /\  B  e.  CC ) )  -> 
( ( A  x.  -u D )  +  ( C  x.  -u B
) )  =  -u ( ( A  x.  D )  +  ( C  x.  B ) ) )
2120ancom2s 572 . . . . 5  |-  ( ( ( A  e.  CC  /\  D  e.  CC )  /\  ( B  e.  CC  /\  C  e.  CC ) )  -> 
( ( A  x.  -u D )  +  ( C  x.  -u B
) )  =  -u ( ( A  x.  D )  +  ( C  x.  B ) ) )
2221an42s 597 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  x.  -u D )  +  ( C  x.  -u B
) )  =  -u ( ( A  x.  D )  +  ( C  x.  B ) ) )
2312, 22oveq12d 6103 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( ( A  x.  C )  +  ( -u D  x.  -u B ) )  +  ( ( A  x.  -u D )  +  ( C  x.  -u B
) ) )  =  ( ( ( A  x.  C )  +  ( D  x.  B
) )  +  -u ( ( A  x.  D )  +  ( C  x.  B ) ) ) )
24 mulcl 8306 . . . . . 6  |-  ( ( A  e.  CC  /\  C  e.  CC )  ->  ( A  x.  C
)  e.  CC )
25 mulcl 8306 . . . . . . 7  |-  ( ( D  e.  CC  /\  B  e.  CC )  ->  ( D  x.  B
)  e.  CC )
2625ancoms 268 . . . . . 6  |-  ( ( B  e.  CC  /\  D  e.  CC )  ->  ( D  x.  B
)  e.  CC )
27 addcl 8304 . . . . . 6  |-  ( ( ( A  x.  C
)  e.  CC  /\  ( D  x.  B
)  e.  CC )  ->  ( ( A  x.  C )  +  ( D  x.  B
) )  e.  CC )
2824, 26, 27syl2an 289 . . . . 5  |-  ( ( ( A  e.  CC  /\  C  e.  CC )  /\  ( B  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  x.  C )  +  ( D  x.  B ) )  e.  CC )
2928an4s 596 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  x.  C )  +  ( D  x.  B ) )  e.  CC )
3017ancoms 268 . . . . . 6  |-  ( ( B  e.  CC  /\  C  e.  CC )  ->  ( C  x.  B
)  e.  CC )
31 addcl 8304 . . . . . 6  |-  ( ( ( A  x.  D
)  e.  CC  /\  ( C  x.  B
)  e.  CC )  ->  ( ( A  x.  D )  +  ( C  x.  B
) )  e.  CC )
3216, 30, 31syl2an 289 . . . . 5  |-  ( ( ( A  e.  CC  /\  D  e.  CC )  /\  ( B  e.  CC  /\  C  e.  CC ) )  -> 
( ( A  x.  D )  +  ( C  x.  B ) )  e.  CC )
3332an42s 597 . . . 4  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  x.  D )  +  ( C  x.  B ) )  e.  CC )
3429, 33negsubd 8643 . . 3  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( ( A  x.  C )  +  ( D  x.  B
) )  +  -u ( ( A  x.  D )  +  ( C  x.  B ) ) )  =  ( ( ( A  x.  C )  +  ( D  x.  B ) )  -  ( ( A  x.  D )  +  ( C  x.  B ) ) ) )
358, 23, 343eqtrd 2275 . 2  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  +  -u B )  x.  ( C  +  -u D ) )  =  ( ( ( A  x.  C
)  +  ( D  x.  B ) )  -  ( ( A  x.  D )  +  ( C  x.  B
) ) ) )
363, 35eqtr3d 2273 1  |-  ( ( ( A  e.  CC  /\  B  e.  CC )  /\  ( C  e.  CC  /\  D  e.  CC ) )  -> 
( ( A  -  B )  x.  ( C  -  D )
)  =  ( ( ( A  x.  C
)  +  ( D  x.  B ) )  -  ( ( A  x.  D )  +  ( C  x.  B
) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209  (class class class)co 6085   CCcc 8177    + caddc 8182    x. cmul 8184    - cmin 8497   -ucneg 8498
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684  ax-resscn 8271  ax-1cn 8272  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-neg 8500
This theorem is used by:  mulsubd  8744  muleqadd  8998  addltmul  9542  sqabssub  11822
  Copyright terms: Public domain W3C validator