Hint Resolve liftConstant_eval : Recurrence.
Hint Rewrite liftConstant_eval : Recurrence.

(** Most basic theorem, show how to unfold BR execution *)
Lemma evalBR_step: forall `{Ring R} (r0: R) (bop: R -> R -> R) (f: nat -> R) (n : nat),
({{r0, bop, f}}) # (S n) = bop ((mkBR r0 bop f) # n)  (f # (S n)).