Translate the following inference to logic notation: For all x, x_8 will work if and only if x_8 will play tennis. There is at least one x for which x_8 will work if and only if x_8 will make tea. Therefore there is at least one x for which if x_8 plays tennis, then x_8 is making tea.
forall x: P(x) <-> Q(x). exists x: P(x) <-> R(x). Therefore exists x: Q(x) -> R(x).