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 y: T(y) -> W_3(y). forall y: S_1(y) <-> T(y). forall y: W_3(y) -> T(y). forall y: ~U(y) or W_4(y). forall y: U(y) or W_3(y). forall y: ~S_1(y).
forall y: W_3(y) or W_4(y) can be inferred via the universal resolution rule. forall y: T(y) <-> W_3(y) can be inferred via the universal biconditional introduction rule. forall y: W_3(y) <-> T(y) can be inferred via the universal biconditional introduction rule. forall y: S_1(y) -> T(y) can be inferred via the universal biconditional elimination rule. forall y: T(y) -> S_1(y) can be inferred via the universal biconditional elimination rule. forall y: ~T(y) can be inferred via the universal biconditional elimination rule.