Translate the following inference to logic notation: For all x, x_1 will not work. If Jessica doesn't climb a mountain, then Thomas is a poet. Jessica is climbing a mountain if and only if Barbara is working. Therefore Thomas is a poet.
forall x: ~P(x). ~p -> q. p <-> P(a). Therefore q.