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

Theorem 4sqleminfi 13176
Description: Lemma for 4sq 13189.  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 13174 . 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 10428 . . . . . . . . . . . . . . . 16  |-  ( m  e.  ( 0 ... N )  ->  m  e.  ZZ )
76ad2antlr 493 . . . . . . . . . . . . . . 15  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  ->  m  e.  ZZ )
8 zsqcl 11047 . . . . . . . . . . . . . . 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 492 . . . . . . . . . . . . . 14  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  ->  P  e.  NN )
119, 10zmodcld 10782 . . . . . . . . . . . . 13  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  -> 
( ( m ^
2 )  mod  P
)  e.  NN0 )
1211nn0zd 9766 . . . . . . . . . . . 12  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  -> 
( ( m ^
2 )  mod  P
)  e.  ZZ )
135, 12eqeltrd 2315 . . . . . . . . . . 11  |-  ( ( ( ph  /\  m  e.  ( 0 ... N
) )  /\  u  =  ( ( m ^ 2 )  mod 
P ) )  ->  u  e.  ZZ )
1413rexlimdva2 2671 . . . . . . . . . 10  |-  ( ph  ->  ( E. m  e.  ( 0 ... N
) u  =  ( ( m ^ 2 )  mod  P )  ->  u  e.  ZZ ) )
1514abssdv 3322 . . . . . . . . 9  |-  ( ph  ->  { u  |  E. m  e.  ( 0 ... N ) u  =  ( ( m ^ 2 )  mod 
P ) }  C_  ZZ )
163, 15eqsstrid 3294 . . . . . . . 8  |-  ( ph  ->  A  C_  ZZ )
1716sselda 3248 . . . . . . 7  |-  ( (
ph  /\  x  e.  A )  ->  x  e.  ZZ )
182ad2antrr 492 . . . . . . . . . 10  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  P  e.  NN )
1918nnzd 9767 . . . . . . . . 9  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  P  e.  ZZ )
20 peano2zm 9682 . . . . . . . . 9  |-  ( P  e.  ZZ  ->  ( P  -  1 )  e.  ZZ )
2119, 20syl 14 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  ( P  -  1 )  e.  ZZ )
2216sselda 3248 . . . . . . . . 9  |-  ( (
ph  /\  v  e.  A )  ->  v  e.  ZZ )
2322adantlr 481 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  v  e.  ZZ )
2421, 23zsubcld 9773 . . . . . . 7  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  ->  (
( P  -  1 )  -  v )  e.  ZZ )
25 zdceq 9720 . . . . . . 7  |-  ( ( x  e.  ZZ  /\  ( ( P  - 
1 )  -  v
)  e.  ZZ )  -> DECID 
x  =  ( ( P  -  1 )  -  v ) )
2617, 24, 25syl2an2r 603 . . . . . 6  |-  ( ( ( ph  /\  x  e.  A )  /\  v  e.  A )  -> DECID  x  =  (
( P  -  1 )  -  v ) )
2726ralrimiva 2623 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  A. v  e.  A DECID  x  =  (
( P  -  1 )  -  v ) )
28 finexdc 7207 . . . . 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 603 . . . 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 5031 . . . . . 6  |-  ( x  e.  _V  ->  (
x  e.  ran  F  <->  E. v  e.  A  x  =  ( ( P  -  1 )  -  v ) ) )
3231elv 2825 . . . . 5  |-  ( x  e.  ran  F  <->  E. v  e.  A  x  =  ( ( P  - 
1 )  -  v
) )
3332dcbii 852 . . . 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 2623 . 2  |-  ( ph  ->  A. x  e.  A DECID  x  e.  ran  F )
36 infidc 7248 . 2  |-  ( ( A  e.  Fin  /\  A. x  e.  A DECID  x  e. 
ran  F )  -> 
( A  i^i  ran  F )  e.  Fin )
374, 35, 36syl2anc 415 1  |-  ( ph  ->  ( A  i^i  ran  F )  e.  Fin )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 846    = wceq 1402    e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   _Vcvv 2821    i^i cin 3219    |-> cmpt 4192   ran crn 4775  (class class class)co 6085   Fincfn 7022   0cc0 8179   1c1 8180    - cmin 8497   NNcn 9304   2c2 9355   ZZcz 9644   ...cfz 10411    mod cmo 10759   ^cexp 10975
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
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  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-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-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-en 7023  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-fz 10412  df-fzo 10550  df-fl 10705  df-mod 10760  df-seqfrec 10885  df-exp 10976
This theorem is used by:  4sqlem11  13180  4sqlem12  13181
  Copyright terms: Public domain W3C validator