proposition: Lemma prime11971 : prime 11971.
proof: Proof. apply (Pocklington_refl (Pock_certif 11971 10 ((3, 2)::(2,1)::nil) 12) ((Proof_certif 3 prime3) :: (Proof_certif 3 prime3) :: (Proof_certif 2 prime2) :: nil)). enc (refl_equal true). Qed.
imports: List ZArith Coqprime(ZCAux) Pock