proposition: Lemma R_easy : forall a b c, R (N.ICExec.inst_val a b c) c.
proof: Proof. unfold R; auto. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)