Metamath Proof Explorer


Theorem muladddid

Description: Distribute multiplication over a sum whose first term is a product, in deduction form. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

Ref Expression
Hypotheses muladddid.1
|- ( ph -> A e. CC )
muladddid.2
|- ( ph -> B e. CC )
muladddid.3
|- ( ph -> C e. CC )
Assertion muladddid
|- ( ph -> ( A x. ( ( B x. C ) + B ) ) = ( ( A x. ( B x. C ) ) + ( A x. B ) ) )

Proof

Step Hyp Ref Expression
1 muladddid.1
 |-  ( ph -> A e. CC )
2 muladddid.2
 |-  ( ph -> B e. CC )
3 muladddid.3
 |-  ( ph -> C e. CC )
4 2 3 mulcld
 |-  ( ph -> ( B x. C ) e. CC )
5 1 4 2 adddid
 |-  ( ph -> ( A x. ( ( B x. C ) + B ) ) = ( ( A x. ( B x. C ) ) + ( A x. B ) ) )