Move Terms Around

Proof: Move Terms Around

Let's prove the following theorem:

if n ⋅ p = m, then m = p ⋅ n

Proof:

View as a tree | View dependent proofs | Try proving it

Given
1 n ⋅ p = m
Proof Table
# Claim Reason
1 m = n ⋅ p if n ⋅ p = m, then m = n ⋅ p
2 n ⋅ p = p ⋅ n n ⋅ p = p ⋅ n
3 m = p ⋅ n if n ⋅ p = p ⋅ n and m = n ⋅ p, then m = p ⋅ n

Comments

Please log in to add comments