Metamath Proof Explorer


Theorem rmxneg

Description: Negation law (even function) for the X sequence. The method of proof used for the previous four theorems rmxyneg , rmxyadd , rmxy0 , and rmxy1 via qirropth results in two theorems at once, but typical use requires only one, so this group of theorems serves to separate the cases. (Contributed by Stefan O'Rear, 22-Sep-2014)

Ref Expression
Assertion rmxneg ( ( 𝐴 ∈ ( ℤ ‘ 2 ) ∧ 𝑁 ∈ ℤ ) → ( 𝐴 Xrm - 𝑁 ) = ( 𝐴 Xrm 𝑁 ) )

Proof

Step Hyp Ref Expression
1 rmxyneg ( ( 𝐴 ∈ ( ℤ ‘ 2 ) ∧ 𝑁 ∈ ℤ ) → ( ( 𝐴 Xrm - 𝑁 ) = ( 𝐴 Xrm 𝑁 ) ∧ ( 𝐴 Yrm - 𝑁 ) = - ( 𝐴 Yrm 𝑁 ) ) )
2 1 simpld ( ( 𝐴 ∈ ( ℤ ‘ 2 ) ∧ 𝑁 ∈ ℤ ) → ( 𝐴 Xrm - 𝑁 ) = ( 𝐴 Xrm 𝑁 ) )