ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulsub Unicode version
Theorem mulsub 8444
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 8291 . . 3 |- ( ( A e. CC /\ B e. CC ) -> ( A + -u B ) = ( A - B ) )
2 negsub 8291 . . 3 |- ( ( C e. CC /\ D e. CC ) -> ( C + -u D ) = ( C - D ) )
31, 2oveqan12d 5944 . 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 8243 . . . 4 |- ( B e. CC -> -u B e. CC )
5 negcl 8243 . . . . 5 |- ( D e. CC -> -u D e. CC )
6 muladd 8427 . . . . 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 8441 . . . . . . 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 5941 . . . . 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 8439 . . . . . . . 8 |- ( ( A e. CC /\ D e. CC ) -> ( A x. -u D ) = -u ( A x. D ) )
14 mulneg2 8439 . . . . . . . 8 |- ( ( C e. CC /\ B e. CC ) -> ( C x. -u B ) = -u ( C x. B ) )
1513, 14oveqan12d 5944 . . . . . . 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 8023 . . . . . . . 8 |- ( ( A e. CC /\ D e. CC ) -> ( A x. D ) e. CC )
17 mulcl 8023 . . . . . . . 8 |- ( ( C e. CC /\ B e. CC ) -> ( C x. B ) e. CC )
18 negdi 8300 . . . . . . . 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 2232 . . . . . 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 589 . . . 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 5943 . . 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 8023 . . . . . 6 |- ( ( A e. CC /\ C e. CC ) -> ( A x. C ) e. CC )
25 mulcl 8023 . . . . . . 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 8021 . . . . . 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 588 . . . 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 8021 . . . . . 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 589 . . . 4 |- ( ( ( A e. CC /\ B e. CC ) /\ ( C e. CC /\ D e. CC ) ) -> ( ( A x. D ) + ( C x. B ) ) e. CC )
3429, 33negsubd 8360 . . 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 2233 . 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 2231 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 1364   e. wcel 2167  (class class class)co 5925   CCcc 7894   + caddc 7899   x. cmul 7901   - cmin 8214   -ucneg 8215
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-setind 4574  ax-resscn 7988  ax-1cn 7989  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-mulcom 7997  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-sub 8216  df-neg 8217
This theorem is referenced by:  mulsubd  8460  muleqadd  8712  addltmul  9245  sqabssub  11238
  Copyright terms: Public domain W3C validator