Translate the following inference to logic notation: For all x, x_12 will make tea if and only if x_12 will work. For all x, if x_12 were happy, then x_12 is working. For all x, x_12 will not make tea. Thomas is happy or Jessica is a lawyer. Therefore Jessica is a lawyer.
forall x: P(x) <-> Q(x). forall x: R(x) -> Q(x). forall x: ~P(x). R(a) or p. Therefore p.