proposition: Lemma label_poststate_state: forall (s s': State)(l: Label), step s l s' -> label_post_state l = alg_state (node_states s' (label_node l)).
proof: Proof. intros. inversion H; clear H; simpl in *; simpl_override; simpl; reflexivity. Qed.
imports: Coq(FunctionalExtensionality Arith Lia) Coq(Arith.Peano_dec Arith.Compare_dec) Coq(Relations.Relation_Operators) Coq(List) Chapar(Predefs)