Translate the following inference to logic notation: For all x, x is excited if and only if x is curious. For all x, x is excited or x will not play tennis. Therefore for all x, if x plays tennis, then x is curious.
forall x: P(x) <-> Q(x). forall x: P(x) or ~R(x). Therefore forall x: R(x) -> Q(x).