proposition: Theorem fractran_computable_diophantine n l : 𝔻R (fun ν => exists j, fractran_eval l (ps 1 * exp 2 (fun2vec 1 n ν)) (j * qs 1 ^ (ν 0)) /\ ~ divides (qs 1) j).
proof: Proof. dio auto. eapply fractran_eval_diophantine. Qed.
imports: List Arith Undecidability.Shared.Libs(utils_tac utils_list sums rel_iter gcd pos vec) Undecidability.FRACTRAN(FRACTRAN fractran_utils prime_seq) Undecidability.H10.Dio(dio_logic dio_bounded dio_rt_closure dio_single dio_expo)