Translate the following inference to logic notation: For all x, if x_5 were bored, then x_5 is a musician. There is at least one x for which if x_5 were sad, then x_5 is bored. For all x, if x_5 were a musician, then x_5 is bored. For all x, x_5 is a musician or x_5 is sad. Therefore there is at least one x for which x_5 is bored.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: Q(x) -> P(x). forall x: Q(x) or R(x). Therefore exists x: P(x).