ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  4sqleminfi Unicode version

Theorem 4sqleminfi 12969
Description: Lemma for 4sq 12982.  A  i^i  ran 
F 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 ) }
4sqlemffi.f  |-  F  =  ( v  e.  A  |->  ( ( P  - 
1 )  -  v
) )
Assertion
Ref Expression
4sqleminfi  |-  ( ph  ->  ( A  i^i  ran  F )  e.  Fin )
Distinct variable groups:    m, N, u    P, m, u    ph, m, u    v, A    ph, v
Allowed substitution hints:    A( u, m)    P( v)    F( v, u, m)    N( v)

Proof of Theorem 4sqleminfi
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 4sqlemafi.n . . 3  |-  ( ph  ->  N  e.  NN )
2 4sqlemafi.p . . 3  |-  ( ph  ->  P  e.  NN )
3 4sqlemafi.a . . 3  |-  A  =  { u  |  E. m  e.  ( 0 ... N ) u  =  ( ( m ^ 2 )  mod 
P ) }
41, 2, 34sqlemafi 12967 . 2  |-  ( ph  ->  A  e.  Fin )
5 simpr 110 . . . . . . . . . . . 12  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  ->  u  =  ( (
m ^ 2 )  mod  P ) )
6 elfzelz 10259 . . . . . . . . . . . . . . . 16  |-  ( m  e.  ( 0 ... N )  ->  m  e.  ZZ )
76ad2antlr 489 . . . . . . . . . . . . . . 15  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  ->  m  e.  ZZ )
8 zsqcl 10871 . . . . . . . . . . . . . . 15  |-  ( m  e.  ZZ  ->  (
m ^ 2 )  e.  ZZ )
97, 8syl 14 . . . . . . . . . . . . . 14  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  -> 
( m ^ 2 )  e.  ZZ )
102ad2antrr 488 . . . . . . . . . . . . . 14  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  ->  P  e.  NN )
119, 10zmodcld 10606 . . . . . . . . . . . . 13  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  -> 
( ( m ^
2 )  mod  P
)  e.  NN0 )
1211nn0zd 9599 . . . . . . . . . . . 12  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  -> 
( ( m ^
2 )  mod  P
)  e.  ZZ )
135, 12eqeltrd 2308 . . . . . . . . . . 11  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  ->  u  e.  ZZ )
1413rexlimdva2 2653 . . . . . . . . . 10  |-  ( ph  ->  ( E. m  e.  ( 0 ... N
) u  =  ( ( m ^ 2 )  mod  P )  ->  u  e.  ZZ ) )
1514abssdv 3301 . . . . . . . . 9  |-  ( ph  ->  { u  |  E. m  e.  ( 0 ... N ) u  =  ( ( m ^ 2 )  mod 
P ) }  C_  ZZ )
163, 15eqsstrid 3273 . . . . . . . 8  |-  ( ph  ->  A  C_  ZZ )
1716sselda 3227 . . . . . . 7  |-  ( (
ph  /\  x  e.  A )  ->  x  e.  ZZ )
182ad2antrr 488 . . . . . . . . . 10  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  P  e.  NN )
1918nnzd 9600 . . . . . . . . 9  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  P  e.  ZZ )
20 peano2zm 9516 . . . . . . . . 9  |-  ( P  e.  ZZ  ->  ( P  -  1 )  e.  ZZ )
2119, 20syl 14 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  ( P  -  1 )  e.  ZZ )
2216sselda 3227 . . . . . . . . 9  |-  ( (
ph  /\  v  e.  A )  ->  v  e.  ZZ )
2322adantlr 477 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  v  e.  ZZ )
2421, 23zsubcld 9606 . . . . . . 7  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  (
( P  -  1 )  -  v )  e.  ZZ )
25 zdceq 9554 . . . . . . 7  |-  ( ( x  e.  ZZ  /\  ( ( P  - 
1 )  -  v
)  e.  ZZ )  -> DECID 
x  =  ( ( P  -  1 )  -  v ) )
2617, 24, 25syl2an2r 599 . . . . . 6  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  -> DECID  x  =  (
( P  -  1 )  -  v ) )
2726ralrimiva 2605 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  A. v  e.  A DECID  x  =  (
( P  -  1 )  -  v ) )
28 finexdc 7091 . . . . 5  |-  ( ( A  e.  Fin  /\  A. v  e.  A DECID  x  =  ( ( P  - 
1 )  -  v
) )  -> DECID  E. v  e.  A  x  =  ( ( P  -  1 )  -  v ) )
294, 27, 28syl2an2r 599 . . . 4  |-  ( (
ph  /\  x  e.  A )  -> DECID  E. v  e.  A  x  =  ( ( P  -  1 )  -  v ) )
30 4sqlemffi.f . . . . . . 7  |-  F  =  ( v  e.  A  |->  ( ( P  - 
1 )  -  v
) )
3130elrnmpt 4981 . . . . . 6  |-  ( x  e.  _V  ->  (
x  e.  ran  F  <->  E. v  e.  A  x  =  ( ( P  -  1 )  -  v ) ) )
3231elv 2806 . . . . 5  |-  ( x  e.  ran  F  <->  E. v  e.  A  x  =  ( ( P  - 
1 )  -  v
) )
3332dcbii 847 . . . 4  |-  (DECID  x  e. 
ran  F  <-> DECID  E. v  e.  A  x  =  ( ( P  -  1 )  -  v ) )
3429, 33sylibr 134 . . 3  |-  ( (
ph  /\  x  e.  A )  -> DECID  x  e.  ran  F )
3534ralrimiva 2605 . 2  |-  ( ph  ->  A. x  e.  A DECID  x  e.  ran  F )
36 infidc 7132 . 2  |-  ( ( A  e.  Fin  /\  A. x  e.  A DECID  x  e. 
ran  F )  -> 
( A  i^i  ran  F )  e.  Fin )
374, 35, 36syl2anc 411 1  |-  ( ph  ->  ( A  i^i  ran  F )  e.  Fin )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 841    = wceq 1397    e. wcel 2202   {cab 2217   A.wral 2510   E.wrex 2511   _Vcvv 2802    i^i cin 3199    |-> cmpt 4150   ran crn 4726  (class class class)co 6017   Fincfn 6908   0cc0 8031   1c1 8032    - cmin 8349   NNcn 9142   2c2 9193   ZZcz 9478   ...cfz 10242    mod cmo 10583   ^cexp 10799
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 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-mulrcl 8130  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-precex 8141  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147  ax-pre-mulgt0 8148  ax-pre-mulext 8149  ax-arch 8150
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  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-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-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-frec 6556  df-1o 6581  df-er 6701  df-en 6909  df-fin 6911  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-reap 8754  df-ap 8761  df-div 8852  df-inn 9143  df-2 9201  df-n0 9402  df-z 9479  df-uz 9755  df-q 9853  df-rp 9888  df-fz 10243  df-fzo 10377  df-fl 10529  df-mod 10584  df-seqfrec 10709  df-exp 10800
This theorem is referenced by:  4sqlem11  12973  4sqlem12  12974
  Copyright terms: Public domain W3C validator