proposition: Lemma equal_collect: forall a b, a==b -> forall acc, collect (clean a) acc [=] collect (clean b) acc.
proof: Proof. intros a b H. induction H; intro acc; simpl in *; RegExp.destruct_tests; simpl in*; auto; try contradict. rewrite (collect_com (clean z)). rewrite collect_idem. reflexivity. rewrite 2 (collect_com (clean y)). rewrite collect_idem. auto. rewrite IHequal1, IHequal2. reflexivity. rewrite IHequal1, IHequal2. reflexivity. rewrite IHequal1. apply IHequal2. symmetry. apply IHequal. Qed.
imports: ATBR(Common) ATBR(Classes) ATBR(Graph) ATBR(DKA_Definitions) ATBR(StrictStarForm)