Theorem 2lgs 16235

Description: The second supplement to the law of quadratic reciprocity (for the Legendre symbol extended to arbitrary primes as second argument). Two is a square modulo a prime P iff P == pm 1 (mod 8), see first case of theorem 9.5 in [ApostolNT] p. 181. This theorem justifies our definition of ( N /L 2 ) (lgs2 16148) to some degree, by demanding that reciprocity extend to the case Q = 2. (Proposed by Mario Carneiro, 19-Jun-2015.) (Contributed by AV, 16-Jul-2021.)

Assertion

Ref	Expression
2lgs	|- ( P e. Prime -> ( ( 2 /L P ) = 1 <-> ( P mod 8 ) e. { 1 , 7 } ) )

Proof of Theorem 2lgs

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

Step	Hyp	Ref	Expression
1		prm2orodd 12906	. 2 |- ( P e. Prime -> ( P = 2 \/ -. 2 || P ) )
2		2lgslem4 16234	. . . . . 6 |- ( ( 2 /L 2 ) = 1 <-> ( 2 mod 8 ) e. { 1 , 7 } )
3	2	a1i 9	. . . . 5 |- ( P = 2 -> ( ( 2 /L 2 ) = 1 <-> ( 2 mod 8 ) e. { 1 , 7 } ) )
4		oveq2 6093	. . . . . 6 |- ( P = 2 -> ( 2 /L P ) = ( 2 /L 2 ) )
5	4	eqeq1d 2247	. . . . 5 |- ( P = 2 -> ( ( 2 /L P ) = 1 <-> ( 2 /L 2 ) = 1 ) )
6		oveq1 6092	. . . . . 6 |- ( P = 2 -> ( P mod 8 ) = ( 2 mod 8 ) )
7	6	eleq1d 2307	. . . . 5 |- ( P = 2 -> ( ( P mod 8 ) e. { 1 , 7 } <-> ( 2 mod 8 ) e. { 1 , 7 } ) )
8	3, 5, 7	3bitr4d 220	. . . 4 |- ( P = 2 -> ( ( 2 /L P ) = 1 <-> ( P mod 8 ) e. { 1 , 7 } ) )
9	8	a1d 22	. . 3 |- ( P = 2 -> ( P e. Prime -> ( ( 2 /L P ) = 1 <-> ( P mod 8 ) e. { 1 , 7 } ) ) )
10		2prm 12907	. . . . . . . . . 10 |- 2 e. Prime
11		prmnn 12890	. . . . . . . . . 10 |- ( P e. Prime -> P e. NN )
12		dvdsprime 12902	. . . . . . . . . 10 |- ( ( 2 e. Prime /\ P e. NN ) -> ( P || 2 <-> ( P = 2 \/ P = 1 ) ) )
13	10, 11, 12	sylancr 418	. . . . . . . . 9 |- ( P e. Prime -> ( P || 2 <-> ( P = 2 \/ P = 1 ) ) )
14		z2even 12683	. . . . . . . . . . . . 13 |- 2 || 2
15		breq2 4134	. . . . . . . . . . . . 13 |- ( P = 2 -> ( 2 || P <-> 2 || 2 ) )
16	14, 15	mpbiri 168	. . . . . . . . . . . 12 |- ( P = 2 -> 2 || P )
17	16	a1d 22	. . . . . . . . . . 11 |- ( P = 2 -> ( P e. Prime -> 2 || P ) )
18		eleq1 2301	. . . . . . . . . . . 12 |- ( P = 1 -> ( P e. Prime <-> 1 e. Prime ) )
19		1nprm 12894	. . . . . . . . . . . . 13 |- -. 1 e. Prime
20	19	pm2.21i 655	. . . . . . . . . . . 12 |- ( 1 e. Prime -> 2 || P )
21	18, 20	biimtrdi 163	. . . . . . . . . . 11 |- ( P = 1 -> ( P e. Prime -> 2 || P ) )
22	17, 21	jaoi 728	. . . . . . . . . 10 |- ( ( P = 2 \/ P = 1 ) -> ( P e. Prime -> 2 || P ) )
23	22	com12 30	. . . . . . . . 9 |- ( P e. Prime -> ( ( P = 2 \/ P = 1 ) -> 2 || P ) )
24	13, 23	sylbid 150	. . . . . . . 8 |- ( P e. Prime -> ( P || 2 -> 2 || P ) )
25	24	con3dimp 644	. . . . . . 7 |- ( ( P e. Prime /\ -. 2 || P ) -> -. P || 2 )
26		2z 9674	. . . . . . 7 |- 2 e. ZZ
27	25, 26	jctil 312	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( 2 e. ZZ /\ -. P || 2 ) )
28		2lgslem1 16222	. . . . . . 7 |- ( ( P e. Prime /\ -. 2 || P ) -> (♯ ` { x e. ZZ | E. i e. ( 1 ... ( ( P - 1 ) / 2 ) ) ( x = ( i x. 2 ) /\ ( P / 2 ) < ( x mod P ) ) } ) = ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) )
29	28	eqcomd 2244	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) = (♯ ` { x e. ZZ | E. i e. ( 1 ... ( ( P - 1 ) / 2 ) ) ( x = ( i x. 2 ) /\ ( P / 2 ) < ( x mod P ) ) } ) )
30		nnoddn2prmb 13043	. . . . . . . . . 10 |- ( P e. ( Prime \ { 2 } ) <-> ( P e. Prime /\ -. 2 || P ) )
31	30	biimpri 133	. . . . . . . . 9 |- ( ( P e. Prime /\ -. 2 || P ) -> P e. ( Prime \ { 2 } ) )
32	31	3ad2ant1 1049	. . . . . . . 8 |- ( ( ( P e. Prime /\ -. 2 || P ) /\ ( 2 e. ZZ /\ -. P || 2 ) /\ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) = (♯ ` { x e. ZZ | E. i e. ( 1 ... ( ( P - 1 ) / 2 ) ) ( x = ( i x. 2 ) /\ ( P / 2 ) < ( x mod P ) ) } ) ) -> P e. ( Prime \ { 2 } ) )
33		eqid 2238	. . . . . . . 8 |- ( ( P - 1 ) / 2 ) = ( ( P - 1 ) / 2 )
34		eqid 2238	. . . . . . . 8 |- ( y e. ( 1 ... ( ( P - 1 ) / 2 ) ) |-> if ( ( y x. 2 ) < ( P / 2 ) , ( y x. 2 ) , ( P - ( y x. 2 ) ) ) ) = ( y e. ( 1 ... ( ( P - 1 ) / 2 ) ) |-> if ( ( y x. 2 ) < ( P / 2 ) , ( y x. 2 ) , ( P - ( y x. 2 ) ) ) )
35		eqid 2238	. . . . . . . 8 |- ( |_ ` ( P / 4 ) ) = ( |_ ` ( P / 4 ) )
36		eqid 2238	. . . . . . . 8 |- ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) = ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) )
37	32, 33, 34, 35, 36	gausslemma2d 16200	. . . . . . 7 |- ( ( ( P e. Prime /\ -. 2 || P ) /\ ( 2 e. ZZ /\ -. P || 2 ) /\ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) = (♯ ` { x e. ZZ | E. i e. ( 1 ... ( ( P - 1 ) / 2 ) ) ( x = ( i x. 2 ) /\ ( P / 2 ) < ( x mod P ) ) } ) ) -> ( 2 /L P ) = ( -u 1 ^ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) )
38	37	eqeq1d 2247	. . . . . 6 |- ( ( ( P e. Prime /\ -. 2 || P ) /\ ( 2 e. ZZ /\ -. P || 2 ) /\ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) = (♯ ` { x e. ZZ | E. i e. ( 1 ... ( ( P - 1 ) / 2 ) ) ( x = ( i x. 2 ) /\ ( P / 2 ) < ( x mod P ) ) } ) ) -> ( ( 2 /L P ) = 1 <-> ( -u 1 ^ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) = 1 ) )
39	27, 29, 38	mpd3an23 1380	. . . . 5 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( 2 /L P ) = 1 <-> ( -u 1 ^ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) = 1 ) )
40	36	2lgslem2 16223	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) e. ZZ )
41		m1exp1 12670	. . . . . 6 |- ( ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) e. ZZ -> ( ( -u 1 ^ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) = 1 <-> 2 || ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) )
42	40, 41	syl 14	. . . . 5 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( -u 1 ^ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) = 1 <-> 2 || ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) )
43		2nn 9468	. . . . . . 7 |- 2 e. NN
44		dvdsval3 12560	. . . . . . 7 |- ( ( 2 e. NN /\ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) e. ZZ ) -> ( 2 || ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) <-> ( ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) mod 2 ) = 0 ) )
45	43, 40, 44	sylancr 418	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( 2 || ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) <-> ( ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) mod 2 ) = 0 ) )
46	36	2lgslem3 16232	. . . . . . . 8 |- ( ( P e. NN /\ -. 2 || P ) -> ( ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) mod 2 ) = if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) )
47	11, 46	sylan 283	. . . . . . 7 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) mod 2 ) = if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) )
48	47	eqeq1d 2247	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) mod 2 ) = 0 <-> if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 ) )
49		prmz 12891	. . . . . . . . . . . . . . 15 |- ( P e. Prime -> P e. ZZ )
50		8nn 9474	. . . . . . . . . . . . . . . 16 |- 8 e. NN
51	50	a1i 9	. . . . . . . . . . . . . . 15 |- ( P e. Prime -> 8 e. NN )
52	49, 51	zmodcld 10784	. . . . . . . . . . . . . 14 |- ( P e. Prime -> ( P mod 8 ) e. NN0 )
53	52	nn0zd 9768	. . . . . . . . . . . . 13 |- ( P e. Prime -> ( P mod 8 ) e. ZZ )
54		1z 9672	. . . . . . . . . . . . 13 |- 1 e. ZZ
55		zdceq 9722	. . . . . . . . . . . . 13 |- ( ( ( P mod 8 ) e. ZZ /\ 1 e. ZZ ) -> DECID ( P mod 8 ) = 1 )
56	53, 54, 55	sylancl 417	. . . . . . . . . . . 12 |- ( P e. Prime -> DECID ( P mod 8 ) = 1 )
57		7nn 9473	. . . . . . . . . . . . . 14 |- 7 e. NN
58	57	nnzi 9667	. . . . . . . . . . . . 13 |- 7 e. ZZ
59		zdceq 9722	. . . . . . . . . . . . 13 |- ( ( ( P mod 8 ) e. ZZ /\ 7 e. ZZ ) -> DECID ( P mod 8 ) = 7 )
60	53, 58, 59	sylancl 417	. . . . . . . . . . . 12 |- ( P e. Prime -> DECID ( P mod 8 ) = 7 )
61		dcor 948	. . . . . . . . . . . 12 |- (DECID ( P mod 8 ) = 1 -> (DECID ( P mod 8 ) = 7 -> DECID ( ( P mod 8 ) = 1 \/ ( P mod 8 ) = 7 ) ) )
62	56, 60, 61	sylc 62	. . . . . . . . . . 11 |- ( P e. Prime -> DECID ( ( P mod 8 ) = 1 \/ ( P mod 8 ) = 7 ) )
63		elprg 3729	. . . . . . . . . . . . 13 |- ( ( P mod 8 ) e. NN0 -> ( ( P mod 8 ) e. { 1 , 7 } <-> ( ( P mod 8 ) = 1 \/ ( P mod 8 ) = 7 ) ) )
64	52, 63	syl 14	. . . . . . . . . . . 12 |- ( P e. Prime -> ( ( P mod 8 ) e. { 1 , 7 } <-> ( ( P mod 8 ) = 1 \/ ( P mod 8 ) = 7 ) ) )
65	64	dcbid 850	. . . . . . . . . . 11 |- ( P e. Prime -> (DECID ( P mod 8 ) e. { 1 , 7 } <-> DECID ( ( P mod 8 ) = 1 \/ ( P mod 8 ) = 7 ) ) )
66	62, 65	mpbird 167	. . . . . . . . . 10 |- ( P e. Prime -> DECID ( P mod 8 ) e. { 1 , 7 } )
67		exmiddc 848	. . . . . . . . . 10 |- (DECID ( P mod 8 ) e. { 1 , 7 } -> ( ( P mod 8 ) e. { 1 , 7 } \/ -. ( P mod 8 ) e. { 1 , 7 } ) )
68	66, 67	syl 14	. . . . . . . . 9 |- ( P e. Prime -> ( ( P mod 8 ) e. { 1 , 7 } \/ -. ( P mod 8 ) e. { 1 , 7 } ) )
69		iffalse 3648	. . . . . . . . . . . 12 |- ( -. ( P mod 8 ) e. { 1 , 7 } -> if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 1 )
70	69	eqeq1d 2247	. . . . . . . . . . 11 |- ( -. ( P mod 8 ) e. { 1 , 7 } -> ( if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 <-> 1 = 0 ) )
71		1ne0 9373	. . . . . . . . . . . 12 |- 1 =/= 0
72		eqneqall 2430	. . . . . . . . . . . 12 |- ( 1 = 0 -> ( 1 =/= 0 -> ( P mod 8 ) e. { 1 , 7 } ) )
73	71, 72	mpi 15	. . . . . . . . . . 11 |- ( 1 = 0 -> ( P mod 8 ) e. { 1 , 7 } )
74	70, 73	biimtrdi 163	. . . . . . . . . 10 |- ( -. ( P mod 8 ) e. { 1 , 7 } -> ( if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 -> ( P mod 8 ) e. { 1 , 7 } ) )
75	74	jao1i 808	. . . . . . . . 9 |- ( ( ( P mod 8 ) e. { 1 , 7 } \/ -. ( P mod 8 ) e. { 1 , 7 } ) -> ( if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 -> ( P mod 8 ) e. { 1 , 7 } ) )
76	68, 75	syl 14	. . . . . . . 8 |- ( P e. Prime -> ( if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 -> ( P mod 8 ) e. { 1 , 7 } ) )
77		iftrue 3645	. . . . . . . 8 |- ( ( P mod 8 ) e. { 1 , 7 } -> if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 )
78	76, 77	impbid1 142	. . . . . . 7 |- ( P e. Prime -> ( if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 <-> ( P mod 8 ) e. { 1 , 7 } ) )
79	78	adantr 276	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 <-> ( P mod 8 ) e. { 1 , 7 } ) )
80	45, 48, 79	3bitrd 214	. . . . 5 |- ( ( P e. Prime /\ -. 2 || P ) -> ( 2 || ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) <-> ( P mod 8 ) e. { 1 , 7 } ) )
81	39, 42, 80	3bitrd 214	. . . 4 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( 2 /L P ) = 1 <-> ( P mod 8 ) e. { 1 , 7 } ) )
82	81	expcom 116	. . 3 |- ( -. 2 || P -> ( P e. Prime -> ( ( 2 /L P ) = 1 <-> ( P mod 8 ) e. { 1 , 7 } ) ) )
83	9, 82	jaoi 728	. 2 |- ( ( P = 2 \/ -. 2 || P ) -> ( P e. Prime -> ( ( 2 /L P ) = 1 <-> ( P mod 8 ) e. { 1 , 7 } ) ) )
84	1, 83	mpcom 36	1 |- ( P e. Prime -> ( ( 2 /L P ) = 1 <-> ( P mod 8 ) e. { 1 , 7 } ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720  DECID wdc 846   /\ w3a 1009   = wceq 1402   e. wcel 2209   =/= wne 2420   E.wrex 2529   {crab 2532   \ cdif 3217   ifcif 3638   {csn 3709   {cpr 3710   class class class wbr 4130   |-> cmpt 4192   ` cfv 5377  (class class class)co 6085   0cc0 8179   1c1 8180   x. cmul 8184   < clt 8360   - cmin 8497   -ucneg 8498   / cdiv 9003   NNcn 9305   2c2 9356   4c4 9358   7c7 9361   8c8 9362   NN0cn0 9565   ZZcz 9646   ...cfz 10413   |_cfl 10705   mod cmo 10761   ^cexp 10977  ♯chash 11216   || cdvds 12556   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-ico 10298  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:  2lgsoddprm  16244