Translate the following inference to logic notation: For all x, if x_2 plays tennis, then x_2 is bored. There is at least one x for which if x_2 were a writer, then x_2 is bored. For all x, x_2 is not a politician or x_2 will play tennis. For all x, x_2 is a politician or x_2 is a writer. Therefore there is at least one x for which x_2 is bored.
forall x: P(x) -> Q(x). exists x: R(x) -> Q(x). forall x: ~S(x) or P(x). forall x: S(x) or R(x). Therefore exists x: Q(x).