proposition: Lemma steps_det: forall p s1 s2 h, (step_star (init p) h s1 /\ step_star (init p) h s2) -> s1 = s2.
proof: Proof. intros. destruct H as [H1 H2]. eapply steps_det'. eassumption. apply init_msgid_inv. eassumption. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)