Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  diophun Structured version   Visualization version   GIF version

Theorem diophun 43205
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.
StepHypRef Expression
1 eldiophelnn0 43196 . . 3 (𝐴 ∈ (Dioph‘𝑁) → 𝑁 ∈ ℕ0)
2 nnex 12180 . . . . . 6 ℕ ∈ V
32jctr 524 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 ∈ ℕ0 ∧ ℕ ∈ V))
4 1z 12557 . . . . . . 7 1 ∈ ℤ
5 nnuz 12827 . . . . . . . 8 ℕ = (ℤ‘1)
65uzinf 13927 . . . . . . 7 (1 ∈ ℤ → ¬ ℕ ∈ Fin)
74, 6ax-mp 5 . . . . . 6 ¬ ℕ ∈ Fin
8 elfznn 13507 . . . . . . 7 (𝑎 ∈ (1...𝑁) → 𝑎 ∈ ℕ)
98ssriv 3925 . . . . . 6 (1...𝑁) ⊆ ℕ
107, 9pm3.2i 470 . . . . 5 (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)
11 eldioph2b 43195 . . . . . 6 (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → (𝐴 ∈ (Dioph‘𝑁) ↔ ∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)}))
12 eldioph2b 43195 . . . . . 6 (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → (𝐵 ∈ (Dioph‘𝑁) ↔ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}))
1311, 12anbi12d 633 . . . . 5 (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)})))
143, 10, 13sylancl 587 . . . 4 (𝑁 ∈ ℕ0 → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)})))
15 reeanv 3209 . . . . 5 (∃𝑎 ∈ (mzPoly‘ℕ)∃𝑐 ∈ (mzPoly‘ℕ)(𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}))
16 unab 4248 . . . . . . . . 9 ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) = {𝑏 ∣ (∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0))}
17 r19.43 3105 . . . . . . . . . . 11 (∃𝑑 ∈ (ℕ0m ℕ)((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)) ↔ (∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)))
18 andi 1010 . . . . . . . . . . . . 13 ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑎𝑑) = 0 ∨ (𝑐𝑑) = 0)) ↔ ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)))
19 zex 12533 . . . . . . . . . . . . . . . . . . . 20 ℤ ∈ V
20 nn0ssz 12547 . . . . . . . . . . . . . . . . . . . 20 0 ⊆ ℤ
21 mapss 8837 . . . . . . . . . . . . . . . . . . . 20 ((ℤ ∈ V ∧ ℕ0 ⊆ ℤ) → (ℕ0m ℕ) ⊆ (ℤ ↑m ℕ))
2219, 20, 21mp2an 693 . . . . . . . . . . . . . . . . . . 19 (ℕ0m ℕ) ⊆ (ℤ ↑m ℕ)
2322sseli 3917 . . . . . . . . . . . . . . . . . 18 (𝑑 ∈ (ℕ0m ℕ) → 𝑑 ∈ (ℤ ↑m ℕ))
2423adantl 481 . . . . . . . . . . . . . . . . 17 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑑 ∈ (ℤ ↑m ℕ))
25 fveq2 6840 . . . . . . . . . . . . . . . . . . 19 (𝑒 = 𝑑 → (𝑎𝑒) = (𝑎𝑑))
26 fveq2 6840 . . . . . . . . . . . . . . . . . . 19 (𝑒 = 𝑑 → (𝑐𝑒) = (𝑐𝑑))
2725, 26oveq12d 7385 . . . . . . . . . . . . . . . . . 18 (𝑒 = 𝑑 → ((𝑎𝑒) · (𝑐𝑒)) = ((𝑎𝑑) · (𝑐𝑑)))
28 eqid 2736 . . . . . . . . . . . . . . . . . 18 (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) = (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))
29 ovex 7400 . . . . . . . . . . . . . . . . . 18 ((𝑎𝑑) · (𝑐𝑑)) ∈ V
3027, 28, 29fvmpt 6947 . . . . . . . . . . . . . . . . 17 (𝑑 ∈ (ℤ ↑m ℕ) → ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = ((𝑎𝑑) · (𝑐𝑑)))
3124, 30syl 17 . . . . . . . . . . . . . . . 16 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = ((𝑎𝑑) · (𝑐𝑑)))
3231eqeq1d 2738 . . . . . . . . . . . . . . 15 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0 ↔ ((𝑎𝑑) · (𝑐𝑑)) = 0))
33 simplrl 777 . . . . . . . . . . . . . . . . . . 19 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑎 ∈ (mzPoly‘ℕ))
34 mzpf 43168 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (mzPoly‘ℕ) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
3533, 34syl 17 . . . . . . . . . . . . . . . . . 18 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
3635, 24ffvelcdmd 7037 . . . . . . . . . . . . . . . . 17 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑎𝑑) ∈ ℤ)
3736zcnd 12634 . . . . . . . . . . . . . . . 16 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑎𝑑) ∈ ℂ)
38 simplrr 778 . . . . . . . . . . . . . . . . . . 19 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑐 ∈ (mzPoly‘ℕ))
39 mzpf 43168 . . . . . . . . . . . . . . . . . . 19 (𝑐 ∈ (mzPoly‘ℕ) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
4038, 39syl 17 . . . . . . . . . . . . . . . . . 18 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
4140, 24ffvelcdmd 7037 . . . . . . . . . . . . . . . . 17 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑐𝑑) ∈ ℤ)
4241zcnd 12634 . . . . . . . . . . . . . . . 16 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑐𝑑) ∈ ℂ)
4337, 42mul0ord 11798 . . . . . . . . . . . . . . 15 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (((𝑎𝑑) · (𝑐𝑑)) = 0 ↔ ((𝑎𝑑) = 0 ∨ (𝑐𝑑) = 0)))
4432, 43bitr2d 280 . . . . . . . . . . . . . 14 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (((𝑎𝑑) = 0 ∨ (𝑐𝑑) = 0) ↔ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0))
4544anbi2d 631 . . . . . . . . . . . . 13 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑎𝑑) = 0 ∨ (𝑐𝑑) = 0)) ↔ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)))
4618, 45bitr3id 285 . . . . . . . . . . . 12 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)) ↔ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)))
4746rexbidva 3159 . . . . . . . . . . 11 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (∃𝑑 ∈ (ℕ0m ℕ)((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)) ↔ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)))
4817, 47bitr3id 285 . . . . . . . . . 10 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ((∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)) ↔ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)))
4948abbidv 2802 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → {𝑏 ∣ (∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0))} = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)})
5016, 49eqtrid 2783 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)})
51 simpl 482 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑁 ∈ ℕ0)
522, 9pm3.2i 470 . . . . . . . . . 10 (ℕ ∈ V ∧ (1...𝑁) ⊆ ℕ)
5352a1i 11 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (ℕ ∈ V ∧ (1...𝑁) ⊆ ℕ))
54 simprl 771 . . . . . . . . . . . . 13 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎 ∈ (mzPoly‘ℕ))
5554, 34syl 17 . . . . . . . . . . . 12 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
5655feqmptd 6908 . . . . . . . . . . 11 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎 = (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎𝑒)))
5756, 54eqeltrrd 2837 . . . . . . . . . 10 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎𝑒)) ∈ (mzPoly‘ℕ))
58 simprr 773 . . . . . . . . . . . . 13 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐 ∈ (mzPoly‘ℕ))
5958, 39syl 17 . . . . . . . . . . . 12 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
6059feqmptd 6908 . . . . . . . . . . 11 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐 = (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐𝑒)))
6160, 58eqeltrrd 2837 . . . . . . . . . 10 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐𝑒)) ∈ (mzPoly‘ℕ))
62 mzpmulmpt 43174 . . . . . . . . . 10 (((𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎𝑒)) ∈ (mzPoly‘ℕ) ∧ (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐𝑒)) ∈ (mzPoly‘ℕ)) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) ∈ (mzPoly‘ℕ))
6357, 61, 62syl2anc 585 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) ∈ (mzPoly‘ℕ))
64 eldioph2 43194 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (ℕ ∈ V ∧ (1...𝑁) ⊆ ℕ) ∧ (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) ∈ (mzPoly‘ℕ)) → {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)} ∈ (Dioph‘𝑁))
6551, 53, 63, 64syl3anc 1374 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)} ∈ (Dioph‘𝑁))
6650, 65eqeltrd 2836 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) ∈ (Dioph‘𝑁))
67 uneq12 4103 . . . . . . . 8 ((𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) → (𝐴𝐵) = ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}))
6867eleq1d 2821 . . . . . . 7 ((𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) → ((𝐴𝐵) ∈ (Dioph‘𝑁) ↔ ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) ∈ (Dioph‘𝑁)))
6966, 68syl5ibrcom 247 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ((𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) → (𝐴𝐵) ∈ (Dioph‘𝑁)))
7069rexlimdvva 3194 . . . . 5 (𝑁 ∈ ℕ0 → (∃𝑎 ∈ (mzPoly‘ℕ)∃𝑐 ∈ (mzPoly‘ℕ)(𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) → (𝐴𝐵) ∈ (Dioph‘𝑁)))
7115, 70biimtrrid 243 . . . 4 (𝑁 ∈ ℕ0 → ((∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) → (𝐴𝐵) ∈ (Dioph‘𝑁)))
7214, 71sylbid 240 . . 3 (𝑁 ∈ ℕ0 → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴𝐵) ∈ (Dioph‘𝑁)))
731, 72syl 17 . 2 (𝐴 ∈ (Dioph‘𝑁) → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴𝐵) ∈ (Dioph‘𝑁)))
7473anabsi5 670 1 ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴𝐵) ∈ (Dioph‘𝑁))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 848   = wceq 1542  wcel 2114  {cab 2714  wrex 3061  Vcvv 3429  cun 3887  wss 3889  cmpt 5166  cres 5633  wf 6494  cfv 6498  (class class class)co 7367  m cmap 8773  Fincfn 8893  0cc0 11038  1c1 11039   · cmul 11043  cn 12174  0cn0 12437  cz 12524  ...cfz 13461  mzPolycmzp 43154  Diophcdioph 43187
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-inf2 9562  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-of 7631  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-oadd 8409  df-er 8643  df-map 8775  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-dju 9825  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-n0 12438  df-z 12525  df-uz 12789  df-fz 13462  df-hash 14293  df-mzpcl 43155  df-mzp 43156  df-dioph 43188
This theorem is referenced by:  orrabdioph  43213
  Copyright terms: Public domain W3C validator