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

Theorem joinlmuladdmuld 8266
Description: Join AB+CB into (A+C) on LHS. (Contributed by David A. Wheeler, 26-Oct-2019.)
Hypotheses
Ref Expression
joinlmuladdmuld.1  |-  ( ph  ->  A  e.  CC )
joinlmuladdmuld.2  |-  ( ph  ->  B  e.  CC )
joinlmuladdmuld.3  |-  ( ph  ->  C  e.  CC )
joinlmuladdmuld.4  |-  ( ph  ->  ( ( A  x.  B )  +  ( C  x.  B ) )  =  D )
Assertion
Ref Expression
joinlmuladdmuld  |-  ( ph  ->  ( ( A  +  C )  x.  B
)  =  D )

Proof of Theorem joinlmuladdmuld
StepHypRef Expression
1 joinlmuladdmuld.1 . . 3  |-  ( ph  ->  A  e.  CC )
2 joinlmuladdmuld.3 . . 3  |-  ( ph  ->  C  e.  CC )
3 joinlmuladdmuld.2 . . 3  |-  ( ph  ->  B  e.  CC )
41, 2, 3adddird 8264 . 2  |-  ( ph  ->  ( ( A  +  C )  x.  B
)  =  ( ( A  x.  B )  +  ( C  x.  B ) ) )
5 joinlmuladdmuld.4 . 2  |-  ( ph  ->  ( ( A  x.  B )  +  ( C  x.  B ) )  =  D )
64, 5eqtrd 2264 1  |-  ( ph  ->  ( ( A  +  C )  x.  B
)  =  D )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2202  (class class class)co 6028   CCcc 8090    + caddc 8095    x. cmul 8097
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-addcl 8188  ax-mulcom 8193  ax-distr 8196
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-iota 5293  df-fv 5341  df-ov 6031
This theorem is referenced by:  div4p1lem1div2  9457  arisum  12139  tangtx  15649  binom4  15790
  Copyright terms: Public domain W3C validator