Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eldiophss Structured version   Unicode version

Theorem eldiophss 30870
Description: Diophantine sets are sets of tuples of nonnegative integers. (Contributed by Stefan O'Rear, 10-Oct-2014.) (Revised by Stefan O'Rear, 6-May-2015.)
Assertion
Ref Expression
eldiophss  |-  ( A  e.  (Dioph `  B
)  ->  A  C_  ( NN0  ^m  ( 1 ... B ) ) )

Proof of Theorem eldiophss
Dummy variables  a 
b  c  d are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eldioph3b 30860 . 2  |-  ( A  e.  (Dioph `  B
)  <->  ( B  e. 
NN0  /\  E. a  e.  (mzPoly `  NN ) A  =  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B ) )  /\  ( a `  c )  =  0 ) } ) )
2 simpr 461 . . . 4  |-  ( ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  /\  A  =  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B
) )  /\  (
a `  c )  =  0 ) } )  ->  A  =  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B
) )  /\  (
a `  c )  =  0 ) } )
3 vex 3112 . . . . . . . 8  |-  d  e. 
_V
4 eqeq1 2461 . . . . . . . . . 10  |-  ( b  =  d  ->  (
b  =  ( c  |`  ( 1 ... B
) )  <->  d  =  ( c  |`  (
1 ... B ) ) ) )
54anbi1d 704 . . . . . . . . 9  |-  ( b  =  d  ->  (
( b  =  ( c  |`  ( 1 ... B ) )  /\  ( a `  c )  =  0 )  <->  ( d  =  ( c  |`  (
1 ... B ) )  /\  ( a `  c )  =  0 ) ) )
65rexbidv 2968 . . . . . . . 8  |-  ( b  =  d  ->  ( E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B
) )  /\  (
a `  c )  =  0 )  <->  E. c  e.  ( NN0  ^m  NN ) ( d  =  ( c  |`  (
1 ... B ) )  /\  ( a `  c )  =  0 ) ) )
73, 6elab 3246 . . . . . . 7  |-  ( d  e.  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B ) )  /\  ( a `  c )  =  0 ) }  <->  E. c  e.  ( NN0  ^m  NN ) ( d  =  ( c  |`  (
1 ... B ) )  /\  ( a `  c )  =  0 ) )
8 simpr 461 . . . . . . . . . . 11  |-  ( ( ( ( B  e. 
NN0  /\  a  e.  (mzPoly `  NN ) )  /\  c  e.  ( NN0  ^m  NN ) )  /\  d  =  ( c  |`  (
1 ... B ) ) )  ->  d  =  ( c  |`  (
1 ... B ) ) )
9 elfznn 11739 . . . . . . . . . . . . . 14  |-  ( a  e.  ( 1 ... B )  ->  a  e.  NN )
109ssriv 3503 . . . . . . . . . . . . 13  |-  ( 1 ... B )  C_  NN
11 elmapssres 7462 . . . . . . . . . . . . 13  |-  ( ( c  e.  ( NN0 
^m  NN )  /\  ( 1 ... B
)  C_  NN )  ->  ( c  |`  (
1 ... B ) )  e.  ( NN0  ^m  ( 1 ... B
) ) )
1210, 11mpan2 671 . . . . . . . . . . . 12  |-  ( c  e.  ( NN0  ^m  NN )  ->  ( c  |`  ( 1 ... B
) )  e.  ( NN0  ^m  ( 1 ... B ) ) )
1312ad2antlr 726 . . . . . . . . . . 11  |-  ( ( ( ( B  e. 
NN0  /\  a  e.  (mzPoly `  NN ) )  /\  c  e.  ( NN0  ^m  NN ) )  /\  d  =  ( c  |`  (
1 ... B ) ) )  ->  ( c  |`  ( 1 ... B
) )  e.  ( NN0  ^m  ( 1 ... B ) ) )
148, 13eqeltrd 2545 . . . . . . . . . 10  |-  ( ( ( ( B  e. 
NN0  /\  a  e.  (mzPoly `  NN ) )  /\  c  e.  ( NN0  ^m  NN ) )  /\  d  =  ( c  |`  (
1 ... B ) ) )  ->  d  e.  ( NN0  ^m  ( 1 ... B ) ) )
1514ex 434 . . . . . . . . 9  |-  ( ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  /\  c  e.  ( NN0  ^m  NN ) )  ->  (
d  =  ( c  |`  ( 1 ... B
) )  ->  d  e.  ( NN0  ^m  (
1 ... B ) ) ) )
1615adantrd 468 . . . . . . . 8  |-  ( ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  /\  c  e.  ( NN0  ^m  NN ) )  ->  (
( d  =  ( c  |`  ( 1 ... B ) )  /\  ( a `  c )  =  0 )  ->  d  e.  ( NN0  ^m  ( 1 ... B ) ) ) )
1716rexlimdva 2949 . . . . . . 7  |-  ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  ->  ( E. c  e.  ( NN0  ^m  NN ) ( d  =  ( c  |`  ( 1 ... B
) )  /\  (
a `  c )  =  0 )  -> 
d  e.  ( NN0 
^m  ( 1 ... B ) ) ) )
187, 17syl5bi 217 . . . . . 6  |-  ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  ->  (
d  e.  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  (
1 ... B ) )  /\  ( a `  c )  =  0 ) }  ->  d  e.  ( NN0  ^m  (
1 ... B ) ) ) )
1918ssrdv 3505 . . . . 5  |-  ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  ->  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  (
1 ... B ) )  /\  ( a `  c )  =  0 ) }  C_  ( NN0  ^m  ( 1 ... B ) ) )
2019adantr 465 . . . 4  |-  ( ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  /\  A  =  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B
) )  /\  (
a `  c )  =  0 ) } )  ->  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B ) )  /\  ( a `  c )  =  0 ) }  C_  ( NN0  ^m  ( 1 ... B ) ) )
212, 20eqsstrd 3533 . . 3  |-  ( ( ( B  e.  NN0  /\  a  e.  (mzPoly `  NN ) )  /\  A  =  { b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  ( 1 ... B
) )  /\  (
a `  c )  =  0 ) } )  ->  A  C_  ( NN0  ^m  ( 1 ... B ) ) )
2221r19.29an 2998 . 2  |-  ( ( B  e.  NN0  /\  E. a  e.  (mzPoly `  NN ) A  =  {
b  |  E. c  e.  ( NN0  ^m  NN ) ( b  =  ( c  |`  (
1 ... B ) )  /\  ( a `  c )  =  0 ) } )  ->  A  C_  ( NN0  ^m  ( 1 ... B
) ) )
231, 22sylbi 195 1  |-  ( A  e.  (Dioph `  B
)  ->  A  C_  ( NN0  ^m  ( 1 ... B ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1395    e. wcel 1819   {cab 2442   E.wrex 2808    C_ wss 3471    |` cres 5010   ` cfv 5594  (class class class)co 6296    ^m cmap 7438   0cc0 9509   1c1 9510   NNcn 10556   NN0cn0 10816   ...cfz 11697  mzPolycmzp 30816  Diophcdioph 30850
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-rep 4568  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591  ax-inf2 8075  ax-cnex 9565  ax-resscn 9566  ax-1cn 9567  ax-icn 9568  ax-addcl 9569  ax-addrcl 9570  ax-mulcl 9571  ax-mulrcl 9572  ax-mulcom 9573  ax-addass 9574  ax-mulass 9575  ax-distr 9576  ax-i2m1 9577  ax-1ne0 9578  ax-1rid 9579  ax-rnegex 9580  ax-rrecex 9581  ax-cnre 9582  ax-pre-lttri 9583  ax-pre-lttrn 9584  ax-pre-ltadd 9585  ax-pre-mulgt0 9586
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-nel 2655  df-ral 2812  df-rex 2813  df-reu 2814  df-rmo 2815  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4252  df-int 4289  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-tr 4551  df-eprel 4800  df-id 4804  df-po 4809  df-so 4810  df-fr 4847  df-we 4849  df-ord 4890  df-on 4891  df-lim 4892  df-suc 4893  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-riota 6258  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-of 6539  df-om 6700  df-1st 6799  df-2nd 6800  df-recs 7060  df-rdg 7094  df-1o 7148  df-oadd 7152  df-er 7329  df-map 7440  df-en 7536  df-dom 7537  df-sdom 7538  df-fin 7539  df-card 8337  df-cda 8565  df-pnf 9647  df-mnf 9648  df-xr 9649  df-ltxr 9650  df-le 9651  df-sub 9826  df-neg 9827  df-nn 10557  df-n0 10817  df-z 10886  df-uz 11107  df-fz 11698  df-hash 12408  df-mzpcl 30817  df-mzp 30818  df-dioph 30851
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator