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

Theorem eldioph2b 39244
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 39253 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‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
Distinct variable groups:   𝐴,𝑝   𝑢,𝑁,𝑡,𝑝   𝑢,𝑆,𝑡,𝑝
Allowed substitution hints:   𝐴(𝑢,𝑡)

Proof of Theorem eldioph2b
Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eldiophb 39238 . . 3 (𝐴 ∈ (Dioph‘𝑁) ↔ (𝑁 ∈ ℕ0 ∧ ∃𝑎 ∈ (ℤ𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)}))
2 simp-5r 782 . . . . . . . . 9 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑆 ∈ V)
3 simprr 769 . . . . . . . . . 10 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑏 ∈ (mzPoly‘(1...𝑎)))
43ad2antrr 722 . . . . . . . . 9 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑏 ∈ (mzPoly‘(1...𝑎)))
5 simprl 767 . . . . . . . . . 10 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑐:(1...𝑎)–1-1𝑆)
6 f1f 6574 . . . . . . . . . 10 (𝑐:(1...𝑎)–1-1𝑆𝑐:(1...𝑎)⟶𝑆)
75, 6syl 17 . . . . . . . . 9 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑐:(1...𝑎)⟶𝑆)
8 mzprename 39230 . . . . . . . . 9 ((𝑆 ∈ V ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)) ∧ 𝑐:(1...𝑎)⟶𝑆) → (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) ∈ (mzPoly‘𝑆))
92, 4, 7, 8syl3anc 1365 . . . . . . . 8 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) ∈ (mzPoly‘𝑆))
10 simprr 769 . . . . . . . . 9 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
11 diophrw 39240 . . . . . . . . . 10 ((𝑆 ∈ V ∧ 𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)} = {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)})
1211eqcomd 2832 . . . . . . . . 9 ((𝑆 ∈ V ∧ 𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)})
132, 5, 10, 12syl3anc 1365 . . . . . . . 8 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)})
14 fveq1 6668 . . . . . . . . . . . . 13 (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) → (𝑝𝑢) = ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢))
1514eqeq1d 2828 . . . . . . . . . . . 12 (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) → ((𝑝𝑢) = 0 ↔ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0))
1615anbi2d 628 . . . . . . . . . . 11 (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) → ((𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0) ↔ (𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)))
1716rexbidv 3302 . . . . . . . . . 10 (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) → (∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0) ↔ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)))
1817abbidv 2890 . . . . . . . . 9 (𝑝 = (𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)})
1918rspceeqv 3642 . . . . . . . 8 (((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐))) ∈ (mzPoly‘𝑆) ∧ {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑m 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)}) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
209, 13, 19syl2anc 584 . . . . . . 7 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
21 simplll 771 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑁 ∈ ℕ0)
22 simplrl 773 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ¬ 𝑆 ∈ Fin)
23 simplrr 774 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → (1...𝑁) ⊆ 𝑆)
24 simprl 767 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑎 ∈ (ℤ𝑁))
25 eldioph2lem2 39242 . . . . . . . . 9 (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝑎 ∈ (ℤ𝑁))) → ∃𝑐(𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
2621, 22, 23, 24, 25syl22anc 836 . . . . . . . 8 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑐(𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
27 rexv 3526 . . . . . . . 8 (∃𝑐 ∈ V (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ ∃𝑐(𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
2826, 27sylibr 235 . . . . . . 7 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑐 ∈ V (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
2920, 28r19.29a 3294 . . . . . 6 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
30 eqeq1 2830 . . . . . . 7 (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → (𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ↔ {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3130rexbidv 3302 . . . . . 6 (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → (∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ↔ ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3229, 31syl5ibrcom 248 . . . . 5 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3332rexlimdvva 3299 . . . 4 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (∃𝑎 ∈ (ℤ𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3433adantld 491 . . 3 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → ((𝑁 ∈ ℕ0 ∧ ∃𝑎 ∈ (ℤ𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0m (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)}) → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
351, 34syl5bi 243 . 2 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (𝐴 ∈ (Dioph‘𝑁) → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
36 simpr 485 . . . 4 (((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}) → 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
37 simplll 771 . . . . . 6 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑁 ∈ ℕ0)
38 simpllr 772 . . . . . 6 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑆 ∈ V)
39 simplrr 774 . . . . . 6 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → (1...𝑁) ⊆ 𝑆)
40 simpr 485 . . . . . 6 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑝 ∈ (mzPoly‘𝑆))
41 eldioph2 39243 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝑆 ∈ V ∧ (1...𝑁) ⊆ 𝑆) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ∈ (Dioph‘𝑁))
4237, 38, 39, 40, 41syl121anc 1369 . . . . 5 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ∈ (Dioph‘𝑁))
4342adantr 481 . . . 4 (((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ∈ (Dioph‘𝑁))
4436, 43eqeltrd 2918 . . 3 (((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}) → 𝐴 ∈ (Dioph‘𝑁))
4544rexlimdva2 3292 . 2 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} → 𝐴 ∈ (Dioph‘𝑁)))
4635, 45impbid 213 1 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (𝐴 ∈ (Dioph‘𝑁) ↔ ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0m 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  w3a 1081   = wceq 1530  wex 1773  wcel 2107  {cab 2804  wrex 3144  Vcvv 3500  wss 3940  cmpt 5143   I cid 5458  cres 5556  ccom 5558  wf 6350  1-1wf1 6351  cfv 6354  (class class class)co 7150  m cmap 8401  Fincfn 8503  0cc0 10531  1c1 10532  0cn0 11891  cz 11975  cuz 12237  ...cfz 12887  mzPolycmzp 39203  Diophcdioph 39236
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-13 2385  ax-ext 2798  ax-rep 5187  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-nel 3129  df-ral 3148  df-rex 3149  df-reu 3150  df-rmo 3151  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-pss 3958  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-tp 4569  df-op 4571  df-uni 4838  df-int 4875  df-iun 4919  df-br 5064  df-opab 5126  df-mpt 5144  df-tr 5170  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-of 7403  df-om 7574  df-1st 7685  df-2nd 7686  df-wrecs 7943  df-recs 8004  df-rdg 8042  df-1o 8098  df-oadd 8102  df-er 8284  df-map 8403  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-dju 9324  df-card 9362  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-n0 11892  df-z 11976  df-uz 12238  df-fz 12888  df-hash 13686  df-mzpcl 39204  df-mzp 39205  df-dioph 39237
This theorem is referenced by:  eldioph3b  39246  diophin  39253  diophun  39254  eldioph4b  39292
  Copyright terms: Public domain W3C validator