proposition: Corollary dio_rel_rt x y : 𝔻F x -> 𝔻F y -> 𝔻R (fun ν => exists i, rel_iter R i (x ν) (y ν)).
proof: Proof. Proof using HR. intros; dio auto. Qed.
imports: Arith List Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list rel_iter sums) Undecidability.H10.Dio(dio_logic dio_expo dio_bounded)