Metamath Proof Explorer


Theorem mul1addcomi

Description: Remove a multiplicative identity inside a sum and interchange the summands. Proof prepared with AI assistance from OpenAI Codex. (Contributed by Owen Orger, 11-Nov-2026)

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

Proof

Step Hyp Ref Expression
1 mul1addcomi.1
 |-  A e. CC
2 mul1addcomi.2
 |-  B e. CC
3 1 mulridi
 |-  ( A x. 1 ) = A
4 3 oveq1i
 |-  ( ( A x. 1 ) + B ) = ( A + B )
5 1 2 addcomi
 |-  ( A + B ) = ( B + A )
6 4 5 eqtri
 |-  ( ( A x. 1 ) + B ) = ( B + A )