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