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