Metamath Proof Explorer


Theorem eluzrabdioph

Description: Diophantine set builder for membership in a fixed upper set of integers. (Contributed by Stefan O'Rear, 11-Oct-2014)

Ref Expression
Assertion eluzrabdioph ⊢ N ∈ ℕ 0 ∧ M ∈ ℤ ∧ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → t ∈ ℕ 0 1 … N | A ∈ ℤ ≥ M ∈ Dioph ⁡ N

Proof

Step Hyp Ref Expression
1 rabdiophlem1 ⊢ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ
2 eluz ⊢ M ∈ ℤ ∧ A ∈ ℤ → A ∈ ℤ ≥ M ↔ M ≤ A
3 2 ex ⊢ M ∈ ℤ → A ∈ ℤ → A ∈ ℤ ≥ M ↔ M ≤ A
4 3 ralimdv ⊢ M ∈ ℤ → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ ≥ M ↔ M ≤ A
5 4 imp ⊢ M ∈ ℤ ∧ ∀ t ∈ ℕ 0 1 … N A ∈ ℤ → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ ≥ M ↔ M ≤ A
6 1 5 sylan2 ⊢ M ∈ ℤ ∧ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ ≥ M ↔ M ≤ A
7 rabbi ⊢ ∀ t ∈ ℕ 0 1 … N A ∈ ℤ ≥ M ↔ M ≤ A ↔ t ∈ ℕ 0 1 … N | A ∈ ℤ ≥ M = t ∈ ℕ 0 1 … N | M ≤ A
8 6 7 sylib ⊢ M ∈ ℤ ∧ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → t ∈ ℕ 0 1 … N | A ∈ ℤ ≥ M = t ∈ ℕ 0 1 … N | M ≤ A
9 8 3adant1 ⊢ N ∈ ℕ 0 ∧ M ∈ ℤ ∧ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → t ∈ ℕ 0 1 … N | A ∈ ℤ ≥ M = t ∈ ℕ 0 1 … N | M ≤ A
10 ovex ⊢ 1 … N ∈ V
11 mzpconstmpt ⊢ 1 … N ∈ V ∧ M ∈ ℤ → t ∈ ℤ 1 … N ⟼ M ∈ mzPoly ⁡ 1 … N
12 10 11 mpan ⊢ M ∈ ℤ → t ∈ ℤ 1 … N ⟼ M ∈ mzPoly ⁡ 1 … N
13 lerabdioph ⊢ N ∈ ℕ 0 ∧ t ∈ ℤ 1 … N ⟼ M ∈ mzPoly ⁡ 1 … N ∧ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → t ∈ ℕ 0 1 … N | M ≤ A ∈ Dioph ⁡ N
14 12 13 syl3an2 ⊢ N ∈ ℕ 0 ∧ M ∈ ℤ ∧ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → t ∈ ℕ 0 1 … N | M ≤ A ∈ Dioph ⁡ N
15 9 14 eqeltrd ⊢ N ∈ ℕ 0 ∧ M ∈ ℤ ∧ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → t ∈ ℕ 0 1 … N | A ∈ ℤ ≥ M ∈ Dioph ⁡ N