Theorem diophun 41082

Description: If two sets are Diophantine, so is their union. (Contributed by Stefan O'Rear, 9-Oct-2014.) (Revised by Stefan O'Rear, 6-May-2015.)

Assertion

Ref	Expression
diophun	⊢ ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁))

Proof of Theorem diophun

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

Step	Hyp	Ref	Expression
1		eldiophelnn0 41073	. . 3 ⊢ (𝐴 ∈ (Dioph‘𝑁) → 𝑁 ∈ ℕ0)
2		nnex 12159	. . . . . 6 ⊢ ℕ ∈ V
3	2	jctr 525	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 ∈ ℕ0 ∧ ℕ ∈ V))
4		1z 12533	. . . . . . 7 ⊢ 1 ∈ ℤ
5		nnuz 12806	. . . . . . . 8 ⊢ ℕ = (ℤ≥‘1)
6	5	uzinf 13870	. . . . . . 7 ⊢ (1 ∈ ℤ → ¬ ℕ ∈ Fin)
7	4, 6	ax-mp 5	. . . . . 6 ⊢ ¬ ℕ ∈ Fin
8		elfznn 13470	. . . . . . 7 ⊢ (𝑎 ∈ (1...𝑁) → 𝑎 ∈ ℕ)
9	8	ssriv 3948	. . . . . 6 ⊢ (1...𝑁) ⊆ ℕ
10	7, 9	pm3.2i 471	. . . . 5 ⊢ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)
11		eldioph2b 41072	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → (𝐴 ∈ (Dioph‘𝑁) ↔ ∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)}))
12		eldioph2b 41072	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → (𝐵 ∈ (Dioph‘𝑁) ↔ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}))
13	11, 12	anbi12d 631	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)})))
14	3, 10, 13	sylancl 586	. . . 4 ⊢ (𝑁 ∈ ℕ0 → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)})))
15		reeanv 3217	. . . . 5 ⊢ (∃𝑎 ∈ (mzPoly‘ℕ)∃𝑐 ∈ (mzPoly‘ℕ)(𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}))
16		unab 4258	. . . . . . . . 9 ⊢ ({𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) = {𝑏 ∣ (∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0))}
17		r19.43 3125	. . . . . . . . . . 11 ⊢ (∃𝑑 ∈ (ℕ0 ↑m ℕ)((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)) ↔ (∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)))
18		andi 1006	. . . . . . . . . . . . 13 ⊢ ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑎‘𝑑) = 0 ∨ (𝑐‘𝑑) = 0)) ↔ ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)))
19		zex 12508	. . . . . . . . . . . . . . . . . . . 20 ⊢ ℤ ∈ V
20		nn0ssz 12522	. . . . . . . . . . . . . . . . . . . 20 ⊢ ℕ0 ⊆ ℤ
21		mapss 8827	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((ℤ ∈ V ∧ ℕ0 ⊆ ℤ) → (ℕ0 ↑m ℕ) ⊆ (ℤ ↑m ℕ))
22	19, 20, 21	mp2an 690	. . . . . . . . . . . . . . . . . . 19 ⊢ (ℕ0 ↑m ℕ) ⊆ (ℤ ↑m ℕ)
23	22	sseli 3940	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 ∈ (ℕ0 ↑m ℕ) → 𝑑 ∈ (ℤ ↑m ℕ))
24	23	adantl 482	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → 𝑑 ∈ (ℤ ↑m ℕ))
25		fveq2 6842	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑒 = 𝑑 → (𝑎‘𝑒) = (𝑎‘𝑑))
26		fveq2 6842	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑒 = 𝑑 → (𝑐‘𝑒) = (𝑐‘𝑑))
27	25, 26	oveq12d 7375	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑒 = 𝑑 → ((𝑎‘𝑒) · (𝑐‘𝑒)) = ((𝑎‘𝑑) · (𝑐‘𝑑)))
28		eqid 2736	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒))) = (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))
29		ovex 7390	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑎‘𝑑) · (𝑐‘𝑑)) ∈ V
30	27, 28, 29	fvmpt 6948	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 ∈ (ℤ ↑m ℕ) → ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = ((𝑎‘𝑑) · (𝑐‘𝑑)))
31	24, 30	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = ((𝑎‘𝑑) · (𝑐‘𝑑)))
32	31	eqeq1d 2738	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0 ↔ ((𝑎‘𝑑) · (𝑐‘𝑑)) = 0))
33		simplrl 775	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → 𝑎 ∈ (mzPoly‘ℕ))
34		mzpf 41045	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ (mzPoly‘ℕ) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
35	33, 34	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
36	35, 24	ffvelcdmd 7036	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (𝑎‘𝑑) ∈ ℤ)
37	36	zcnd 12608	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (𝑎‘𝑑) ∈ ℂ)
38		simplrr 776	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → 𝑐 ∈ (mzPoly‘ℕ))
39		mzpf 41045	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑐 ∈ (mzPoly‘ℕ) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
40	38, 39	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
41	40, 24	ffvelcdmd 7036	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (𝑐‘𝑑) ∈ ℤ)
42	41	zcnd 12608	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (𝑐‘𝑑) ∈ ℂ)
43	37, 42	mul0ord 11805	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (((𝑎‘𝑑) · (𝑐‘𝑑)) = 0 ↔ ((𝑎‘𝑑) = 0 ∨ (𝑐‘𝑑) = 0)))
44	32, 43	bitr2d 279	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (((𝑎‘𝑑) = 0 ∨ (𝑐‘𝑑) = 0) ↔ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0))
45	44	anbi2d 629	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑎‘𝑑) = 0 ∨ (𝑐‘𝑑) = 0)) ↔ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)))
46	18, 45	bitr3id 284	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0 ↑m ℕ)) → (((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)) ↔ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)))
47	46	rexbidva 3173	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (∃𝑑 ∈ (ℕ0 ↑m ℕ)((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)) ↔ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)))
48	17, 47	bitr3id 284	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ((∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)) ↔ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)))
49	48	abbidv 2805	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → {𝑏 ∣ (∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0))} = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)})
50	16, 49	eqtrid 2788	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ({𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)})
51		simpl 483	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑁 ∈ ℕ0)
52	2, 9	pm3.2i 471	. . . . . . . . . 10 ⊢ (ℕ ∈ V ∧ (1...𝑁) ⊆ ℕ)
53	52	a1i 11	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (ℕ ∈ V ∧ (1...𝑁) ⊆ ℕ))
54		simprl 769	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎 ∈ (mzPoly‘ℕ))
55	54, 34	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
56	55	feqmptd 6910	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎 = (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎‘𝑒)))
57	56, 54	eqeltrrd 2839	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎‘𝑒)) ∈ (mzPoly‘ℕ))
58		simprr 771	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐 ∈ (mzPoly‘ℕ))
59	58, 39	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
60	59	feqmptd 6910	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐 = (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐‘𝑒)))
61	60, 58	eqeltrrd 2839	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐‘𝑒)) ∈ (mzPoly‘ℕ))
62		mzpmulmpt 41051	. . . . . . . . . 10 ⊢ (((𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎‘𝑒)) ∈ (mzPoly‘ℕ) ∧ (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐‘𝑒)) ∈ (mzPoly‘ℕ)) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒))) ∈ (mzPoly‘ℕ))
63	57, 61, 62	syl2anc 584	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒))) ∈ (mzPoly‘ℕ))
64		eldioph2 41071	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ0 ∧ (ℕ ∈ V ∧ (1...𝑁) ⊆ ℕ) ∧ (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒))) ∈ (mzPoly‘ℕ)) → {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)} ∈ (Dioph‘𝑁))
65	51, 53, 63, 64	syl3anc 1371	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎‘𝑒) · (𝑐‘𝑒)))‘𝑑) = 0)} ∈ (Dioph‘𝑁))
66	50, 65	eqeltrd 2838	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ({𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) ∈ (Dioph‘𝑁))
67		uneq12 4118	. . . . . . . 8 ⊢ ((𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) → (𝐴 ∪ 𝐵) = ({𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}))
68	67	eleq1d 2822	. . . . . . 7 ⊢ ((𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) → ((𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁) ↔ ({𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) ∈ (Dioph‘𝑁)))
69	66, 68	syl5ibrcom 246	. . . . . 6 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ((𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) → (𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁)))
70	69	rexlimdvva 3205	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → (∃𝑎 ∈ (mzPoly‘ℕ)∃𝑐 ∈ (mzPoly‘ℕ)(𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) → (𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁)))
71	15, 70	biimtrrid 242	. . . 4 ⊢ (𝑁 ∈ ℕ0 → ((∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎‘𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0 ↑m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐‘𝑑) = 0)}) → (𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁)))
72	14, 71	sylbid 239	. . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁)))
73	1, 72	syl 17	. 2 ⊢ (𝐴 ∈ (Dioph‘𝑁) → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁)))
74	73	anabsi5 667	1 ⊢ ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴 ∪ 𝐵) ∈ (Dioph‘𝑁))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   = wceq 1541   ∈ wcel 2106  {cab 2713  ∃wrex 3073  Vcvv 3445   ∪ cun 3908   ⊆ wss 3910   ↦ cmpt 5188   ↾ cres 5635  ⟶wf 6492  ‘cfv 6496  (class class class)co 7357   ↑_m cmap 8765  Fincfn 8883  0cc0 11051  1c1 11052   · cmul 11056  ℕcn 12153  ℕ₀cn0 12413  ℤcz 12499  ...cfz 13424  mzPolycmzp 41031  Diophcdioph 41064

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-inf2 9577  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-of 7617  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-oadd 8416  df-er 8648  df-map 8767  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-dju 9837  df-card 9875  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-n0 12414  df-z 12500  df-uz 12764  df-fz 13425  df-hash 14231  df-mzpcl 41032  df-mzp 41033  df-dioph 41065

This theorem is referenced by:  orrabdioph  41090