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