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) <-> S(y). forall y: T(y) or ~S(y).
forall y: S(y) -> T(y) can be inferred via the universal rewriting rule. forall y: T(y) -> S(y) can be inferred via the universal biconditional elimination rule. forall y: S(y) -> T(y) can be inferred via the universal biconditional elimination rule.