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 42796
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 42787 . . 3 (𝐴 ∈ (Dioph‘𝑁) → 𝑁 ∈ ℕ0)
2 nnex 12246 . . . . . 6 ℕ ∈ V
32jctr 524 . . . . 5 (𝑁 ∈ ℕ0 → (𝑁 ∈ ℕ0 ∧ ℕ ∈ V))
4 1z 12622 . . . . . . 7 1 ∈ ℤ
5 nnuz 12895 . . . . . . . 8 ℕ = (ℤ‘1)
65uzinf 13983 . . . . . . 7 (1 ∈ ℤ → ¬ ℕ ∈ Fin)
74, 6ax-mp 5 . . . . . 6 ¬ ℕ ∈ Fin
8 elfznn 13570 . . . . . . 7 (𝑎 ∈ (1...𝑁) → 𝑎 ∈ ℕ)
98ssriv 3962 . . . . . 6 (1...𝑁) ⊆ ℕ
107, 9pm3.2i 470 . . . . 5 (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)
11 eldioph2b 42786 . . . . . 6 (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → (𝐴 ∈ (Dioph‘𝑁) ↔ ∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)}))
12 eldioph2b 42786 . . . . . 6 (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → (𝐵 ∈ (Dioph‘𝑁) ↔ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}))
1311, 12anbi12d 632 . . . . 5 (((𝑁 ∈ ℕ0 ∧ ℕ ∈ V) ∧ (¬ ℕ ∈ Fin ∧ (1...𝑁) ⊆ ℕ)) → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)})))
143, 10, 13sylancl 586 . . . 4 (𝑁 ∈ ℕ0 → ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)})))
15 reeanv 3213 . . . . 5 (∃𝑎 ∈ (mzPoly‘ℕ)∃𝑐 ∈ (mzPoly‘ℕ)(𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) ↔ (∃𝑎 ∈ (mzPoly‘ℕ)𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ ∃𝑐 ∈ (mzPoly‘ℕ)𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}))
16 unab 4283 . . . . . . . . 9 ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) = {𝑏 ∣ (∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0))}
17 r19.43 3108 . . . . . . . . . . 11 (∃𝑑 ∈ (ℕ0m ℕ)((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)) ↔ (∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)))
18 andi 1009 . . . . . . . . . . . . 13 ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑎𝑑) = 0 ∨ (𝑐𝑑) = 0)) ↔ ((𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ (𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)))
19 zex 12597 . . . . . . . . . . . . . . . . . . . 20 ℤ ∈ V
20 nn0ssz 12611 . . . . . . . . . . . . . . . . . . . 20 0 ⊆ ℤ
21 mapss 8903 . . . . . . . . . . . . . . . . . . . 20 ((ℤ ∈ V ∧ ℕ0 ⊆ ℤ) → (ℕ0m ℕ) ⊆ (ℤ ↑m ℕ))
2219, 20, 21mp2an 692 . . . . . . . . . . . . . . . . . . 19 (ℕ0m ℕ) ⊆ (ℤ ↑m ℕ)
2322sseli 3954 . . . . . . . . . . . . . . . . . 18 (𝑑 ∈ (ℕ0m ℕ) → 𝑑 ∈ (ℤ ↑m ℕ))
2423adantl 481 . . . . . . . . . . . . . . . . 17 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑑 ∈ (ℤ ↑m ℕ))
25 fveq2 6876 . . . . . . . . . . . . . . . . . . 19 (𝑒 = 𝑑 → (𝑎𝑒) = (𝑎𝑑))
26 fveq2 6876 . . . . . . . . . . . . . . . . . . 19 (𝑒 = 𝑑 → (𝑐𝑒) = (𝑐𝑑))
2725, 26oveq12d 7423 . . . . . . . . . . . . . . . . . 18 (𝑒 = 𝑑 → ((𝑎𝑒) · (𝑐𝑒)) = ((𝑎𝑑) · (𝑐𝑑)))
28 eqid 2735 . . . . . . . . . . . . . . . . . 18 (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) = (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))
29 ovex 7438 . . . . . . . . . . . . . . . . . 18 ((𝑎𝑑) · (𝑐𝑑)) ∈ V
3027, 28, 29fvmpt 6986 . . . . . . . . . . . . . . . . 17 (𝑑 ∈ (ℤ ↑m ℕ) → ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = ((𝑎𝑑) · (𝑐𝑑)))
3124, 30syl 17 . . . . . . . . . . . . . . . 16 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = ((𝑎𝑑) · (𝑐𝑑)))
3231eqeq1d 2737 . . . . . . . . . . . . . . 15 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0 ↔ ((𝑎𝑑) · (𝑐𝑑)) = 0))
33 simplrl 776 . . . . . . . . . . . . . . . . . . 19 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑎 ∈ (mzPoly‘ℕ))
34 mzpf 42759 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (mzPoly‘ℕ) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
3533, 34syl 17 . . . . . . . . . . . . . . . . . 18 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
3635, 24ffvelcdmd 7075 . . . . . . . . . . . . . . . . 17 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑎𝑑) ∈ ℤ)
3736zcnd 12698 . . . . . . . . . . . . . . . 16 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑎𝑑) ∈ ℂ)
38 simplrr 777 . . . . . . . . . . . . . . . . . . 19 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑐 ∈ (mzPoly‘ℕ))
39 mzpf 42759 . . . . . . . . . . . . . . . . . . 19 (𝑐 ∈ (mzPoly‘ℕ) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
4038, 39syl 17 . . . . . . . . . . . . . . . . . 18 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
4140, 24ffvelcdmd 7075 . . . . . . . . . . . . . . . . 17 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑐𝑑) ∈ ℤ)
4241zcnd 12698 . . . . . . . . . . . . . . . 16 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (𝑐𝑑) ∈ ℂ)
4337, 42mul0ord 11887 . . . . . . . . . . . . . . 15 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (((𝑎𝑑) · (𝑐𝑑)) = 0 ↔ ((𝑎𝑑) = 0 ∨ (𝑐𝑑) = 0)))
4432, 43bitr2d 280 . . . . . . . . . . . . . 14 (((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) ∧ 𝑑 ∈ (ℕ0m ℕ)) → (((𝑎𝑑) = 0 ∨ (𝑐𝑑) = 0) ↔ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0))
4544anbi2d 630 . . . . . . . . . . . . 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 3162 . . . . . . . . . . 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 2801 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → {𝑏 ∣ (∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0) ∨ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0))} = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)})
5016, 49eqtrid 2782 . . . . . . . 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 770 . . . . . . . . . . . . 13 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎 ∈ (mzPoly‘ℕ))
5554, 34syl 17 . . . . . . . . . . . 12 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎:(ℤ ↑m ℕ)⟶ℤ)
5655feqmptd 6947 . . . . . . . . . . 11 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑎 = (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎𝑒)))
5756, 54eqeltrrd 2835 . . . . . . . . . 10 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎𝑒)) ∈ (mzPoly‘ℕ))
58 simprr 772 . . . . . . . . . . . . 13 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐 ∈ (mzPoly‘ℕ))
5958, 39syl 17 . . . . . . . . . . . 12 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐:(ℤ ↑m ℕ)⟶ℤ)
6059feqmptd 6947 . . . . . . . . . . 11 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → 𝑐 = (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐𝑒)))
6160, 58eqeltrrd 2835 . . . . . . . . . 10 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐𝑒)) ∈ (mzPoly‘ℕ))
62 mzpmulmpt 42765 . . . . . . . . . 10 (((𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑎𝑒)) ∈ (mzPoly‘ℕ) ∧ (𝑒 ∈ (ℤ ↑m ℕ) ↦ (𝑐𝑒)) ∈ (mzPoly‘ℕ)) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) ∈ (mzPoly‘ℕ))
6357, 61, 62syl2anc 584 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) ∈ (mzPoly‘ℕ))
64 eldioph2 42785 . . . . . . . . 9 ((𝑁 ∈ ℕ0 ∧ (ℕ ∈ V ∧ (1...𝑁) ⊆ ℕ) ∧ (𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒))) ∈ (mzPoly‘ℕ)) → {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)} ∈ (Dioph‘𝑁))
6551, 53, 63, 64syl3anc 1373 . . . . . . . 8 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m ℕ) ↦ ((𝑎𝑒) · (𝑐𝑒)))‘𝑑) = 0)} ∈ (Dioph‘𝑁))
6650, 65eqeltrd 2834 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝑎 ∈ (mzPoly‘ℕ) ∧ 𝑐 ∈ (mzPoly‘ℕ))) → ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) ∈ (Dioph‘𝑁))
67 uneq12 4138 . . . . . . . 8 ((𝐴 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∧ 𝐵 = {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}) → (𝐴𝐵) = ({𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑎𝑑) = 0)} ∪ {𝑏 ∣ ∃𝑑 ∈ (ℕ0m ℕ)(𝑏 = (𝑑 ↾ (1...𝑁)) ∧ (𝑐𝑑) = 0)}))
6867eleq1d 2819 . . . . . . 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 3198 . . . . 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 669 1 ((𝐴 ∈ (Dioph‘𝑁) ∧ 𝐵 ∈ (Dioph‘𝑁)) → (𝐴𝐵) ∈ (Dioph‘𝑁))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847   = wceq 1540  wcel 2108  {cab 2713  wrex 3060  Vcvv 3459  cun 3924  wss 3926  cmpt 5201  cres 5656  wf 6527  cfv 6531  (class class class)co 7405  m cmap 8840  Fincfn 8959  0cc0 11129  1c1 11130   · cmul 11134  cn 12240  0cn0 12501  cz 12588  ...cfz 13524  mzPolycmzp 42745  Diophcdioph 42778
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-inf2 9655  ax-cnex 11185  ax-resscn 11186  ax-1cn 11187  ax-icn 11188  ax-addcl 11189  ax-addrcl 11190  ax-mulcl 11191  ax-mulrcl 11192  ax-mulcom 11193  ax-addass 11194  ax-mulass 11195  ax-distr 11196  ax-i2m1 11197  ax-1ne0 11198  ax-1rid 11199  ax-rnegex 11200  ax-rrecex 11201  ax-cnre 11202  ax-pre-lttri 11203  ax-pre-lttrn 11204  ax-pre-ltadd 11205  ax-pre-mulgt0 11206
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-ord 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-mpo 7410  df-of 7671  df-om 7862  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8385  df-rdg 8424  df-1o 8480  df-oadd 8484  df-er 8719  df-map 8842  df-en 8960  df-dom 8961  df-sdom 8962  df-fin 8963  df-dju 9915  df-card 9953  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-le 11275  df-sub 11468  df-neg 11469  df-nn 12241  df-n0 12502  df-z 12589  df-uz 12853  df-fz 13525  df-hash 14349  df-mzpcl 42746  df-mzp 42747  df-dioph 42779
This theorem is referenced by:  orrabdioph  42804
  Copyright terms: Public domain W3C validator