Translate the following inference to logic notation: For all x, x is a mechanic or x will not make tea. There is at least one x for which x will make tea or x is not a mechanic. Therefore there is at least one x for which x is a mechanic if and only if x will make tea.
forall x: P(x) or ~Q(x). exists x: Q(x) or ~P(x). Therefore exists x: P(x) <-> Q(x).