Translate the following inference to logic notation: For all x, x_8 is a sailor. For all x, if x_8 were rich, then x_8 is a sailor. There is at least one x for which if x_8 were a sailor, then x_8 is driving a car. For all x, if x_8 drives a car, then x_8 is rich. Therefore there is at least one x for which x_8 is rich.
forall x: P(x). forall x: Q(x) -> P(x). exists x: P(x) -> R(x). forall x: R(x) -> Q(x). Therefore exists x: Q(x).