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