proposition: Lemma prime_divides p q : prime p -> prime q -> divides p q -> p = q.
proof: Proof. now intros Hp Hq [ [] % Hp | ] % Hq. Qed.
imports: List Arith Lia Bool Permutation Undecidability.Shared.Libs.DLW(utils utils_tac utils_list utils_nat gcd rel_iter prime pos vec)