Translate the following inference to logic notation: For all x, y is not a lawyer. For all x, if y were a lawyer, then y is working. For all x, if y works, then y is a lawyer. If it is sunny, then Linda is working. Therefore it is not sunny.
forall x: ~P(x). forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). p -> Q(a). Therefore ~p.