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