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

Theorem joinlmuladdmuld 8206
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 8204 . 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 1397    e. wcel 2202  (class class class)co 6017   CCcc 8029    + caddc 8034    x. cmul 8036
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213  ax-addcl 8127  ax-mulcom 8132  ax-distr 8135
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-iota 5286  df-fv 5334  df-ov 6020
This theorem is referenced by:  div4p1lem1div2  9397  arisum  12058  tangtx  15561  binom4  15702
  Copyright terms: Public domain W3C validator