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

Theorem ltrabdioph 26212
Description: Diophantine set builder for the strict less than relation. (Contributed by Stefan O'Rear, 11-Oct-2014.)
Assertion
Ref Expression
ltrabdioph  |-  ( ( N  e.  NN0  /\  ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  ->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  A  <  B }  e.  (Dioph `  N
) )
Distinct variable group:    t, N
Allowed substitution hints:    A( t)    B( t)

Proof of Theorem ltrabdioph
StepHypRef Expression
1 rabdiophlem1 26205 . . . 4  |-  ( ( t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  A )  e.  (mzPoly `  ( 1 ... N
) )  ->  A. t  e.  ( NN0  ^m  (
1 ... N ) ) A  e.  ZZ )
2 rabdiophlem1 26205 . . . 4  |-  ( ( t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) )  ->  A. t  e.  ( NN0  ^m  (
1 ... N ) ) B  e.  ZZ )
3 znnsub 10156 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  <  B  <->  ( B  -  A )  e.  NN ) )
43ralimi 2694 . . . . 5  |-  ( A. t  e.  ( NN0  ^m  ( 1 ... N
) ) ( A  e.  ZZ  /\  B  e.  ZZ )  ->  A. t  e.  ( NN0  ^m  (
1 ... N ) ) ( A  <  B  <->  ( B  -  A )  e.  NN ) )
5 r19.26 2751 . . . . 5  |-  ( A. t  e.  ( NN0  ^m  ( 1 ... N
) ) ( A  e.  ZZ  /\  B  e.  ZZ )  <->  ( A. t  e.  ( NN0  ^m  ( 1 ... N
) ) A  e.  ZZ  /\  A. t  e.  ( NN0  ^m  (
1 ... N ) ) B  e.  ZZ ) )
6 rabbi 2794 . . . . 5  |-  ( A. t  e.  ( NN0  ^m  ( 1 ... N
) ) ( A  <  B  <->  ( B  -  A )  e.  NN ) 
<->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  A  <  B }  =  { t  e.  ( NN0  ^m  (
1 ... N ) )  |  ( B  -  A )  e.  NN } )
74, 5, 63imtr3i 256 . . . 4  |-  ( ( A. t  e.  ( NN0  ^m  ( 1 ... N ) ) A  e.  ZZ  /\  A. t  e.  ( NN0 
^m  ( 1 ... N ) ) B  e.  ZZ )  ->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  A  <  B }  =  { t  e.  ( NN0  ^m  (
1 ... N ) )  |  ( B  -  A )  e.  NN } )
81, 2, 7syl2an 463 . . 3  |-  ( ( ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  ->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  A  <  B }  =  { t  e.  ( NN0  ^m  (
1 ... N ) )  |  ( B  -  A )  e.  NN } )
983adant1 973 . 2  |-  ( ( N  e.  NN0  /\  ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  ->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  A  <  B }  =  { t  e.  ( NN0  ^m  (
1 ... N ) )  |  ( B  -  A )  e.  NN } )
10 simp1 955 . . 3  |-  ( ( N  e.  NN0  /\  ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  ->  N  e.  NN0 )
11 mzpsubmpt 26144 . . . . 5  |-  ( ( ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  B )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  A )  e.  (mzPoly `  ( 1 ... N
) ) )  -> 
( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  ( B  -  A
) )  e.  (mzPoly `  ( 1 ... N
) ) )
1211ancoms 439 . . . 4  |-  ( ( ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  -> 
( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  ( B  -  A
) )  e.  (mzPoly `  ( 1 ... N
) ) )
13123adant1 973 . . 3  |-  ( ( N  e.  NN0  /\  ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  -> 
( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  ( B  -  A
) )  e.  (mzPoly `  ( 1 ... N
) ) )
14 elnnrabdioph 26211 . . 3  |-  ( ( N  e.  NN0  /\  ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  ( B  -  A
) )  e.  (mzPoly `  ( 1 ... N
) ) )  ->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  ( B  -  A )  e.  NN }  e.  (Dioph `  N
) )
1510, 13, 14syl2anc 642 . 2  |-  ( ( N  e.  NN0  /\  ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  ->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  ( B  -  A )  e.  NN }  e.  (Dioph `  N
) )
169, 15eqeltrd 2432 1  |-  ( ( N  e.  NN0  /\  ( t  e.  ( ZZ  ^m  ( 1 ... N ) ) 
|->  A )  e.  (mzPoly `  ( 1 ... N
) )  /\  (
t  e.  ( ZZ 
^m  ( 1 ... N ) )  |->  B )  e.  (mzPoly `  ( 1 ... N
) ) )  ->  { t  e.  ( NN0  ^m  ( 1 ... N ) )  |  A  <  B }  e.  (Dioph `  N
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1642    e. wcel 1710   A.wral 2619   {crab 2623   class class class wbr 4104    e. cmpt 4158   ` cfv 5337  (class class class)co 5945    ^m cmap 6860   1c1 8828    < clt 8957    - cmin 9127   NNcn 9836   NN0cn0 10057   ZZcz 10116   ...cfz 10874  mzPolycmzp 26123  Diophcdioph 26157
This theorem is referenced by:  nerabdioph  26213  expdiophlem2  26438
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339  ax-rep 4212  ax-sep 4222  ax-nul 4230  ax-pow 4269  ax-pr 4295  ax-un 4594  ax-inf2 7432  ax-cnex 8883  ax-resscn 8884  ax-1cn 8885  ax-icn 8886  ax-addcl 8887  ax-addrcl 8888  ax-mulcl 8889  ax-mulrcl 8890  ax-mulcom 8891  ax-addass 8892  ax-mulass 8893  ax-distr 8894  ax-i2m1 8895  ax-1ne0 8896  ax-1rid 8897  ax-rnegex 8898  ax-rrecex 8899  ax-cnre 8900  ax-pre-lttri 8901  ax-pre-lttrn 8902  ax-pre-ltadd 8903  ax-pre-mulgt0 8904
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2213  df-mo 2214  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ne 2523  df-nel 2524  df-ral 2624  df-rex 2625  df-reu 2626  df-rmo 2627  df-rab 2628  df-v 2866  df-sbc 3068  df-csb 3158  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-pss 3244  df-nul 3532  df-if 3642  df-pw 3703  df-sn 3722  df-pr 3723  df-tp 3724  df-op 3725  df-uni 3909  df-int 3944  df-iun 3988  df-br 4105  df-opab 4159  df-mpt 4160  df-tr 4195  df-eprel 4387  df-id 4391  df-po 4396  df-so 4397  df-fr 4434  df-we 4436  df-ord 4477  df-on 4478  df-lim 4479  df-suc 4480  df-om 4739  df-xp 4777  df-rel 4778  df-cnv 4779  df-co 4780  df-dm 4781  df-rn 4782  df-res 4783  df-ima 4784  df-iota 5301  df-fun 5339  df-fn 5340  df-f 5341  df-f1 5342  df-fo 5343  df-f1o 5344  df-fv 5345  df-ov 5948  df-oprab 5949  df-mpt2 5950  df-of 6165  df-1st 6209  df-2nd 6210  df-riota 6391  df-recs 6475  df-rdg 6510  df-1o 6566  df-oadd 6570  df-er 6747  df-map 6862  df-en 6952  df-dom 6953  df-sdom 6954  df-fin 6955  df-card 7662  df-cda 7884  df-pnf 8959  df-mnf 8960  df-xr 8961  df-ltxr 8962  df-le 8963  df-sub 9129  df-neg 9130  df-nn 9837  df-n0 10058  df-z 10117  df-uz 10323  df-fz 10875  df-hash 11431  df-mzpcl 26124  df-mzp 26125  df-dioph 26158
  Copyright terms: Public domain W3C validator