Theorem 4sqlemafi 13093

Description: Lemma for 4sq 13108. A is finite. (Contributed by Jim Kingdon, 24-May-2025.)

Hypotheses

Ref	Expression
4sqlemafi.n	|- ( ph -> N e. NN )
4sqlemafi.p	|- ( ph -> P e. NN )
4sqlemafi.a	|- A = { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) }

Assertion

Ref	Expression
4sqlemafi	|- ( ph -> A e. Fin )

Distinct variable groups:   m, N, u   P, m, u   ph, m, u

Allowed substitution hints:   A( u, m)

Proof of Theorem 4sqlemafi

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		4sqlemafi.a	. 2 |- A = { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) }
2		0zd 9589	. . . 4 |- ( ph -> 0 e. ZZ )
3		4sqlemafi.p	. . . . 5 |- ( ph -> P e. NN )
4	3	nnzd 9699	. . . 4 |- ( ph -> P e. ZZ )
5		fzofig 10794	. . . 4 |- ( ( 0 e. ZZ /\ P e. ZZ ) -> ( 0..^ P ) e. Fin )
6	2, 4, 5	syl2anc 411	. . 3 |- ( ph -> ( 0..^ P ) e. Fin )
7		df-rex 2526	. . . . 5 |- ( E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) <-> E. m ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) )
8	7	abbii 2348	. . . 4 |- { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } = { u | E. m ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) }
9		simprr 533	. . . . . . . 8 |- ( ( ph /\ ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) ) -> u = ( ( m ^ 2 ) mod P ) )
10		elfzelz 10359	. . . . . . . . . . 11 |- ( m e. ( 0 ... N ) -> m e. ZZ )
11	10	ad2antrl 490	. . . . . . . . . 10 |- ( ( ph /\ ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) ) -> m e. ZZ )
12		zsqcl 10972	. . . . . . . . . 10 |- ( m e. ZZ -> ( m ^ 2 ) e. ZZ )
13	11, 12	syl 14	. . . . . . . . 9 |- ( ( ph /\ ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) ) -> ( m ^ 2 ) e. ZZ )
14	3	adantr 276	. . . . . . . . 9 |- ( ( ph /\ ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) ) -> P e. NN )
15		zmodfzo 10709	. . . . . . . . 9 |- ( ( ( m ^ 2 ) e. ZZ /\ P e. NN ) -> ( ( m ^ 2 ) mod P ) e. ( 0..^ P ) )
16	13, 14, 15	syl2anc 411	. . . . . . . 8 |- ( ( ph /\ ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) ) -> ( ( m ^ 2 ) mod P ) e. ( 0..^ P ) )
17	9, 16	eqeltrd 2309	. . . . . . 7 |- ( ( ph /\ ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) ) -> u e. ( 0..^ P ) )
18	17	ex 115	. . . . . 6 |- ( ph -> ( ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) -> u e. ( 0..^ P ) ) )
19	18	exlimdv 1868	. . . . 5 |- ( ph -> ( E. m ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) -> u e. ( 0..^ P ) ) )
20	19	abssdv 3312	. . . 4 |- ( ph -> { u | E. m ( m e. ( 0 ... N ) /\ u = ( ( m ^ 2 ) mod P ) ) } C_ ( 0..^ P ) )
21	8, 20	eqsstrid 3284	. . 3 |- ( ph -> { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } C_ ( 0..^ P ) )
22		0zd 9589	. . . . . 6 |- ( ( ph /\ x e. ( 0..^ P ) ) -> 0 e. ZZ )
23		4sqlemafi.n	. . . . . . . 8 |- ( ph -> N e. NN )
24	23	nnzd 9699	. . . . . . 7 |- ( ph -> N e. ZZ )
25	24	adantr 276	. . . . . 6 |- ( ( ph /\ x e. ( 0..^ P ) ) -> N e. ZZ )
26		elfzoelz 10481	. . . . . . . 8 |- ( x e. ( 0..^ P ) -> x e. ZZ )
27	26	ad2antlr 489	. . . . . . 7 |- ( ( ( ph /\ x e. ( 0..^ P ) ) /\ m e. ( 0 ... N ) ) -> x e. ZZ )
28	10	adantl 277	. . . . . . . . . 10 |- ( ( ( ph /\ x e. ( 0..^ P ) ) /\ m e. ( 0 ... N ) ) -> m e. ZZ )
29	28, 12	syl 14	. . . . . . . . 9 |- ( ( ( ph /\ x e. ( 0..^ P ) ) /\ m e. ( 0 ... N ) ) -> ( m ^ 2 ) e. ZZ )
30	3	ad2antrr 488	. . . . . . . . 9 |- ( ( ( ph /\ x e. ( 0..^ P ) ) /\ m e. ( 0 ... N ) ) -> P e. NN )
31	29, 30	zmodcld 10707	. . . . . . . 8 |- ( ( ( ph /\ x e. ( 0..^ P ) ) /\ m e. ( 0 ... N ) ) -> ( ( m ^ 2 ) mod P ) e. NN0 )
32	31	nn0zd 9698	. . . . . . 7 |- ( ( ( ph /\ x e. ( 0..^ P ) ) /\ m e. ( 0 ... N ) ) -> ( ( m ^ 2 ) mod P ) e. ZZ )
33		zdceq 9653	. . . . . . 7 |- ( ( x e. ZZ /\ ( ( m ^ 2 ) mod P ) e. ZZ ) -> DECID x = ( ( m ^ 2 ) mod P ) )
34	27, 32, 33	syl2anc 411	. . . . . 6 |- ( ( ( ph /\ x e. ( 0..^ P ) ) /\ m e. ( 0 ... N ) ) -> DECID x = ( ( m ^ 2 ) mod P ) )
35	22, 25, 34	exfzdc 10586	. . . . 5 |- ( ( ph /\ x e. ( 0..^ P ) ) -> DECID E. m e. ( 0 ... N ) x = ( ( m ^ 2 ) mod P ) )
36		vex 2816	. . . . . . 7 |- x e. _V
37		eqeq1 2239	. . . . . . . 8 |- ( u = x -> ( u = ( ( m ^ 2 ) mod P ) <-> x = ( ( m ^ 2 ) mod P ) ) )
38	37	rexbidv 2543	. . . . . . 7 |- ( u = x -> ( E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) <-> E. m e. ( 0 ... N ) x = ( ( m ^ 2 ) mod P ) ) )
39	36, 38	elab 2961	. . . . . 6 |- ( x e. { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } <-> E. m e. ( 0 ... N ) x = ( ( m ^ 2 ) mod P ) )
40	39	dcbii 848	. . . . 5 |- (DECID x e. { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } <-> DECID E. m e. ( 0 ... N ) x = ( ( m ^ 2 ) mod P ) )
41	35, 40	sylibr 134	. . . 4 |- ( ( ph /\ x e. ( 0..^ P ) ) -> DECID x e. { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } )
42	41	ralrimiva 2615	. . 3 |- ( ph -> A. x e. ( 0..^ P )DECID x e. { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } )
43		ssfidc 7198	. . 3 |- ( ( ( 0..^ P ) e. Fin /\ { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } C_ ( 0..^ P ) /\ A. x e. ( 0..^ P )DECID x e. { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } ) -> { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } e. Fin )
44	6, 21, 42, 43	syl3anc 1274	. 2 |- ( ph -> { u | E. m e. ( 0 ... N ) u = ( ( m ^ 2 ) mod P ) } e. Fin )
45	1, 44	eqeltrid 2319	1 |- ( ph -> A e. Fin )

Syntax hints:   -> wi 4   /\ wa 104  DECID wdc 842   = wceq 1398   E.wex 1541   e. wcel 2203   {cab 2218   A.wral 2520   E.wrex 2521   C_ wss 3211  (class class class)co 6050   Fincfn 6975   0cc0 8127   NNcn 9237   2c2 9288   ZZcz 9577   ...cfz 10342  ..^cfzo 10476   mod cmo 10684   ^cexp 10900

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244  ax-pre-mulext 8245  ax-arch 8246

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-po 4417  df-iso 4418  df-iord 4487  df-on 4489  df-ilim 4490  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-frec 6622  df-1o 6647  df-er 6767  df-en 6976  df-fin 6978  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856  df-div 8947  df-inn 9238  df-2 9296  df-n0 9497  df-z 9578  df-uz 9854  df-q 9952  df-rp 9987  df-fz 10343  df-fzo 10477  df-fl 10630  df-mod 10685  df-seqfrec 10810  df-exp 10901

This theorem is referenced by:  4sqlemffi  13094  4sqleminfi  13095  4sqlem11  13099