Translate the following inference to logic notation: There is at least one x for which x_7 is a lawyer or x_7 is not curious. For all x, x_7 will take a plane. For all x, if x_7 takes a plane, then x_7 is curious. Therefore there is at least one x for which x_7 is a lawyer.
exists x: P(x) or ~Q(x). forall x: R(x). forall x: R(x) -> Q(x). Therefore exists x: P(x).