Translate the following inference to logic notation: William is not rich. For all x, if z works, then z is rich. For all x, z will work or z is not rich. Therefore William is not working.
~P(a). forall x: Q(x) -> P(x). forall x: Q(x) or ~P(x). Therefore ~Q(a).