  We present a new inductive rule for verifying lower bounds on expected values
of random variables after execution of probabilistic loops as well as on their
expected runtimes. Our rule is simple in the sense that loop body semantics
need to be applied only finitely often in order to verify that the candidates
are indeed lower bounds. In particular, it is not necessary to find the limit
of a sequence as in many previous rules.
