Metamath Proof Explorer


Theorem nvadd4

Description: Rearrangement of 4 terms in a vector sum. (Contributed by NM, 8-Feb-2008) (New usage is discouraged.)

Ref Expression
Hypotheses nvgcl.1 𝑋 = ( BaseSet ‘ 𝑈 )
nvgcl.2 𝐺 = ( +𝑣𝑈 )
Assertion nvadd4 ( ( 𝑈 ∈ NrmCVec ∧ ( 𝐴𝑋𝐵𝑋 ) ∧ ( 𝐶𝑋𝐷𝑋 ) ) → ( ( 𝐴 𝐺 𝐵 ) 𝐺 ( 𝐶 𝐺 𝐷 ) ) = ( ( 𝐴 𝐺 𝐶 ) 𝐺 ( 𝐵 𝐺 𝐷 ) ) )

Proof

Step Hyp Ref Expression
1 nvgcl.1 𝑋 = ( BaseSet ‘ 𝑈 )
2 nvgcl.2 𝐺 = ( +𝑣𝑈 )
3 2 nvablo ( 𝑈 ∈ NrmCVec → 𝐺 ∈ AbelOp )
4 1 2 bafval 𝑋 = ran 𝐺
5 4 ablo4 ( ( 𝐺 ∈ AbelOp ∧ ( 𝐴𝑋𝐵𝑋 ) ∧ ( 𝐶𝑋𝐷𝑋 ) ) → ( ( 𝐴 𝐺 𝐵 ) 𝐺 ( 𝐶 𝐺 𝐷 ) ) = ( ( 𝐴 𝐺 𝐶 ) 𝐺 ( 𝐵 𝐺 𝐷 ) ) )
6 3 5 syl3an1 ( ( 𝑈 ∈ NrmCVec ∧ ( 𝐴𝑋𝐵𝑋 ) ∧ ( 𝐶𝑋𝐷𝑋 ) ) → ( ( 𝐴 𝐺 𝐵 ) 𝐺 ( 𝐶 𝐺 𝐷 ) ) = ( ( 𝐴 𝐺 𝐶 ) 𝐺 ( 𝐵 𝐺 𝐷 ) ) )