Help please!

Question 2161 Consider the following theorem: For all integers a, b and c, ifa does not divide (b - c) then a does not divide b or a does not divide c a. Translate this theorem into predicate logic. You may use the following predicate Divides(x, y): x divides y b. Prove the theorem using an indirect proof (that is, you must use either proof by contradiction, or prove a statement that is logically equivalences to the original theorem statement)