proposition: Lemma init_msgid_inv: forall p, msgid_inv (init p).
proof: Proof. intros. unfold msgid_inv. simpl. split. constructor. apply Forall_forall. intros. simpl in H. contradiction. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)