Metamath Proof Explorer


Theorem adddirevi

Description: Distribute multiplication over a sum and reverse the two resulting summands. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

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

Proof

Step Hyp Ref Expression
1 adddirevi.1
 |-  A e. CC
2 adddirevi.2
 |-  B e. CC
3 adddirevi.3
 |-  C e. CC
4 1 2 3 adddii
 |-  ( A x. ( B + C ) ) = ( ( A x. B ) + ( A x. C ) )
5 1 2 mulcli
 |-  ( A x. B ) e. CC
6 1 3 mulcli
 |-  ( A x. C ) e. CC
7 5 6 addcomi
 |-  ( ( A x. B ) + ( A x. C ) ) = ( ( A x. C ) + ( A x. B ) )
8 4 7 eqtri
 |-  ( A x. ( B + C ) ) = ( ( A x. C ) + ( A x. B ) )