Translate the following inference to logic notation: For all x, if x_1 were a janitor, then x_1 is taking a plane. For all x, if x_1 were happy, then x_1 is taking a plane. For all x, x_1 is rich or x_1 is a janitor. For all x, if x_1 were rich, then x_1 is happy. Therefore for all x, x_1 will take a plane.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: S(x) or P(x). forall x: S(x) -> R(x). Therefore forall x: Q(x).