proposition: Lemma closure_of_run_rw {p} {f}: ClosureOf f p -> forall j i b, Run (Call (p j) i) b <-> Run (f j i) b.
proof: Proof. unfold ClosureOf. intuition. - apply H. inversion_clear H0. assumption. - constructor. apply H. assumption. Qed.
imports: Coq.Setoids.Setoid Coq.Bool.Bool Coq.Logic.Classical_Prop