Translate the following inference to logic notation: There is at least one x for which x will play tennis if and only if x is curious. For all x, x will play tennis if and only if x will take a plane. Therefore there is at least one x for which if x takes a plane, then x is curious.
exists x: P(x) <-> Q(x). forall x: P(x) <-> R(x). Therefore exists x: R(x) -> Q(x).