Translate the following inference to logic notation: For all x, if x_10 takes a plane, then x_10 is bored. For all x, if x_10 writes a letter, then x_10 is bored. For all x, x_10 will not listen to a song or x_10 will make tea. For all x, x_10 will listen to a song or x_10 will take a plane. For all x, x_10 will write a letter if and only if x_10 will make tea. Therefore for all x, x_10 is bored.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). forall x: ~S(x) or T(x). forall x: S(x) or P(x). forall x: R(x) <-> T(x). Therefore forall x: Q(x).