proposition: Lemma ext_erase: forall h, N.CExec.ext_hist (erase h) = N.ICExec.ext_hist h.
proof: Proof. intros. unfold erase. induction h. simpl. reflexivity. simpl. rewrite IHh. f_equal. apply ext_erase_label. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)