Translate the following inference to logic notation: For all x, x_9 is not a carpenter. For all x, x_9 will sleep if and only if x_9 is a carpenter. If Jennifer were bored, then Richard is sleeping. Therefore Jennifer is not bored.
forall x: ~P(x). forall x: Q(x) <-> P(x). p -> Q(a). Therefore ~p.