Translate the following inference to logic notation: Thomas is curious if and only if Joseph is running. For all x, x will not make tea. If Thomas were curious, then Joseph is making tea. Therefore Joseph is not running.
p <-> q. forall x: ~P(x). p -> P(a). Therefore ~q.