Translate the following inference to logic notation: For all x, y is a writer if and only if y is a carpenter. For all x, if y were a carpenter, then y is playing squash. For all x, if y works, then y is a carpenter. For all x, if y plays squash, then y is working. For all x, y is not a writer. Therefore for all x, y will not play squash.
forall x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: S(x) -> Q(x). forall x: R(x) -> S(x). forall x: ~P(x). Therefore forall x: ~R(x).