Theorem eldioph2b 43534

Description: While Diophantine sets were defined to have a finite number of witness variables consequtively following the observable variables, this is not necessary; they can equivalently be taken to use any witness set (𝑆 ∖ (1...𝑁)). For instance, in diophin 43543 we use this to take the two input sets to have disjoint witness sets. (Contributed by Stefan O'Rear, 8-Oct-2014.)

Assertion

Ref	Expression
eldioph2b	⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (𝐴 ∈ (Dioph‘𝑁) ↔ ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))

Distinct variable groups:   𝐴,𝑝   𝑢,𝑁,𝑡,𝑝   𝑢,𝑆,𝑡,𝑝

Allowed substitution hints:   𝐴(𝑢, 𝑡)

Proof of Theorem eldioph2b

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

Step	Hyp	Ref	Expression
1		eldiophb 43528	. . 3 ⊢ (𝐴 ∈ (Dioph‘𝑁) ↔ (𝑁 ∈ ℕ0 ∧ ∃𝑎 ∈ (ℤ≥‘𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)}))
2		simp-5r 798	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑆 ∈ V)
3		simprr 785	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑏 ∈ (mzPoly‘(1...𝑎)))
4	3	ad2antrr 739	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑏 ∈ (mzPoly‘(1...𝑎)))
5		simprl 783	. . . . . . . . . 10 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑐:(1...𝑎)–1-1→𝑆)
6		f1f 6781	. . . . . . . . . 10 ⊢ (𝑐:(1...𝑎)–1-1→𝑆 → 𝑐:(1...𝑎)⟶𝑆)
7	5, 6	syl 18	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑐:(1...𝑎)⟶𝑆)
8		mzprename 43520	. . . . . . . . 9 ⊢ ((𝑆 ∈ V ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)) ∧ 𝑐:(1...𝑎)⟶𝑆) → (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) ∈ (mzPoly‘𝑆))
9	2, 4, 7, 8	syl3anc 1398	. . . . . . . 8 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) ∈ (mzPoly‘𝑆))
10		simprr 785	. . . . . . . . 9 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
11		diophrw 43530	. . . . . . . . . 10 ⊢ ((𝑆 ∈ V ∧ 𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0)} = {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)})
12	11	eqcomd 2772	. . . . . . . . 9 ⊢ ((𝑆 ∈ V ∧ 𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0)})
13	2, 5, 10, 12	syl3anc 1398	. . . . . . . 8 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0)})
14		fveq1 6887	. . . . . . . . . . . . 13 ⊢ (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) → (𝑝‘𝑢) = ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢))
15	14	eqeq1d 2768	. . . . . . . . . . . 12 ⊢ (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) → ((𝑝‘𝑢) = 0 ↔ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0))
16	15	anbi2d 642	. . . . . . . . . . 11 ⊢ (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) → ((𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0) ↔ (𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0)))
17	16	rexbidv 3192	. . . . . . . . . 10 ⊢ (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) → (∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0) ↔ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0)))
18	17	abbidv 2832	. . . . . . . . 9 ⊢ (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0)})
19	18	rspceeqv 3607	. . . . . . . 8 ⊢ (((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐))) ∈ (mzPoly‘𝑆) ∧ {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒 ∘ 𝑐)))‘𝑢) = 0)}) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)})
20	9, 13, 19	syl2anc 596	. . . . . . 7 ⊢ ((((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)})
21		simplll 787	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑁 ∈ ℕ0)
22		simplrl 789	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ¬ 𝑆 ∈ Fin)
23		simplrr 790	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → (1...𝑁) ⊆ 𝑆)
24		simprl 783	. . . . . . . . 9 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑎 ∈ (ℤ≥‘𝑁))
25		eldioph2lem2 43532	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆 ∧ 𝑎 ∈ (ℤ≥‘𝑁))) → ∃𝑐(𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
26	21, 22, 23, 24, 25	syl22anc 852	. . . . . . . 8 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑐(𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
27		rexv 3485	. . . . . . . 8 ⊢ (∃𝑐 ∈ V (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ ∃𝑐(𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
28	26, 27	sylibr 237	. . . . . . 7 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑐 ∈ V (𝑐:(1...𝑎)–1-1→𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
29	20, 28	r19.29a 3176	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)})
30		eqeq1 2770	. . . . . . 7 ⊢ (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} → (𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)} ↔ {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))
31	30	rexbidv 3192	. . . . . 6 ⊢ (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} → (∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)} ↔ ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))
32	29, 31	syl5ibrcom 250	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ≥‘𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))
33	32	rexlimdvva 3225	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (∃𝑎 ∈ (ℤ≥‘𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)} → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))
34	33	adantld 496	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → ((𝑁 ∈ ℕ0 ∧ ∃𝑎 ∈ (ℤ≥‘𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0 ↑m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏‘𝑑) = 0)}) → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))
35	1, 34	biimtrid 245	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (𝐴 ∈ (Dioph‘𝑁) → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))
36		simpr 490	. . . 4 ⊢ (((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}) → 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)})
37		simplll 787	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑁 ∈ ℕ0)
38		simpllr 788	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑆 ∈ V)
39		simplrr 790	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → (1...𝑁) ⊆ 𝑆)
40		simpr 490	. . . . . 6 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑝 ∈ (mzPoly‘𝑆))
41		eldioph2 43533	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑆 ∈ V ∧ (1...𝑁) ⊆ 𝑆) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)} ∈ (Dioph‘𝑁))
42	37, 38, 39, 40, 41	syl121anc 1402	. . . . 5 ⊢ ((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)} ∈ (Dioph‘𝑁))
43	42	adantr 486	. . . 4 ⊢ (((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)} ∈ (Dioph‘𝑁))
44	36, 43	eqeltrd 2866	. . 3 ⊢ (((((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}) → 𝐴 ∈ (Dioph‘𝑁))
45	44	rexlimdva2 3171	. 2 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)} → 𝐴 ∈ (Dioph‘𝑁)))
46	35, 45	impbid 215	1 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (𝐴 ∈ (Dioph‘𝑁) ↔ ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0 ↑m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝‘𝑢) = 0)}))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2146  {cab 2744  ∃wrex 3092  Vcvv 3458   ⊆ wss 3908   ↦ cmpt 5197   I cid 5560   ↾ cres 5668   ∘ ccom 5670  ⟶wf 6539  –1-1→wf1 6540  ‘cfv 6543  (class class class)co 7423   ↑_m cmap 8833  Fincfn 8952  0cc0 11118  1c1 11119  ℕ₀cn0 12522  ℤcz 12609  ℤ_≥cuz 12880  ...cfz 13553  mzPolycmzp 43493  Diophcdioph 43526

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-of 7687  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-oadd 8466  df-er 8703  df-map 8835  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-dju 9906  df-card 9944  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-nn 12252  df-n0 12523  df-z 12610  df-uz 12881  df-fz 13554  df-hash 14387  df-mzpcl 43494  df-mzp 43495  df-dioph 43527

This theorem is used by:  eldioph3b  43536  diophin  43543  diophun  43544  eldioph4b  43578