Theorem joinlmuladdmuld 11336

Description: Join AB+CB into (A+C) on LHS. (Contributed by David A. Wheeler, 26-Oct-2019.)

Hypotheses

Ref	Expression
joinlmuladdmuld.1	⊢ (𝜑 → 𝐴 ∈ ℂ)
joinlmuladdmuld.2	⊢ (𝜑 → 𝐵 ∈ ℂ)
joinlmuladdmuld.3	⊢ (𝜑 → 𝐶 ∈ ℂ)
joinlmuladdmuld.4	⊢ (𝜑 → ((𝐴 · 𝐵) + (𝐶 · 𝐵)) = 𝐷)

Assertion

Ref	Expression
joinlmuladdmuld	⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = 𝐷)

Proof of Theorem joinlmuladdmuld

Step	Hyp	Ref	Expression
1		joinlmuladdmuld.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ)
2		joinlmuladdmuld.3	. . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ)
3		joinlmuladdmuld.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ)
4	1, 2, 3	adddird 11334	. 2 ⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = ((𝐴 · 𝐵) + (𝐶 · 𝐵)))
5		joinlmuladdmuld.4	. 2 ⊢ (𝜑 → ((𝐴 · 𝐵) + (𝐶 · 𝐵)) = 𝐷)
6	4, 5	eqtrd 2796	1 ⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = 𝐷)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  (class class class)co 7420  ℂcc 11198   + caddc 11203   · cmul 11205

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-addcl 11260  ax-mulcom 11264  ax-distr 11267

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6494  df-fv 6546  df-ov 7423

This theorem is used by:  1p1times  11481  div4p1lem1div2  12601  ltdifltdiv  13974  discr1  14383  arisum  16029  bezoutlem3  16714  bezoutlem4  16715  mbfi1fseqlem4  26039  itgmulc2  26154  tangtx  26834  binom4  27178  axcontlem8  29549  zringfrac  34086  constrrtcclem  34366  cos9thpiminplylem2  34415  quadfac  43255  int-rightdistd  45179  sin5tlem4  47921  fmtnorec2lem  48626  joinlmuladdmuli  50868