proposition: Fact ra_bs_c_correct k (f : recalg k) v x : [|f|] v x <-> exists c, [f ; v ; 0 ; c] ▹ x.
proof: Proof. rewrite ra_bs_correct; split; auto. intros (c & H); revert H; apply ra_bs_from_c. Qed.
imports: Undecidability.H10(H10 dio_single dio_logic) Undecidability.L.Datatypes(LNat LOptions LSum) Undecidability.L(Tactics.LTactics Computability.MuRec Computability.Synthetic Tactics.GenEncode) Undecidability.Shared(DLW.Utils.finite DLW.Vec.vec DLW.Vec.pos) Undecidability.MuRec(MuRec recalg ra_sem_eq)