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