proposition: Lemma epsilon_empty: forall i j, ~ epsilon empty i j.
proof: Proof. intros i j F. apply StateSet.mem_2 in F. unfold_defs F. StateMapProps.find_analyse. simpl in *. revert H. StateMapProps.map_iff. tauto. apply StateSet.empty_1 in F. auto. Qed.
imports: ATBR(Common) ATBR(Classes) ATBR(Graph) ATBR(Monoid) ATBR(SemiLattice) ATBR(SemiRing) ATBR(KleeneAlgebra) ATBR(MxGraph) ATBR(MxSemiLattice) ATBR(MxSemiRing) ATBR(MxKleeneAlgebra) ATBR(DKA_Definitions) ATBR(DKA_CheckLabels) ATBR(StrictStarForm) ATBR(Utils_WF) Coq(Relations)