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

Theorem elnn0rabdioph 44076
Description: Diophantine set builder for nonnegativity constraints. The first builder which uses a witness variable internally; an expression is nonnegative if there is a nonnegative integer equal to it. (Contributed by Stefan O'Rear, 11-Oct-2014.)
Assertion
Ref Expression
elnn0rabdioph ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 ∈ ℕ0} ∈ (Dioph‘𝑁))
Distinct variable group:   𝑡,𝑁
Allowed substitution hint:   𝐴(𝑡)

Proof of Theorem elnn0rabdioph
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 risset 3241 . . . . 5 (𝐴 ∈ ℕ0 ↔ ∃𝑏 ∈ ℕ0 𝑏 = 𝐴)
21rabbii 3421 . . . 4 {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 ∈ ℕ0} = {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑏 ∈ ℕ0 𝑏 = 𝐴}
32a1i 11 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 ∈ ℕ0} = {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑏 ∈ ℕ0 𝑏 = 𝐴})
4 nfcv 2926 . . . 4 Ⅎ𝑡(ℕ0 ↑m (1...𝑁))
5 nfcv 2926 . . . 4 Ⅎ𝑎(ℕ0 ↑m (1...𝑁))
6 nfv 1949 . . . 4 Ⅎ𝑎∃𝑏 ∈ ℕ0 𝑏 = 𝐴
7 nfcv 2926 . . . . 5 Ⅎ𝑡ℕ0
8 nfcsb1v 3875 . . . . . 6 Ⅎ𝑡⦋𝑎 / 𝑡⦌𝐴
98nfeq2 2943 . . . . 5 Ⅎ𝑡 𝑏 = ⦋𝑎 / 𝑡⦌𝐴
107, 9nfrexw 3314 . . . 4 Ⅎ𝑡∃𝑏 ∈ ℕ0 𝑏 = ⦋𝑎 / 𝑡⦌𝐴
11 csbeq1a 3865 . . . . . 6 (𝑡 = 𝑎 → 𝐴 = ⦋𝑎 / 𝑡⦌𝐴)
1211eqeq2d 2774 . . . . 5 (𝑡 = 𝑎 → (𝑏 = 𝐴 ↔ 𝑏 = ⦋𝑎 / 𝑡⦌𝐴))
1312rexbidv 3190 . . . 4 (𝑡 = 𝑎 → (∃𝑏 ∈ ℕ0 𝑏 = 𝐴 ↔ ∃𝑏 ∈ ℕ0 𝑏 = ⦋𝑎 / 𝑡⦌𝐴))
144, 5, 6, 10, 13cbvrabw 3450 . . 3 {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑏 ∈ ℕ0 𝑏 = 𝐴} = {𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑏 ∈ ℕ0 𝑏 = ⦋𝑎 / 𝑡⦌𝐴}
153, 14eqtrdi 2814 . 2 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 ∈ ℕ0} = {𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑏 ∈ ℕ0 𝑏 = ⦋𝑎 / 𝑡⦌𝐴})
16 peano2nn0 12686 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
1716adantr 486 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑁 + 1) ∈ ℕ0)
18 ovex 7484 . . . . 5 (1...(𝑁 + 1)) ∈ V
19 nn0p1nn 12685 . . . . . . 7 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
20 elfz1end 13728 . . . . . . 7 ((𝑁 + 1) ∈ ℕ ↔ (𝑁 + 1) ∈ (1...(𝑁 + 1)))
2119, 20sylib 221 . . . . . 6 (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ (1...(𝑁 + 1)))
2221adantr 486 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑁 + 1) ∈ (1...(𝑁 + 1)))
23 mzpproj 44014 . . . . 5 (((1...(𝑁 + 1)) ∈ V ∧ (𝑁 + 1) ∈ (1...(𝑁 + 1))) → (𝑐 ∈ (ℤ ↑m (1...(𝑁 + 1))) ↦ (𝑐‘(𝑁 + 1))) ∈ (mzPoly‘(1...(𝑁 + 1))))
2418, 22, 23sylancr 599 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑐 ∈ (ℤ ↑m (1...(𝑁 + 1))) ↦ (𝑐‘(𝑁 + 1))) ∈ (mzPoly‘(1...(𝑁 + 1))))
25 eqid 2763 . . . . 5 (𝑁 + 1) = (𝑁 + 1)
2625rabdiophlem2 44075 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑐 ∈ (ℤ ↑m (1...(𝑁 + 1))) ↦ ⦋(𝑐 ↾ (1...𝑁)) / 𝑡⦌𝐴) ∈ (mzPoly‘(1...(𝑁 + 1))))
27 eqrabdioph 44054 . . . 4 (((𝑁 + 1) ∈ ℕ0 ∧ (𝑐 ∈ (ℤ ↑m (1...(𝑁 + 1))) ↦ (𝑐‘(𝑁 + 1))) ∈ (mzPoly‘(1...(𝑁 + 1))) ∧ (𝑐 ∈ (ℤ ↑m (1...(𝑁 + 1))) ↦ ⦋(𝑐 ↾ (1...𝑁)) / 𝑡⦌𝐴) ∈ (mzPoly‘(1...(𝑁 + 1)))) → {𝑐 ∈ (ℕ0 ↑m (1...(𝑁 + 1))) ∣ (𝑐‘(𝑁 + 1)) = ⦋(𝑐 ↾ (1...𝑁)) / 𝑡⦌𝐴} ∈ (Dioph‘(𝑁 + 1)))
2817, 24, 26, 27syl3anc 1399 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑐 ∈ (ℕ0 ↑m (1...(𝑁 + 1))) ∣ (𝑐‘(𝑁 + 1)) = ⦋(𝑐 ↾ (1...𝑁)) / 𝑡⦌𝐴} ∈ (Dioph‘(𝑁 + 1)))
29 eqeq1 2767 . . . 4 (𝑏 = (𝑐‘(𝑁 + 1)) → (𝑏 = ⦋𝑎 / 𝑡⦌𝐴 ↔ (𝑐‘(𝑁 + 1)) = ⦋𝑎 / 𝑡⦌𝐴))
30 csbeq1 3854 . . . . 5 (𝑎 = (𝑐 ↾ (1...𝑁)) → ⦋𝑎 / 𝑡⦌𝐴 = ⦋(𝑐 ↾ (1...𝑁)) / 𝑡⦌𝐴)
3130eqeq2d 2774 . . . 4 (𝑎 = (𝑐 ↾ (1...𝑁)) → ((𝑐‘(𝑁 + 1)) = ⦋𝑎 / 𝑡⦌𝐴 ↔ (𝑐‘(𝑁 + 1)) = ⦋(𝑐 ↾ (1...𝑁)) / 𝑡⦌𝐴))
3225, 29, 31rexrabdioph 44067 . . 3 ((𝑁 ∈ ℕ0 ∧ {𝑐 ∈ (ℕ0 ↑m (1...(𝑁 + 1))) ∣ (𝑐‘(𝑁 + 1)) = ⦋(𝑐 ↾ (1...𝑁)) / 𝑡⦌𝐴} ∈ (Dioph‘(𝑁 + 1))) → {𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑏 ∈ ℕ0 𝑏 = ⦋𝑎 / 𝑡⦌𝐴} ∈ (Dioph‘𝑁))
3328, 32syldan 603 . 2 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑏 ∈ ℕ0 𝑏 = ⦋𝑎 / 𝑡⦌𝐴} ∈ (Dioph‘𝑁))
3415, 33eqeltrd 2864 1 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 ∈ ℕ0} ∈ (Dioph‘𝑁))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416  Vcvv 3454  ⦋csb 3851   ↦ cmpt 5192   ↾ cres 5660  ‘cfv 6566  (class class class)co 7451   ↑m cmap 8885  1c1 11240   + caddc 11242  ℕcn 12375  ℕ0cn0 12646  ℤcz 12733  ...cfz 13679  mzPolycmzp 43999  Diophcdioph 44032
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-inf2 9679  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-of 7725  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-n0 12647  df-z 12734  df-uz 13006  df-fz 13680  df-hash 14516  df-mzpcl 44000  df-mzp 44001  df-dioph 44033
This theorem is used by:  lerabdioph  44078
  Copyright terms: Public domain W3C validator