Metamath Proof Explorer


Theorem 2addmulrevcomi

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

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

Proof

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