Translate the following inference to logic notation: For all x, x_11 is excited if and only if x_11 will make tea. For all x, if x_11 drives a car, then x_11 is excited. For all x, x_11 will make tea if and only if x_11 is a soldier. For all x, x_11 is a soldier or x_11 will drive a car. Therefore for all x, x_11 will make tea.
forall x: P(x) <-> Q(x). forall x: R(x) -> P(x). forall x: Q(x) <-> S(x). forall x: S(x) or R(x). Therefore forall x: Q(x).