Translate the following inference to logic notation: For all x, x_9 will work. Patricia is not cooking. Thomas is working if and only if Patricia is cooking. Therefore Thomas is bored.
forall x: P(x). ~p. P(a) <-> p. Therefore Q(a).