Translate the following inference to logic notation: Jennifer is not happy. If Barbara goes running, then Jennifer is sad. For all x, x_9 is happy if and only if x_9 is sad. If Jennifer were sad, then Barbara is running. Therefore Barbara is not running.
~P(a). p -> Q(a). forall x: P(x) <-> Q(x). Q(a) -> p. Therefore ~p.