Theorem pockthi 12390

Description: Pocklington's theorem, which gives a sufficient criterion for a number N to be prime. This is the preferred method for verifying large primes, being much more efficient to compute than trial division. This form has been optimized for application to specific large primes; see pockthg 12389 for a more general closed-form version. (Contributed by Mario Carneiro, 2-Mar-2014.)

Hypotheses

Ref	Expression
pockthi.p	|- P e. Prime
pockthi.g	|- G e. NN
pockthi.m	|- M = ( G x. P )
pockthi.n	|- N = ( M + 1 )
pockthi.d	|- D e. NN
pockthi.e	|- E e. NN
pockthi.a	|- A e. NN
pockthi.fac	|- M = ( D x. ( P ^ E ) )
pockthi.gt	|- D < ( P ^ E )
pockthi.mod	|- ( ( A ^ M ) mod N ) = ( 1 mod N )
pockthi.gcd	|- ( ( ( A ^ G ) - 1 ) gcd N ) = 1

Assertion

Ref	Expression
pockthi	|- N e. Prime

Proof of Theorem pockthi

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pockthi.d	. 2 |- D e. NN
2		pockthi.p	. . . . . 6 |- P e. Prime
3		prmnn 12142	. . . . . 6 |- ( P e. Prime -> P e. NN )
4	2, 3	ax-mp 5	. . . . 5 |- P e. NN
5		pockthi.e	. . . . . 6 |- E e. NN
6	5	nnnn0i 9214	. . . . 5 |- E e. NN0
7		nnexpcl 10564	. . . . 5 |- ( ( P e. NN /\ E e. NN0 ) -> ( P ^ E ) e. NN )
8	4, 6, 7	mp2an 426	. . . 4 |- ( P ^ E ) e. NN
9	8	a1i 9	. . 3 |- ( D e. NN -> ( P ^ E ) e. NN )
10		id 19	. . 3 |- ( D e. NN -> D e. NN )
11		pockthi.gt	. . . 4 |- D < ( P ^ E )
12	11	a1i 9	. . 3 |- ( D e. NN -> D < ( P ^ E ) )
13		pockthi.n	. . . . 5 |- N = ( M + 1 )
14		pockthi.fac	. . . . . . 7 |- M = ( D x. ( P ^ E ) )
15	1	nncni 8959	. . . . . . . 8 |- D e. CC
16	8	nncni 8959	. . . . . . . 8 |- ( P ^ E ) e. CC
17	15, 16	mulcomi 7993	. . . . . . 7 |- ( D x. ( P ^ E ) ) = ( ( P ^ E ) x. D )
18	14, 17	eqtri 2210	. . . . . 6 |- M = ( ( P ^ E ) x. D )
19	18	oveq1i 5906	. . . . 5 |- ( M + 1 ) = ( ( ( P ^ E ) x. D ) + 1 )
20	13, 19	eqtri 2210	. . . 4 |- N = ( ( ( P ^ E ) x. D ) + 1 )
21	20	a1i 9	. . 3 |- ( D e. NN -> N = ( ( ( P ^ E ) x. D ) + 1 ) )
22		prmdvdsexpb 12181	. . . . . . 7 |- ( ( x e. Prime /\ P e. Prime /\ E e. NN ) -> ( x || ( P ^ E ) <-> x = P ) )
23	2, 5, 22	mp3an23 1340	. . . . . 6 |- ( x e. Prime -> ( x || ( P ^ E ) <-> x = P ) )
24		pockthi.m	. . . . . . . . . . . . 13 |- M = ( G x. P )
25		pockthi.g	. . . . . . . . . . . . . 14 |- G e. NN
26	25, 4	nnmulcli 8971	. . . . . . . . . . . . 13 |- ( G x. P ) e. NN
27	24, 26	eqeltri 2262	. . . . . . . . . . . 12 |- M e. NN
28	27	nncni 8959	. . . . . . . . . . 11 |- M e. CC
29		ax-1cn 7934	. . . . . . . . . . 11 |- 1 e. CC
30	28, 29, 13	mvrraddi 8204	. . . . . . . . . 10 |- ( N - 1 ) = M
31	30	oveq2i 5907	. . . . . . . . 9 |- ( A ^ ( N - 1 ) ) = ( A ^ M )
32	31	oveq1i 5906	. . . . . . . 8 |- ( ( A ^ ( N - 1 ) ) mod N ) = ( ( A ^ M ) mod N )
33		pockthi.mod	. . . . . . . . 9 |- ( ( A ^ M ) mod N ) = ( 1 mod N )
34		peano2nn 8961	. . . . . . . . . . . . 13 |- ( M e. NN -> ( M + 1 ) e. NN )
35	27, 34	ax-mp 5	. . . . . . . . . . . 12 |- ( M + 1 ) e. NN
36	13, 35	eqeltri 2262	. . . . . . . . . . 11 |- N e. NN
37		nnq 9663	. . . . . . . . . . 11 |- ( N e. NN -> N e. QQ )
38	36, 37	ax-mp 5	. . . . . . . . . 10 |- N e. QQ
39	27	nngt0i 8979	. . . . . . . . . . . 12 |- 0 < M
40	27	nnrei 8958	. . . . . . . . . . . . 13 |- M e. RR
41		1re 7986	. . . . . . . . . . . . 13 |- 1 e. RR
42		ltaddpos2 8440	. . . . . . . . . . . . 13 |- ( ( M e. RR /\ 1 e. RR ) -> ( 0 < M <-> 1 < ( M + 1 ) ) )
43	40, 41, 42	mp2an 426	. . . . . . . . . . . 12 |- ( 0 < M <-> 1 < ( M + 1 ) )
44	39, 43	mpbi 145	. . . . . . . . . . 11 |- 1 < ( M + 1 )
45	44, 13	breqtrri 4045	. . . . . . . . . 10 |- 1 < N
46		q1mod 10387	. . . . . . . . . 10 |- ( ( N e. QQ /\ 1 < N ) -> ( 1 mod N ) = 1 )
47	38, 45, 46	mp2an 426	. . . . . . . . 9 |- ( 1 mod N ) = 1
48	33, 47	eqtri 2210	. . . . . . . 8 |- ( ( A ^ M ) mod N ) = 1
49	32, 48	eqtri 2210	. . . . . . 7 |- ( ( A ^ ( N - 1 ) ) mod N ) = 1
50		oveq2 5904	. . . . . . . . . . . 12 |- ( x = P -> ( ( N - 1 ) / x ) = ( ( N - 1 ) / P ) )
51	25	nncni 8959	. . . . . . . . . . . . . . 15 |- G e. CC
52	4	nncni 8959	. . . . . . . . . . . . . . 15 |- P e. CC
53	51, 52	mulcomi 7993	. . . . . . . . . . . . . 14 |- ( G x. P ) = ( P x. G )
54	30, 24, 53	3eqtrri 2215	. . . . . . . . . . . . 13 |- ( P x. G ) = ( N - 1 )
55	36	nncni 8959	. . . . . . . . . . . . . . 15 |- N e. CC
56	55, 29	subcli 8263	. . . . . . . . . . . . . 14 |- ( N - 1 ) e. CC
57	4	nnap0i 8980	. . . . . . . . . . . . . 14 |- P # 0
58	56, 52, 51, 57	divmulapi 8753	. . . . . . . . . . . . 13 |- ( ( ( N - 1 ) / P ) = G <-> ( P x. G ) = ( N - 1 ) )
59	54, 58	mpbir 146	. . . . . . . . . . . 12 |- ( ( N - 1 ) / P ) = G
60	50, 59	eqtrdi 2238	. . . . . . . . . . 11 |- ( x = P -> ( ( N - 1 ) / x ) = G )
61	60	oveq2d 5912	. . . . . . . . . 10 |- ( x = P -> ( A ^ ( ( N - 1 ) / x ) ) = ( A ^ G ) )
62	61	oveq1d 5911	. . . . . . . . 9 |- ( x = P -> ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) = ( ( A ^ G ) - 1 ) )
63	62	oveq1d 5911	. . . . . . . 8 |- ( x = P -> ( ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = ( ( ( A ^ G ) - 1 ) gcd N ) )
64		pockthi.gcd	. . . . . . . 8 |- ( ( ( A ^ G ) - 1 ) gcd N ) = 1
65	63, 64	eqtrdi 2238	. . . . . . 7 |- ( x = P -> ( ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 )
66		pockthi.a	. . . . . . . . 9 |- A e. NN
67	66	nnzi 9304	. . . . . . . 8 |- A e. ZZ
68		oveq1 5903	. . . . . . . . . . . 12 |- ( y = A -> ( y ^ ( N - 1 ) ) = ( A ^ ( N - 1 ) ) )
69	68	oveq1d 5911	. . . . . . . . . . 11 |- ( y = A -> ( ( y ^ ( N - 1 ) ) mod N ) = ( ( A ^ ( N - 1 ) ) mod N ) )
70	69	eqeq1d 2198	. . . . . . . . . 10 |- ( y = A -> ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 <-> ( ( A ^ ( N - 1 ) ) mod N ) = 1 ) )
71		oveq1 5903	. . . . . . . . . . . . 13 |- ( y = A -> ( y ^ ( ( N - 1 ) / x ) ) = ( A ^ ( ( N - 1 ) / x ) ) )
72	71	oveq1d 5911	. . . . . . . . . . . 12 |- ( y = A -> ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) = ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) )
73	72	oveq1d 5911	. . . . . . . . . . 11 |- ( y = A -> ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = ( ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) )
74	73	eqeq1d 2198	. . . . . . . . . 10 |- ( y = A -> ( ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 <-> ( ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) )
75	70, 74	anbi12d 473	. . . . . . . . 9 |- ( y = A -> ( ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) <-> ( ( ( A ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) ) )
76	75	rspcev 2856	. . . . . . . 8 |- ( ( A e. ZZ /\ ( ( ( A ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) ) -> E. y e. ZZ ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) )
77	67, 76	mpan 424	. . . . . . 7 |- ( ( ( ( A ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( A ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) -> E. y e. ZZ ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) )
78	49, 65, 77	sylancr 414	. . . . . 6 |- ( x = P -> E. y e. ZZ ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) )
79	23, 78	biimtrdi 163	. . . . 5 |- ( x e. Prime -> ( x || ( P ^ E ) -> E. y e. ZZ ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) ) )
80	79	rgen 2543	. . . 4 |- A. x e. Prime ( x || ( P ^ E ) -> E. y e. ZZ ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) )
81	80	a1i 9	. . 3 |- ( D e. NN -> A. x e. Prime ( x || ( P ^ E ) -> E. y e. ZZ ( ( ( y ^ ( N - 1 ) ) mod N ) = 1 /\ ( ( ( y ^ ( ( N - 1 ) / x ) ) - 1 ) gcd N ) = 1 ) ) )
82	9, 10, 12, 21, 81	pockthg 12389	. 2 |- ( D e. NN -> N e. Prime )
83	1, 82	ax-mp 5	1 |- N e. Prime

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1364   e. wcel 2160   A.wral 2468   E.wrex 2469   class class class wbr 4018  (class class class)co 5896   RRcr 7840   0cc0 7841   1c1 7842   + caddc 7844   x. cmul 7846   < clt 8022   - cmin 8158   / cdiv 8659   NNcn 8949   NN0cn0 9206   ZZcz 9283   QQcq 9649   mod cmo 10353   ^cexp 10550   || cdvds 11826   gcd cgcd 11975   Primecprime 12139

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4192  ax-pr 4227  ax-un 4451  ax-setind 4554  ax-iinf 4605  ax-cnex 7932  ax-resscn 7933  ax-1cn 7934  ax-1re 7935  ax-icn 7936  ax-addcl 7937  ax-addrcl 7938  ax-mulcl 7939  ax-mulrcl 7940  ax-addcom 7941  ax-mulcom 7942  ax-addass 7943  ax-mulass 7944  ax-distr 7945  ax-i2m1 7946  ax-0lt1 7947  ax-1rid 7948  ax-0id 7949  ax-rnegex 7950  ax-precex 7951  ax-cnre 7952  ax-pre-ltirr 7953  ax-pre-ltwlin 7954  ax-pre-lttrn 7955  ax-pre-apti 7956  ax-pre-ltadd 7957  ax-pre-mulgt0 7958  ax-pre-mulext 7959  ax-arch 7960  ax-caucvg 7961

This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rmo 2476  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-if 3550  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-id 4311  df-po 4314  df-iso 4315  df-iord 4384  df-on 4386  df-ilim 4387  df-suc 4389  df-iom 4608  df-xp 4650  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-rn 4655  df-res 4656  df-ima 4657  df-iota 5196  df-fun 5237  df-fn 5238  df-f 5239  df-f1 5240  df-fo 5241  df-f1o 5242  df-fv 5243  df-isom 5244  df-riota 5852  df-ov 5899  df-oprab 5900  df-mpo 5901  df-1st 6165  df-2nd 6166  df-recs 6330  df-irdg 6395  df-frec 6416  df-1o 6441  df-2o 6442  df-oadd 6445  df-er 6559  df-en 6767  df-dom 6768  df-fin 6769  df-sup 7013  df-inf 7014  df-pnf 8024  df-mnf 8025  df-xr 8026  df-ltxr 8027  df-le 8028  df-sub 8160  df-neg 8161  df-reap 8562  df-ap 8569  df-div 8660  df-inn 8950  df-2 9008  df-3 9009  df-4 9010  df-n0 9207  df-xnn0 9270  df-z 9284  df-uz 9559  df-q 9650  df-rp 9684  df-fz 10039  df-fzo 10173  df-fl 10301  df-mod 10354  df-seqfrec 10477  df-exp 10551  df-ihash 10788  df-cj 10883  df-re 10884  df-im 10885  df-rsqrt 11039  df-abs 11040  df-clim 11319  df-proddc 11591  df-dvds 11827  df-gcd 11976  df-prm 12140  df-odz 12242  df-phi 12243  df-pc 12317

This theorem is referenced by: (None)