proposition: Lemma prime19991 : prime 19991.
proof: Proof. apply (Pocklington_refl (Pock_certif 19991 11 ((1999, 1)::(2,1)::nil) 1) ((Proof_certif 1999 prime1999) :: (Proof_certif 2 prime2) :: nil)). enc (refl_equal true). Qed.
imports: List ZArith Coqprime(ZCAux) Pock