proposition: Lemma InstExecToSeqExec: forall p h s, N.ICExec.StepStar.step_star (N.ICExec.init p) h s -> exists h' s', I.SExec.StepStar.step_star (I.SExec.init) h' s' /\ h' = inst_exec_eff_hist h.
proof: Proof. intros. apply InstExecToExec in H. destruct H as [p' [h' [s' [H1 H2]]]]. apply I.ExecToSeqExec in H1. destruct H1 as [h'' [s'' [H11 H12]]]. exists h''. exists s''. split. assumption. eapply eq_trans. eassumption. symmetry. assumption. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)