proposition: Lemma prime_neq_0 p : prime p -> p <> 0.
proof: Proof. intros ? % prime_ge_2; lia. Qed.
imports: List Arith Lia Bool Permutation Undecidability.Shared.Libs.DLW(utils utils_tac utils_list utils_nat gcd rel_iter prime pos vec)