63inductive Reachable {n} (G : PropagationGraph n) (init : Set (Var n)) : Var n → Prop 64 | base : ∀ v, v ∈ init → Reachable G init v 65 | step : ∀ u v, Reachable G init u → G.edges u v → Reachable G init v 66 67/-- All variables are reachable from initial units. -/
used by (1)
From the project-wide theorem graph. These declarations reference this one in their body.