proposition: Lemma prime11069 : prime 11069.
proof: Proof. apply (Pocklington_refl (Pock_certif 11069 2 ((2767, 1)::(2,2)::nil) 1) ((Proof_certif 2767 prime2767) :: (Proof_certif 2 prime2) :: nil)). enc (refl_equal true). Qed.
imports: List ZArith Coqprime(ZCAux) Pock