What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? Name the inference rule being used: forall x: R(x) -> T_3(x). exists x: S_3(x) -> W(x). forall x: S_3(x) or ~T_3(x). forall x: R(x) <-> W(x).
forall x: T_3(x) -> S_3(x) can be inferred via the universal rewriting rule. forall x: R(x) -> W(x) can be inferred via the universal biconditional elimination rule. forall x: W(x) -> R(x) can be inferred via the universal biconditional elimination rule.