Translate the following inference to logic notation: For all x, x_7 will go running if and only if x_7 is bored. For all x, x_7 will play tennis if and only if x_7 is bored. For all x, x_7 will cook if and only if x_7 will go running. For all x, x_7 will not cook. Therefore for all x, x_7 will not play tennis.
forall x: P(x) <-> Q(x). forall x: R(x) <-> Q(x). forall x: S(x) <-> P(x). forall x: ~S(x). Therefore forall x: ~R(x).