Theorem joinlmuladdmuld 11263

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 11261	. 2 ⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = ((𝐴 · 𝐵) + (𝐶 · 𝐵)))
5		joinlmuladdmuld.4	. 2 ⊢ (𝜑 → ((𝐴 · 𝐵) + (𝐶 · 𝐵)) = 𝐷)
6	4, 5	eqtrd 2795	1 ⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = 𝐷)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  (class class class)co 7414  ℂcc 11125   + caddc 11130   · cmul 11132

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 2732  ax-addcl 11187  ax-mulcom 11191  ax-distr 11194

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 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  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 6489  df-fv 6541  df-ov 7417

This theorem is used by:  1p1times  11408  div4p1lem1div2  12526  ltdifltdiv  13898  discr1  14306  arisum  15952  bezoutlem3  16634  bezoutlem4  16635  mbfi1fseqlem4  25949  itgmulc2  26064  tangtx  26746  binom4  27090  axcontlem8  29431  zringfrac  33967  constrrtcclem  34247  cos9thpiminplylem2  34296  quadfac  43074  int-rightdistd  45023  sin5tlem4  47743  fmtnorec2lem  48448  joinlmuladdmuli  50705