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

Theorem ltrabdioph 40122
 Description: Diophantine set builder for the strict less than relation. (Contributed by Stefan O'Rear, 11-Oct-2014.)
Assertion
Ref Expression
ltrabdioph ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 < 𝐵} ∈ (Dioph‘𝑁))
Distinct variable group:   𝑡,𝑁
Allowed substitution hints:   𝐴(𝑡)   𝐵(𝑡)

Proof of Theorem ltrabdioph
StepHypRef Expression
1 rabdiophlem1 40115 . . . 4 ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) → ∀𝑡 ∈ (ℕ0m (1...𝑁))𝐴 ∈ ℤ)
2 rabdiophlem1 40115 . . . 4 ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁)) → ∀𝑡 ∈ (ℕ0m (1...𝑁))𝐵 ∈ ℤ)
3 znnsub 12067 . . . . . 6 ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ (𝐵𝐴) ∈ ℕ))
43ralimi 3092 . . . . 5 (∀𝑡 ∈ (ℕ0m (1...𝑁))(𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ∀𝑡 ∈ (ℕ0m (1...𝑁))(𝐴 < 𝐵 ↔ (𝐵𝐴) ∈ ℕ))
5 r19.26 3101 . . . . 5 (∀𝑡 ∈ (ℕ0m (1...𝑁))(𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ↔ (∀𝑡 ∈ (ℕ0m (1...𝑁))𝐴 ∈ ℤ ∧ ∀𝑡 ∈ (ℕ0m (1...𝑁))𝐵 ∈ ℤ))
6 rabbi 3301 . . . . 5 (∀𝑡 ∈ (ℕ0m (1...𝑁))(𝐴 < 𝐵 ↔ (𝐵𝐴) ∈ ℕ) ↔ {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 < 𝐵} = {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ (𝐵𝐴) ∈ ℕ})
74, 5, 63imtr3i 294 . . . 4 ((∀𝑡 ∈ (ℕ0m (1...𝑁))𝐴 ∈ ℤ ∧ ∀𝑡 ∈ (ℕ0m (1...𝑁))𝐵 ∈ ℤ) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 < 𝐵} = {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ (𝐵𝐴) ∈ ℕ})
81, 2, 7syl2an 598 . . 3 (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 < 𝐵} = {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ (𝐵𝐴) ∈ ℕ})
983adant1 1127 . 2 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 < 𝐵} = {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ (𝐵𝐴) ∈ ℕ})
10 simp1 1133 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → 𝑁 ∈ ℕ0)
11 mzpsubmpt 40057 . . . . 5 (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ (𝐵𝐴)) ∈ (mzPoly‘(1...𝑁)))
1211ancoms 462 . . . 4 (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ (𝐵𝐴)) ∈ (mzPoly‘(1...𝑁)))
13123adant1 1127 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ (𝐵𝐴)) ∈ (mzPoly‘(1...𝑁)))
14 elnnrabdioph 40121 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ (𝐵𝐴)) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ (𝐵𝐴) ∈ ℕ} ∈ (Dioph‘𝑁))
1510, 13, 14syl2anc 587 . 2 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ (𝐵𝐴) ∈ ℕ} ∈ (Dioph‘𝑁))
169, 15eqeltrd 2852 1 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐵) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 < 𝐵} ∈ (Dioph‘𝑁))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3070  {crab 3074   class class class wbr 5032   ↦ cmpt 5112  ‘cfv 6335  (class class class)co 7150   ↑m cmap 8416  1c1 10576   < clt 10713   − cmin 10908  ℕcn 11674  ℕ0cn0 11934  ℤcz 12020  ...cfz 12939  mzPolycmzp 40036  Diophcdioph 40069 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-rep 5156  ax-sep 5169  ax-nul 5176  ax-pow 5234  ax-pr 5298  ax-un 7459  ax-inf2 9137  ax-cnex 10631  ax-resscn 10632  ax-1cn 10633  ax-icn 10634  ax-addcl 10635  ax-addrcl 10636  ax-mulcl 10637  ax-mulrcl 10638  ax-mulcom 10639  ax-addass 10640  ax-mulass 10641  ax-distr 10642  ax-i2m1 10643  ax-1ne0 10644  ax-1rid 10645  ax-rnegex 10646  ax-rrecex 10647  ax-cnre 10648  ax-pre-lttri 10649  ax-pre-lttrn 10650  ax-pre-ltadd 10651  ax-pre-mulgt0 10652 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-nel 3056  df-ral 3075  df-rex 3076  df-reu 3077  df-rab 3079  df-v 3411  df-sbc 3697  df-csb 3806  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-pss 3877  df-nul 4226  df-if 4421  df-pw 4496  df-sn 4523  df-pr 4525  df-tp 4527  df-op 4529  df-uni 4799  df-int 4839  df-iun 4885  df-br 5033  df-opab 5095  df-mpt 5113  df-tr 5139  df-id 5430  df-eprel 5435  df-po 5443  df-so 5444  df-fr 5483  df-we 5485  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-res 5536  df-ima 5537  df-pred 6126  df-ord 6172  df-on 6173  df-lim 6174  df-suc 6175  df-iota 6294  df-fun 6337  df-fn 6338  df-f 6339  df-f1 6340  df-fo 6341  df-f1o 6342  df-fv 6343  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-of 7405  df-om 7580  df-1st 7693  df-2nd 7694  df-wrecs 7957  df-recs 8018  df-rdg 8056  df-1o 8112  df-oadd 8116  df-er 8299  df-map 8418  df-en 8528  df-dom 8529  df-sdom 8530  df-fin 8531  df-dju 9363  df-card 9401  df-pnf 10715  df-mnf 10716  df-xr 10717  df-ltxr 10718  df-le 10719  df-sub 10910  df-neg 10911  df-nn 11675  df-n0 11935  df-z 12021  df-uz 12283  df-fz 12940  df-hash 13741  df-mzpcl 40037  df-mzp 40038  df-dioph 40070 This theorem is referenced by:  nerabdioph  40123  expdiophlem2  40336
 Copyright terms: Public domain W3C validator