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 ⊢ 𝐴 ∈ ℂ
2muladdrevcomi.2 ⊢ 𝐵 ∈ ℂ
2muladdrevcomi.3 ⊢ 𝐶 ∈ ℂ
2muladdrevcomi.4 ⊢ 𝐷 ∈ ℂ
Assertion 2muladdrevcomi ( ( 𝐴 · 𝐵 ) + ( 𝐶 · 𝐷 ) ) = ( ( 𝐷 · 𝐶 ) + ( 𝐵 · 𝐴 ) )

Proof

Step Hyp Ref Expression
1 2muladdrevcomi.1 ⊢ 𝐴 ∈ ℂ
2 2muladdrevcomi.2 ⊢ 𝐵 ∈ ℂ
3 2muladdrevcomi.3 ⊢ 𝐶 ∈ ℂ
4 2muladdrevcomi.4 ⊢ 𝐷 ∈ ℂ
5 1 2 mulcli ⊢ ( 𝐴 · 𝐵 ) ∈ ℂ
6 3 4 mulcli ⊢ ( 𝐶 · 𝐷 ) ∈ ℂ
7 5 6 addcomi ⊢ ( ( 𝐴 · 𝐵 ) + ( 𝐶 · 𝐷 ) ) = ( ( 𝐶 · 𝐷 ) + ( 𝐴 · 𝐵 ) )
8 3 4 mulcomi ⊢ ( 𝐶 · 𝐷 ) = ( 𝐷 · 𝐶 )
9 1 2 mulcomi ⊢ ( 𝐴 · 𝐵 ) = ( 𝐵 · 𝐴 )
10 8 9 oveq12i ⊢ ( ( 𝐶 · 𝐷 ) + ( 𝐴 · 𝐵 ) ) = ( ( 𝐷 · 𝐶 ) + ( 𝐵 · 𝐴 ) )
11 7 10 eqtri ⊢ ( ( 𝐴 · 𝐵 ) + ( 𝐶 · 𝐷 ) ) = ( ( 𝐷 · 𝐶 ) + ( 𝐵 · 𝐴 ) )