Remove last remaining assumption for correctness

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
2024-05-10 21:30:56 -07:00
parent 04bafb2d55
commit 5f946de5e8
2 changed files with 4 additions and 2 deletions
--- a/Language.agda
+++ b/Language.agda
@@ -84,6 +84,10 @@ record Program : Set where
    incoming : State → List State
    incoming = predecessors graph

+    initialState-pred-∅ : incoming initialState ≡ []
+    initialState-pred-∅ =
+        wrap-preds-∅ (buildCfg rootStmt) initialState (RelAny.here refl)
+
    edge⇒incoming : ∀ {s₁ s₂ : State} → (s₁ , s₂) ListMem.∈ (Graph.edges graph) →
                    s₁ ListMem.∈ (incoming s₂)
    edge⇒incoming = edge⇒predecessor graph