Metamath Proof Explorer


Theorem 2muladdrevcomi

Description: Reverse the order of two products in a sum and interchange the factors within each product. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

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

Proof

Step Hyp Ref Expression
1 2muladdrevcomi.1
 |-  A e. CC
2 2muladdrevcomi.2
 |-  B e. CC
3 2muladdrevcomi.3
 |-  C e. CC
4 2muladdrevcomi.4
 |-  D e. CC
5 1 2 mulcli
 |-  ( A x. B ) e. CC
6 3 4 mulcli
 |-  ( C x. D ) e. CC
7 5 6 addcomi
 |-  ( ( A x. B ) + ( C x. D ) ) = ( ( C x. D ) + ( A x. B ) )
8 3 4 mulcomi
 |-  ( C x. D ) = ( D x. C )
9 1 2 mulcomi
 |-  ( A x. B ) = ( B x. A )
10 8 9 oveq12i
 |-  ( ( C x. D ) + ( A x. B ) ) = ( ( D x. C ) + ( B x. A ) )
11 7 10 eqtri
 |-  ( ( A x. B ) + ( C x. D ) ) = ( ( D x. C ) + ( B x. A ) )