Associative Property of Multiplication 2
Division Theorem
Substitution 15
Transitive Property Application 1
Substitution 10
Reorder Terms 7
Transitive Property of Equality Variation 2
Reorder Terms 8
Inverse Example
Manipulation

Proof: Inverse Example

Let's prove the following theorem:

((s ⋅ s) ⋅ (1 / 2)) ⋅ (1 / 2) = (s / 2) ⋅ (s / 2)

Proof:

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

Proof Table
# Claim Reason
1 s ⋅ (1 / 2) = s / 2 s ⋅ (1 / 2) = s / 2
2 (s ⋅ (1 / 2)) ⋅ (s ⋅ (1 / 2)) = (s / 2) ⋅ (s / 2) if s ⋅ (1 / 2) = s / 2, then (s ⋅ (1 / 2)) ⋅ (s ⋅ (1 / 2)) = (s / 2) ⋅ (s / 2)
3 (s ⋅ (1 / 2)) ⋅ (s ⋅ (1 / 2)) = ((s ⋅ s) ⋅ (1 / 2)) ⋅ (1 / 2) (s ⋅ (1 / 2)) ⋅ (s ⋅ (1 / 2)) = ((s ⋅ s) ⋅ (1 / 2)) ⋅ (1 / 2)
4 ((s ⋅ s) ⋅ (1 / 2)) ⋅ (1 / 2) = (s / 2) ⋅ (s / 2) if (s ⋅ (1 / 2)) ⋅ (s ⋅ (1 / 2)) = (s / 2) ⋅ (s / 2) and (s ⋅ (1 / 2)) ⋅ (s ⋅ (1 / 2)) = ((s ⋅ s) ⋅ (1 / 2)) ⋅ (1 / 2), then ((s ⋅ s) ⋅ (1 / 2)) ⋅ (1 / 2) = (s / 2) ⋅ (s / 2)
Previous Lesson Next Lesson

Comments

Please log in to add comments