Translate the following inference to logic notation: For all x, if x_5 takes a plane, then x_5 is playing tennis. For all x, if x_5 plays tennis, then x_5 is taking a plane. For all x, if x_5 makes tea, then x_5 is taking a plane. There is at least one x for which x_5 will play tennis or x_5 will make tea. Therefore there is at least one x for which x_5 will take a plane.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: R(x) -> P(x). exists x: Q(x) or R(x). Therefore exists x: P(x).