Translate the following inference to logic notation: For all x, if x_5 plays tennis, then x_5 is bored. For all x, x_5 will drive a car or x_5 will play squash. For all x, x_5 will drive a car if and only if x_5 will play tennis. For all x, x_5 is not bored. Therefore for all x, x_5 will play squash.
forall x: P(x) -> Q(x). forall x: R(x) or S(x). forall x: R(x) <-> P(x). forall x: ~Q(x). Therefore forall x: S(x).