proposition: Lemma label_poststate_clock: forall (s s': State)(l: Label), (step s l s' /\ label_is_put l) -> label_clock l = clock_state (node_states s' (label_node l)).
proof: Proof. intros. open_conjs. inversion H. simpl in *. simpl_override. simpl. reflexivity. subst l. unfold label_is_put in H0. contradiction. subst l. unfold label_is_put in H0. contradiction. subst l. unfold label_is_put in H0. contradiction. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)