Translate the following inference to logic notation: For all x, x_2 will cook or x_2 is not a mechanic. There is at least one x for which x_2 is a mechanic. Therefore there is at least one x for which x_2 will cook.
forall x: P(x) or ~Q(x). exists x: Q(x). Therefore exists x: P(x).