Translate the following inference to logic notation: There is at least one x for which z is not a lawyer. For all x, z is a lawyer or z will make tea. Therefore there is at least one x for which z will make tea.
exists x: ~P(x). forall x: P(x) or Q(x). Therefore exists x: Q(x).