Together with Lemma 3 and the final item definition, this means the final structure is an acyclic graph with all vertices reachable from vertex n. Next, we will show two properties that give intuition for the algorithm.
we will prove which rules add edges that are crossed in the final derivation.