ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulsub Unicode version
Theorem mulsub 8547
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 8394 . . 3 |- ( ( A e. CC /\ B e. CC ) -> ( A + -u B ) = ( A - B ) )
2 negsub 8394 . . 3 |- ( ( C e. CC /\ D e. CC ) -> ( C + -u D ) = ( C - D ) )
31, 2oveqan12d 6020 . 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 8346 . . . 4 |- ( B e. CC -> -u B e. CC )
5 negcl 8346 . . . . 5 |- ( D e. CC -> -u D e. CC )
6 muladd 8530 . . . . 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 405 . . . 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 403 . . 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 8544 . . . . . . 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 6017 . . . . 5 |- ( ( B e. CC /\ D e. CC ) -> ( ( A x. C ) + ( -u D x. -u B ) ) = ( ( A x. C ) + ( D x. B ) ) )
1211ad2ant2l 508 . . . 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 8542 . . . . . . . 8 |- ( ( A e. CC /\ D e. CC ) -> ( A x. -u D ) = -u ( A x. D ) )
14 mulneg2 8542 . . . . . . . 8 |- ( ( C e. CC /\ B e. CC ) -> ( C x. -u B ) = -u ( C x. B ) )
1513, 14oveqan12d 6020 . . . . . . 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 8126 . . . . . . . 8 |- ( ( A e. CC /\ D e. CC ) -> ( A x. D ) e. CC )
17 mulcl 8126 . . . . . . . 8 |- ( ( C e. CC /\ B e. CC ) -> ( C x. B ) e. CC )
18 negdi 8403 . . . . . . . 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 2265 . . . . . 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 566 . . . . 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 591 . . . 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 6019 . . 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 8126 . . . . . 6 |- ( ( A e. CC /\ C e. CC ) -> ( A x. C ) e. CC )
25 mulcl 8126 . . . . . . 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 8124 . . . . . 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 590 . . . 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 8124 . . . . . 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 591 . . . 4 |- ( ( ( A e. CC /\ B e. CC ) /\ ( C e. CC /\ D e. CC ) ) -> ( ( A x. D ) + ( C x. B ) ) e. CC )
3429, 33negsubd 8463 . . 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 2266 . 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 2264 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
Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   e. wcel 2200  (class class class)co 6001   CCcc 7997   + caddc 8002   x. cmul 8004   - cmin 8317   -ucneg 8318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-setind 4629  ax-resscn 8091  ax-1cn 8092  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-iota 5278  df-fun 5320  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-sub 8319  df-neg 8320
This theorem is referenced by:  mulsubd  8563  muleqadd  8815  addltmul  9348  sqabssub  11567
  Copyright terms: Public domain W3C validator