proposition: Fact prime_divides p q : prime p -> prime q -> p <d 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 sums)