Theorem eq0rabdioph 43222

Description: This is the first of a number of theorems which allow sets to be proven Diophantine by syntactic induction, and models the correspondence between Diophantine sets and monotone existential first-order logic. This first theorem shows that the zero set of an implicit polynomial is Diophantine. (Contributed by Stefan O'Rear, 10-Oct-2014.)

Assertion

Ref	Expression
eq0rabdioph	⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 = 0} ∈ (Dioph‘𝑁))

Distinct variable group:   𝑡,𝑁

Allowed substitution hint:   𝐴(𝑡)

Proof of Theorem eq0rabdioph

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1916	. . . . . . . 8 ⊢ Ⅎ𝑡 𝑁 ∈ ℕ0
2		nfmpt1 5185	. . . . . . . . 9 ⊢ Ⅎ𝑡(𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)
3	2	nfel1 2916	. . . . . . . 8 ⊢ Ⅎ𝑡(𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))
4	1, 3	nfan 1901	. . . . . . 7 ⊢ Ⅎ𝑡(𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)))
5		zex 12524	. . . . . . . . . . . . . 14 ⊢ ℤ ∈ V
6		nn0ssz 12538	. . . . . . . . . . . . . 14 ⊢ ℕ0 ⊆ ℤ
7		mapss 8830	. . . . . . . . . . . . . 14 ⊢ ((ℤ ∈ V ∧ ℕ0 ⊆ ℤ) → (ℕ0 ↑m (1...𝑁)) ⊆ (ℤ ↑m (1...𝑁)))
8	5, 6, 7	mp2an 693	. . . . . . . . . . . . 13 ⊢ (ℕ0 ↑m (1...𝑁)) ⊆ (ℤ ↑m (1...𝑁))
9	8	sseli 3918	. . . . . . . . . . . 12 ⊢ (𝑡 ∈ (ℕ0 ↑m (1...𝑁)) → 𝑡 ∈ (ℤ ↑m (1...𝑁)))
10	9	adantl 481	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0 ↑m (1...𝑁))) → 𝑡 ∈ (ℤ ↑m (1...𝑁)))
11		mzpf 43182	. . . . . . . . . . . . 13 ⊢ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) → (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ)
12		mptfcl 43166	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ → (𝑡 ∈ (ℤ ↑m (1...𝑁)) → 𝐴 ∈ ℤ))
13	12	imp 406	. . . . . . . . . . . . 13 ⊢ (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ ∧ 𝑡 ∈ (ℤ ↑m (1...𝑁))) → 𝐴 ∈ ℤ)
14	11, 9, 13	syl2an 597	. . . . . . . . . . . 12 ⊢ (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ 𝑡 ∈ (ℕ0 ↑m (1...𝑁))) → 𝐴 ∈ ℤ)
15	14	adantll 715	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0 ↑m (1...𝑁))) → 𝐴 ∈ ℤ)
16		eqid 2737	. . . . . . . . . . . 12 ⊢ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) = (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)
17	16	fvmpt2 6953	. . . . . . . . . . 11 ⊢ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ∧ 𝐴 ∈ ℤ) → ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 𝐴)
18	10, 15, 17	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0 ↑m (1...𝑁))) → ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 𝐴)
19	18	eqcomd 2743	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0 ↑m (1...𝑁))) → 𝐴 = ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡))
20	19	eqeq1d 2739	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0 ↑m (1...𝑁))) → (𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0))
21	20	ex 412	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℕ0 ↑m (1...𝑁)) → (𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0)))
22	4, 21	ralrimi 3236	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → ∀𝑡 ∈ (ℕ0 ↑m (1...𝑁))(𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0))
23		rabbi 3420	. . . . . 6 ⊢ (∀𝑡 ∈ (ℕ0 ↑m (1...𝑁))(𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0) ↔ {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 = 0} = {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0})
24	22, 23	sylib 218	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 = 0} = {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0})
25		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑡(ℕ0 ↑m (1...𝑁))
26		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑎(ℕ0 ↑m (1...𝑁))
27		nfv 1916	. . . . . 6 ⊢ Ⅎ𝑎((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0
28		nffvmpt1 6845	. . . . . . 7 ⊢ Ⅎ𝑡((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎)
29	28	nfeq1 2915	. . . . . 6 ⊢ Ⅎ𝑡((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0
30		fveqeq2 6843	. . . . . 6 ⊢ (𝑡 = 𝑎 → (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0))
31	25, 26, 27, 29, 30	cbvrabw 3425	. . . . 5 ⊢ {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0} = {𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0}
32	24, 31	eqtrdi 2788	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 = 0} = {𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0})
33		df-rab 3391	. . . 4 ⊢ {𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0} = {𝑎 ∣ (𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0)}
34	32, 33	eqtrdi 2788	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 = 0} = {𝑎 ∣ (𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0)})
35		elmapi 8789	. . . . . . . . . 10 ⊢ (𝑏 ∈ (ℕ0 ↑m (1...𝑁)) → 𝑏:(1...𝑁)⟶ℕ0)
36		ffn 6662	. . . . . . . . . 10 ⊢ (𝑏:(1...𝑁)⟶ℕ0 → 𝑏 Fn (1...𝑁))
37		fnresdm 6611	. . . . . . . . . 10 ⊢ (𝑏 Fn (1...𝑁) → (𝑏 ↾ (1...𝑁)) = 𝑏)
38	35, 36, 37	3syl 18	. . . . . . . . 9 ⊢ (𝑏 ∈ (ℕ0 ↑m (1...𝑁)) → (𝑏 ↾ (1...𝑁)) = 𝑏)
39	38	eqeq2d 2748	. . . . . . . 8 ⊢ (𝑏 ∈ (ℕ0 ↑m (1...𝑁)) → (𝑎 = (𝑏 ↾ (1...𝑁)) ↔ 𝑎 = 𝑏))
40		equcom 2020	. . . . . . . 8 ⊢ (𝑎 = 𝑏 ↔ 𝑏 = 𝑎)
41	39, 40	bitrdi 287	. . . . . . 7 ⊢ (𝑏 ∈ (ℕ0 ↑m (1...𝑁)) → (𝑎 = (𝑏 ↾ (1...𝑁)) ↔ 𝑏 = 𝑎))
42	41	anbi1d 632	. . . . . 6 ⊢ (𝑏 ∈ (ℕ0 ↑m (1...𝑁)) → ((𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0) ↔ (𝑏 = 𝑎 ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)))
43	42	rexbiia 3083	. . . . 5 ⊢ (∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0) ↔ ∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑏 = 𝑎 ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0))
44		fveqeq2 6843	. . . . . 6 ⊢ (𝑏 = 𝑎 → (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0))
45	44	ceqsrexbv 3599	. . . . 5 ⊢ (∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑏 = 𝑎 ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0) ↔ (𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0))
46	43, 45	bitr2i 276	. . . 4 ⊢ ((𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0) ↔ ∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0))
47	46	abbii 2804	. . 3 ⊢ {𝑎 ∣ (𝑎 ∈ (ℕ0 ↑m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0)} = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)}
48	34, 47	eqtrdi 2788	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 = 0} = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)})
49		simpl 482	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → 𝑁 ∈ ℕ0)
50		nn0z 12539	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ)
51		uzid 12794	. . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ (ℤ≥‘𝑁))
52	50, 51	syl 17	. . . 4 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ (ℤ≥‘𝑁))
53	52	adantr 480	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → 𝑁 ∈ (ℤ≥‘𝑁))
54		simpr 484	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)))
55		eldioph 43204	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ (ℤ≥‘𝑁) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑎 ∣ ∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)} ∈ (Dioph‘𝑁))
56	49, 53, 54, 55	syl3anc 1374	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑎 ∣ ∃𝑏 ∈ (ℕ0 ↑m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)} ∈ (Dioph‘𝑁))
57	48, 56	eqeltrd 2837	1 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0 ↑m (1...𝑁)) ∣ 𝐴 = 0} ∈ (Dioph‘𝑁))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {cab 2715  ∀wral 3052  ∃wrex 3062  {crab 3390  Vcvv 3430   ⊆ wss 3890   ↦ cmpt 5167   ↾ cres 5626   Fn wfn 6487  ⟶wf 6488  ‘cfv 6492  (class class class)co 7360   ↑_m cmap 8766  0cc0 11029  1c1 11030  ℕ₀cn0 12428  ℤcz 12515  ℤ_≥cuz 12779  ...cfz 13452  mzPolycmzp 43168  Diophcdioph 43201

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-er 8636  df-map 8768  df-en 8887  df-dom 8888  df-sdom 8889  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-n0 12429  df-z 12516  df-uz 12780  df-fz 13453  df-mzpcl 43169  df-mzp 43170  df-dioph 43202

This theorem is referenced by:  eqrabdioph  43223  0dioph  43224  vdioph  43225  rmydioph  43460  expdioph  43469