Metamath Proof Explorer


Theorem rabdiophlem1

Description: Lemma for arithmetic diophantine sets. Convert polynomial-ness of an expression into a constraint suitable for ralimi . (Contributed by Stefan O'Rear, 10-Oct-2014)

Ref Expression
Assertion rabdiophlem1 ⊢ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ

Proof

Step Hyp Ref Expression
1 zex ⊢ ℤ ∈ V
2 nn0ssz ⊢ ℕ 0 ⊆ ℤ
3 mapss ⊢ ℤ ∈ V ∧ ℕ 0 ⊆ ℤ → ℕ 0 1 … N ⊆ ℤ 1 … N
4 1 2 3 mp2an ⊢ ℕ 0 1 … N ⊆ ℤ 1 … N
5 mzpf ⊢ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → t ∈ ℤ 1 … N ⟼ A : ℤ 1 … N ⟶ ℤ
6 eqid ⊢ t ∈ ℤ 1 … N ⟼ A = t ∈ ℤ 1 … N ⟼ A
7 6 fmpt ⊢ ∀ t ∈ ℤ 1 … N A ∈ ℤ ↔ t ∈ ℤ 1 … N ⟼ A : ℤ 1 … N ⟶ ℤ
8 5 7 sylibr ⊢ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → ∀ t ∈ ℤ 1 … N A ∈ ℤ
9 ssralv ⊢ ℕ 0 1 … N ⊆ ℤ 1 … N → ∀ t ∈ ℤ 1 … N A ∈ ℤ → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ
10 4 8 9 mpsyl ⊢ t ∈ ℤ 1 … N ⟼ A ∈ mzPoly ⁡ 1 … N → ∀ t ∈ ℕ 0 1 … N A ∈ ℤ