Translate the following inference to logic notation: For all x, x_7 is rich. For all x, x_7 is not rich or x_7 is a bartender. For all x, x_7 is a bartender if and only if x_7 will take a plane. There is at least one x for which if x_7 were fast, then x_7 is taking a plane. Therefore there is at least one x for which x_7 will take a plane.
forall x: P(x). forall x: ~P(x) or Q(x). forall x: Q(x) <-> R(x). exists x: S(x) -> R(x). Therefore exists x: R(x).