![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > joinlmuladdmuld | Structured version Visualization version GIF version |
Description: Join AB+CB into (A+C) on LHS. (Contributed by David A. Wheeler, 26-Oct-2019.) |
Ref | Expression |
---|---|
joinlmuladdmuld.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
joinlmuladdmuld.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
joinlmuladdmuld.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
joinlmuladdmuld.4 | ⊢ (𝜑 → ((𝐴 · 𝐵) + (𝐶 · 𝐵)) = 𝐷) |
Ref | Expression |
---|---|
joinlmuladdmuld | ⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | joinlmuladdmuld.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
2 | joinlmuladdmuld.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
3 | joinlmuladdmuld.2 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
4 | 1, 2, 3 | adddird 11315 | . 2 ⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = ((𝐴 · 𝐵) + (𝐶 · 𝐵))) |
5 | joinlmuladdmuld.4 | . 2 ⊢ (𝜑 → ((𝐴 · 𝐵) + (𝐶 · 𝐵)) = 𝐷) | |
6 | 4, 5 | eqtrd 2780 | 1 ⊢ (𝜑 → ((𝐴 + 𝐶) · 𝐵) = 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2108 (class class class)co 7448 ℂcc 11182 + caddc 11187 · cmul 11189 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-addcl 11244 ax-mulcom 11248 ax-distr 11251 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-iota 6525 df-fv 6581 df-ov 7451 |
This theorem is referenced by: 1p1times 11461 div4p1lem1div2 12548 ltdifltdiv 13885 discr1 14288 arisum 15908 bezoutlem3 16588 bezoutlem4 16589 mbfi1fseqlem4 25773 itgmulc2 25889 tangtx 26565 binom4 26911 axcontlem8 29004 zringfrac 33547 constrrtcclem 33725 int-rightdistd 44142 fmtnorec2lem 47416 joinlmuladdmuli 48867 |
Copyright terms: Public domain | W3C validator |