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