proposition: Theorem prime_2333 : ~(exists k:nat, k <> 1 /\ k <> 2333 /\ (exists q:nat, 2333 = q*k)).
proof: Proof. Time apply check_correct; auto with arith. Time Qed. Theorem reflection_test : forall x y z t u:nat, x+(y+z+(t+u)) = x+y+(z+(t+u)). Proof. intros; repeat rewrite Nat.add_assoc; auto. Qed.
imports: ZArith List Arith Lia Zwf Relations Inverse_Image Transitive_Closure Zdiv