Proof: Reorder Terms 8

Let's prove the following theorem:

Proof:

Proof Table

#	Claim	Reason
1	((a ⋅ b) ⋅ c) ⋅ d = (a ⋅ b) ⋅ (c ⋅ d)	((a ⋅ b) ⋅ c) ⋅ d = (a ⋅ b) ⋅ (c ⋅ d) (Associative Property of Multiplication)
2	((a ⋅ b) ⋅ c) ⋅ d = ((a ⋅ c) ⋅ b) ⋅ d	((a ⋅ b) ⋅ c) ⋅ d = ((a ⋅ c) ⋅ b) ⋅ d (reorder_terms_7)
3	(a ⋅ b) ⋅ (c ⋅ d) = ((a ⋅ c) ⋅ b) ⋅ d	if ((a ⋅ b) ⋅ c) ⋅ d = (a ⋅ b) ⋅ (c ⋅ d) and ((a ⋅ b) ⋅ c) ⋅ d = ((a ⋅ c) ⋅ b) ⋅ d, then (a ⋅ b) ⋅ (c ⋅ d) = ((a ⋅ c) ⋅ b) ⋅ d (Transitive Property of Equality Variation 2)

Comments

Please log in to add comments