Theorem 2lgs 15836

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 15749) 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 12700	. 2 |- ( P e. Prime -> ( P = 2 \/ -. 2 || P ) )
2		2lgslem4 15835	. . . . . 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 6026	. . . . . 6 |- ( P = 2 -> ( 2 /L P ) = ( 2 /L 2 ) )
5	4	eqeq1d 2240	. . . . 5 |- ( P = 2 -> ( ( 2 /L P ) = 1 <-> ( 2 /L 2 ) = 1 ) )
6		oveq1 6025	. . . . . 6 |- ( P = 2 -> ( P mod 8 ) = ( 2 mod 8 ) )
7	6	eleq1d 2300	. . . . 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 12701	. . . . . . . . . 10 |- 2 e. Prime
11		prmnn 12684	. . . . . . . . . 10 |- ( P e. Prime -> P e. NN )
12		dvdsprime 12696	. . . . . . . . . 10 |- ( ( 2 e. Prime /\ P e. NN ) -> ( P || 2 <-> ( P = 2 \/ P = 1 ) ) )
13	10, 11, 12	sylancr 414	. . . . . . . . 9 |- ( P e. Prime -> ( P || 2 <-> ( P = 2 \/ P = 1 ) ) )
14		z2even 12477	. . . . . . . . . . . . 13 |- 2 || 2
15		breq2 4092	. . . . . . . . . . . . 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 2294	. . . . . . . . . . . 12 |- ( P = 1 -> ( P e. Prime <-> 1 e. Prime ) )
19		1nprm 12688	. . . . . . . . . . . . 13 |- -. 1 e. Prime
20	19	pm2.21i 651	. . . . . . . . . . . 12 |- ( 1 e. Prime -> 2 || P )
21	18, 20	biimtrdi 163	. . . . . . . . . . 11 |- ( P = 1 -> ( P e. Prime -> 2 || P ) )
22	17, 21	jaoi 723	. . . . . . . . . 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 640	. . . . . . 7 |- ( ( P e. Prime /\ -. 2 || P ) -> -. P || 2 )
26		2z 9507	. . . . . . 7 |- 2 e. ZZ
27	25, 26	jctil 312	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( 2 e. ZZ /\ -. P || 2 ) )
28		2lgslem1 15823	. . . . . . 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 2237	. . . . . 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 12837	. . . . . . . . . 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 1044	. . . . . . . 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 2231	. . . . . . . 8 |- ( ( P - 1 ) / 2 ) = ( ( P - 1 ) / 2 )
34		eqid 2231	. . . . . . . 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 2231	. . . . . . . 8 |- ( |_ ` ( P / 4 ) ) = ( |_ ` ( P / 4 ) )
36		eqid 2231	. . . . . . . 8 |- ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) = ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) )
37	32, 33, 34, 35, 36	gausslemma2d 15801	. . . . . . 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 2240	. . . . . 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 1375	. . . . 5 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( 2 /L P ) = 1 <-> ( -u 1 ^ ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) ) = 1 ) )
40	36	2lgslem2 15824	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) e. ZZ )
41		m1exp1 12464	. . . . . 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 9305	. . . . . . 7 |- 2 e. NN
44		dvdsval3 12354	. . . . . . 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 414	. . . . . 6 |- ( ( P e. Prime /\ -. 2 || P ) -> ( 2 || ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) <-> ( ( ( ( P - 1 ) / 2 ) - ( |_ ` ( P / 4 ) ) ) mod 2 ) = 0 ) )
46	36	2lgslem3 15833	. . . . . . . 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 2240	. . . . . 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 12685	. . . . . . . . . . . . . . 15 |- ( P e. Prime -> P e. ZZ )
50		8nn 9311	. . . . . . . . . . . . . . . 16 |- 8 e. NN
51	50	a1i 9	. . . . . . . . . . . . . . 15 |- ( P e. Prime -> 8 e. NN )
52	49, 51	zmodcld 10608	. . . . . . . . . . . . . 14 |- ( P e. Prime -> ( P mod 8 ) e. NN0 )
53	52	nn0zd 9600	. . . . . . . . . . . . 13 |- ( P e. Prime -> ( P mod 8 ) e. ZZ )
54		1z 9505	. . . . . . . . . . . . 13 |- 1 e. ZZ
55		zdceq 9555	. . . . . . . . . . . . 13 |- ( ( ( P mod 8 ) e. ZZ /\ 1 e. ZZ ) -> DECID ( P mod 8 ) = 1 )
56	53, 54, 55	sylancl 413	. . . . . . . . . . . 12 |- ( P e. Prime -> DECID ( P mod 8 ) = 1 )
57		7nn 9310	. . . . . . . . . . . . . 14 |- 7 e. NN
58	57	nnzi 9500	. . . . . . . . . . . . 13 |- 7 e. ZZ
59		zdceq 9555	. . . . . . . . . . . . 13 |- ( ( ( P mod 8 ) e. ZZ /\ 7 e. ZZ ) -> DECID ( P mod 8 ) = 7 )
60	53, 58, 59	sylancl 413	. . . . . . . . . . . 12 |- ( P e. Prime -> DECID ( P mod 8 ) = 7 )
61		dcor 943	. . . . . . . . . . . 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 3689	. . . . . . . . . . . . 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 845	. . . . . . . . . . 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 843	. . . . . . . . . 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 3613	. . . . . . . . . . . 12 |- ( -. ( P mod 8 ) e. { 1 , 7 } -> if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 1 )
70	69	eqeq1d 2240	. . . . . . . . . . 11 |- ( -. ( P mod 8 ) e. { 1 , 7 } -> ( if ( ( P mod 8 ) e. { 1 , 7 } , 0 , 1 ) = 0 <-> 1 = 0 ) )
71		1ne0 9211	. . . . . . . . . . . 12 |- 1 =/= 0
72		eqneqall 2412	. . . . . . . . . . . 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 803	. . . . . . . . 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 3610	. . . . . . . 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 723	. 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 } ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 715  DECID wdc 841   /\ w3a 1004   = wceq 1397   e. wcel 2202   =/= wne 2402   E.wrex 2511   {crab 2514   \ cdif 3197   ifcif 3605   {csn 3669   {cpr 3670   class class class wbr 4088   |-> cmpt 4150   ` cfv 5326  (class class class)co 6018   0cc0 8032   1c1 8033   x. cmul 8037   < clt 8214   - cmin 8350   -ucneg 8351   / cdiv 8852   NNcn 9143   2c2 9194   4c4 9196   7c7 9199   8c8 9200   NN0cn0 9402   ZZcz 9479   ...cfz 10243   |_cfl 10529   mod cmo 10585   ^cexp 10801  ♯chash 11038   || cdvds 12350   Primecprime 12681   /Lclgs 15729

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150  ax-arch 8151  ax-caucvg 8152

This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-xor 1420  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-tp 3677  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-frec 6557  df-1o 6582  df-2o 6583  df-oadd 6586  df-er 6702  df-en 6910  df-dom 6911  df-fin 6912  df-sup 7183  df-inf 7184  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-7 9207  df-8 9208  df-n0 9403  df-z 9480  df-uz 9756  df-q 9854  df-rp 9889  df-ioo 10127  df-ico 10129  df-fz 10244  df-fzo 10378  df-fl 10531  df-mod 10586  df-seqfrec 10711  df-exp 10802  df-fac 10989  df-ihash 11039  df-cj 11404  df-re 11405  df-im 11406  df-rsqrt 11560  df-abs 11561  df-clim 11841  df-proddc 12114  df-dvds 12351  df-gcd 12527  df-prm 12682  df-phi 12785  df-pc 12860  df-lgs 15730

This theorem is referenced by:  2lgsoddprm  15845