Translate the following inference to logic notation: If Linda were a carpenter, then Robert is happy. For all x, z is not happy. If Robert were happy, then Linda is a carpenter. Therefore Linda is not a carpenter.
p -> P(a). forall x: ~P(x). P(a) -> p. Therefore ~p.