Theorem gausslemma2d 16200

Description: Gauss' Lemma (see also theorem 9.6 in [ApostolNT] p. 182) for integer 2: Let p be an odd prime. Let S = {2, 4, 6, ..., p - 1}. Let n denote the number of elements of S whose least positive residue modulo p is greater than p/2. Then ( 2 | p ) = (-1)^n. (Contributed by AV, 14-Jul-2021.)

Hypotheses

Ref	Expression
gausslemma2d.p	|- ( ph -> P e. ( Prime \ { 2 } ) )
gausslemma2d.h	|- H = ( ( P - 1 ) / 2 )
gausslemma2d.r	|- R = ( x e. ( 1 ... H ) |-> if ( ( x x. 2 ) < ( P / 2 ) , ( x x. 2 ) , ( P - ( x x. 2 ) ) ) )
gausslemma2d.m	|- M = ( |_ ` ( P / 4 ) )
gausslemma2d.n	|- N = ( H - M )

Assertion

Ref	Expression
gausslemma2d	|- ( ph -> ( 2 /L P ) = ( -u 1 ^ N ) )

Distinct variable groups:   x, H   x, P   ph, x   x, M

Allowed substitution hints:   R( x)   N( x)

Proof of Theorem gausslemma2d

Step	Hyp	Ref	Expression
1		gausslemma2d.p	. . 3 |- ( ph -> P e. ( Prime \ { 2 } ) )
2		gausslemma2d.h	. . 3 |- H = ( ( P - 1 ) / 2 )
3		gausslemma2d.r	. . 3 |- R = ( x e. ( 1 ... H ) |-> if ( ( x x. 2 ) < ( P / 2 ) , ( x x. 2 ) , ( P - ( x x. 2 ) ) ) )
4		gausslemma2d.m	. . 3 |- M = ( |_ ` ( P / 4 ) )
5		gausslemma2d.n	. . 3 |- N = ( H - M )
6	1, 2, 3, 4, 5	gausslemma2dlem7 16199	. 2 |- ( ph -> ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = 1 )
7	1	gausslemma2dlem0a 16180	. . . . . . 7 |- ( ph -> P e. NN )
8		nnq 10035	. . . . . . 7 |- ( P e. NN -> P e. QQ )
9	7, 8	syl 14	. . . . . 6 |- ( ph -> P e. QQ )
10		eldifi 3351	. . . . . . 7 |- ( P e. ( Prime \ { 2 } ) -> P e. Prime )
11		prmgt1 12912	. . . . . . 7 |- ( P e. Prime -> 1 < P )
12	1, 10, 11	3syl 17	. . . . . 6 |- ( ph -> 1 < P )
13		q1mod 10795	. . . . . 6 |- ( ( P e. QQ /\ 1 < P ) -> ( 1 mod P ) = 1 )
14	9, 12, 13	syl2anc 415	. . . . 5 |- ( ph -> ( 1 mod P ) = 1 )
15	14	eqcomd 2244	. . . 4 |- ( ph -> 1 = ( 1 mod P ) )
16	15	eqeq2d 2250	. . 3 |- ( ph -> ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = 1 <-> ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) )
17		neg1z 9678	. . . . . . . . . 10 |- -u 1 e. ZZ
18	1, 4, 2, 5	gausslemma2dlem0h 16187	. . . . . . . . . 10 |- ( ph -> N e. NN0 )
19		zexpcl 10993	. . . . . . . . . 10 |- ( ( -u 1 e. ZZ /\ N e. NN0 ) -> ( -u 1 ^ N ) e. ZZ )
20	17, 18, 19	sylancr 418	. . . . . . . . 9 |- ( ph -> ( -u 1 ^ N ) e. ZZ )
21		2nn 9468	. . . . . . . . . . . 12 |- 2 e. NN
22	21	a1i 9	. . . . . . . . . . 11 |- ( ph -> 2 e. NN )
23	1, 2	gausslemma2dlem0b 16181	. . . . . . . . . . . 12 |- ( ph -> H e. NN )
24	23	nnnn0d 9622	. . . . . . . . . . 11 |- ( ph -> H e. NN0 )
25	22, 24	nnexpcld 11135	. . . . . . . . . 10 |- ( ph -> ( 2 ^ H ) e. NN )
26	25	nnzd 9769	. . . . . . . . 9 |- ( ph -> ( 2 ^ H ) e. ZZ )
27	20, 26	zmulcld 9776	. . . . . . . 8 |- ( ph -> ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) e. ZZ )
28		zq 10028	. . . . . . . 8 |- ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) e. ZZ -> ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) e. QQ )
29	27, 28	syl 14	. . . . . . 7 |- ( ph -> ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) e. QQ )
30	29	adantr 276	. . . . . 6 |- ( ( ph /\ ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) -> ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) e. QQ )
31		1z 9672	. . . . . . 7 |- 1 e. ZZ
32		zq 10028	. . . . . . 7 |- ( 1 e. ZZ -> 1 e. QQ )
33	31, 32	mp1i 10	. . . . . 6 |- ( ( ph /\ ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) -> 1 e. QQ )
34	20	adantr 276	. . . . . 6 |- ( ( ph /\ ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) -> ( -u 1 ^ N ) e. ZZ )
35	9	adantr 276	. . . . . 6 |- ( ( ph /\ ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) -> P e. QQ )
36	7	nngt0d 9349	. . . . . . 7 |- ( ph -> 0 < P )
37	36	adantr 276	. . . . . 6 |- ( ( ph /\ ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) -> 0 < P )
38		simpr 110	. . . . . 6 |- ( ( ph /\ ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) -> ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) )
39	30, 33, 34, 35, 37, 38	modqmul1 10816	. . . . 5 |- ( ( ph /\ ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) ) -> ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) x. ( -u 1 ^ N ) ) mod P ) = ( ( 1 x. ( -u 1 ^ N ) ) mod P ) )
40	39	ex 115	. . . 4 |- ( ph -> ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) -> ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) x. ( -u 1 ^ N ) ) mod P ) = ( ( 1 x. ( -u 1 ^ N ) ) mod P ) ) )
41	20	zcnd 9771	. . . . . . . . 9 |- ( ph -> ( -u 1 ^ N ) e. CC )
42	25	nncnd 9319	. . . . . . . . 9 |- ( ph -> ( 2 ^ H ) e. CC )
43	41, 42, 41	mul32d 8479	. . . . . . . 8 |- ( ph -> ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) x. ( -u 1 ^ N ) ) = ( ( ( -u 1 ^ N ) x. ( -u 1 ^ N ) ) x. ( 2 ^ H ) ) )
44	18	nn0cnd 9624	. . . . . . . . . . . . 13 |- ( ph -> N e. CC )
45	44	2timesd 9550	. . . . . . . . . . . 12 |- ( ph -> ( 2 x. N ) = ( N + N ) )
46	45	eqcomd 2244	. . . . . . . . . . 11 |- ( ph -> ( N + N ) = ( 2 x. N ) )
47	46	oveq2d 6101	. . . . . . . . . 10 |- ( ph -> ( -u 1 ^ ( N + N ) ) = ( -u 1 ^ ( 2 x. N ) ) )
48		neg1cn 9410	. . . . . . . . . . . 12 |- -u 1 e. CC
49	48	a1i 9	. . . . . . . . . . 11 |- ( ph -> -u 1 e. CC )
50	49, 18, 18	expaddd 11115	. . . . . . . . . 10 |- ( ph -> ( -u 1 ^ ( N + N ) ) = ( ( -u 1 ^ N ) x. ( -u 1 ^ N ) ) )
51	18	nn0zd 9768	. . . . . . . . . . 11 |- ( ph -> N e. ZZ )
52		m1expeven 11025	. . . . . . . . . . 11 |- ( N e. ZZ -> ( -u 1 ^ ( 2 x. N ) ) = 1 )
53	51, 52	syl 14	. . . . . . . . . 10 |- ( ph -> ( -u 1 ^ ( 2 x. N ) ) = 1 )
54	47, 50, 53	3eqtr3d 2279	. . . . . . . . 9 |- ( ph -> ( ( -u 1 ^ N ) x. ( -u 1 ^ N ) ) = 1 )
55	54	oveq1d 6100	. . . . . . . 8 |- ( ph -> ( ( ( -u 1 ^ N ) x. ( -u 1 ^ N ) ) x. ( 2 ^ H ) ) = ( 1 x. ( 2 ^ H ) ) )
56	42	mullidd 8344	. . . . . . . 8 |- ( ph -> ( 1 x. ( 2 ^ H ) ) = ( 2 ^ H ) )
57	43, 55, 56	3eqtrd 2275	. . . . . . 7 |- ( ph -> ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) x. ( -u 1 ^ N ) ) = ( 2 ^ H ) )
58	57	oveq1d 6100	. . . . . 6 |- ( ph -> ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) x. ( -u 1 ^ N ) ) mod P ) = ( ( 2 ^ H ) mod P ) )
59	41	mullidd 8344	. . . . . . 7 |- ( ph -> ( 1 x. ( -u 1 ^ N ) ) = ( -u 1 ^ N ) )
60	59	oveq1d 6100	. . . . . 6 |- ( ph -> ( ( 1 x. ( -u 1 ^ N ) ) mod P ) = ( ( -u 1 ^ N ) mod P ) )
61	58, 60	eqeq12d 2253	. . . . 5 |- ( ph -> ( ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) x. ( -u 1 ^ N ) ) mod P ) = ( ( 1 x. ( -u 1 ^ N ) ) mod P ) <-> ( ( 2 ^ H ) mod P ) = ( ( -u 1 ^ N ) mod P ) ) )
62	2	oveq2i 6096	. . . . . . . 8 |- ( 2 ^ H ) = ( 2 ^ ( ( P - 1 ) / 2 ) )
63	62	oveq1i 6095	. . . . . . 7 |- ( ( 2 ^ H ) mod P ) = ( ( 2 ^ ( ( P - 1 ) / 2 ) ) mod P )
64	63	eqeq1i 2246	. . . . . 6 |- ( ( ( 2 ^ H ) mod P ) = ( ( -u 1 ^ N ) mod P ) <-> ( ( 2 ^ ( ( P - 1 ) / 2 ) ) mod P ) = ( ( -u 1 ^ N ) mod P ) )
65		2z 9674	. . . . . . . . . 10 |- 2 e. ZZ
66		lgsvalmod 16150	. . . . . . . . . 10 |- ( ( 2 e. ZZ /\ P e. ( Prime \ { 2 } ) ) -> ( ( 2 /L P ) mod P ) = ( ( 2 ^ ( ( P - 1 ) / 2 ) ) mod P ) )
67	65, 1, 66	sylancr 418	. . . . . . . . 9 |- ( ph -> ( ( 2 /L P ) mod P ) = ( ( 2 ^ ( ( P - 1 ) / 2 ) ) mod P ) )
68	67	eqcomd 2244	. . . . . . . 8 |- ( ph -> ( ( 2 ^ ( ( P - 1 ) / 2 ) ) mod P ) = ( ( 2 /L P ) mod P ) )
69	68	eqeq1d 2247	. . . . . . 7 |- ( ph -> ( ( ( 2 ^ ( ( P - 1 ) / 2 ) ) mod P ) = ( ( -u 1 ^ N ) mod P ) <-> ( ( 2 /L P ) mod P ) = ( ( -u 1 ^ N ) mod P ) ) )
70	1, 4, 2, 5	gausslemma2dlem0i 16188	. . . . . . 7 |- ( ph -> ( ( ( 2 /L P ) mod P ) = ( ( -u 1 ^ N ) mod P ) -> ( 2 /L P ) = ( -u 1 ^ N ) ) )
71	69, 70	sylbid 150	. . . . . 6 |- ( ph -> ( ( ( 2 ^ ( ( P - 1 ) / 2 ) ) mod P ) = ( ( -u 1 ^ N ) mod P ) -> ( 2 /L P ) = ( -u 1 ^ N ) ) )
72	64, 71	biimtrid 152	. . . . 5 |- ( ph -> ( ( ( 2 ^ H ) mod P ) = ( ( -u 1 ^ N ) mod P ) -> ( 2 /L P ) = ( -u 1 ^ N ) ) )
73	61, 72	sylbid 150	. . . 4 |- ( ph -> ( ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) x. ( -u 1 ^ N ) ) mod P ) = ( ( 1 x. ( -u 1 ^ N ) ) mod P ) -> ( 2 /L P ) = ( -u 1 ^ N ) ) )
74	40, 73	syld 45	. . 3 |- ( ph -> ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = ( 1 mod P ) -> ( 2 /L P ) = ( -u 1 ^ N ) ) )
75	16, 74	sylbid 150	. 2 |- ( ph -> ( ( ( ( -u 1 ^ N ) x. ( 2 ^ H ) ) mod P ) = 1 -> ( 2 /L P ) = ( -u 1 ^ N ) ) )
76	6, 75	mpd 13	1 |- ( ph -> ( 2 /L P ) = ( -u 1 ^ N ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   \ cdif 3217   ifcif 3638   {csn 3709   class class class wbr 4130   |-> cmpt 4192   ` cfv 5377  (class class class)co 6085   CCcc 8177   0cc0 8179   1c1 8180   + caddc 8182   x. cmul 8184   < clt 8360   - cmin 8497   -ucneg 8498   / cdiv 9003   NNcn 9305   2c2 9356   4c4 9358   NN0cn0 9565   ZZcz 9646   QQcq 10021   ...cfz 10413   |_cfl 10705   mod cmo 10761   ^cexp 10977   Primecprime 12887   /Lclgs 16128

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299

This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-xor 1425  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-2o 6688  df-oadd 6691  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8904  df-ap 8911  df-div 9004  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-6 9368  df-7 9369  df-8 9370  df-n0 9566  df-z 9647  df-uz 9924  df-q 10022  df-rp 10057  df-ioo 10296  df-fz 10414  df-fzo 10552  df-fl 10707  df-mod 10762  df-seqfrec 10887  df-exp 10978  df-fac 11166  df-ihash 11217  df-cj 11609  df-re 11610  df-im 11611  df-rsqrt 11766  df-abs 11767  df-clim 12047  df-proddc 12320  df-dvds 12557  df-gcd 12733  df-prm 12888  df-phi 12991  df-pc 13066  df-lgs 16129

This theorem is used by:  2lgs  16235