Translate the following inference to logic notation: For all x, x will make tea if and only if x will play tennis. For all x, if x plays tennis, then x is making tea. For all x, if x makes tea, then x is playing tennis. Therefore for all x, if x makes tea, then x is playing tennis.
forall x: P(x) <-> Q(x). forall x: Q(x) -> P(x). forall x: P(x) -> Q(x). Therefore forall x: P(x) -> Q(x).