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 38112
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 38122 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𝑚 𝑆)(𝑡 = (𝑢 ↾ (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 38106 . . 3 (𝐴 ∈ (Dioph‘𝑁) ↔ (𝑁 ∈ ℕ0 ∧ ∃𝑎 ∈ (ℤ𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)}))
2 simp-5r 808 . . . . . . . . 9 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑆 ∈ V)
3 simprr 790 . . . . . . . . . 10 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑏 ∈ (mzPoly‘(1...𝑎)))
43ad2antrr 718 . . . . . . . . 9 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑏 ∈ (mzPoly‘(1...𝑎)))
5 simprl 788 . . . . . . . . . 10 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → 𝑐:(1...𝑎)–1-1𝑆)
6 f1f 6316 . . . . . . . . . 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 38098 . . . . . . . . 9 ((𝑆 ∈ V ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)) ∧ 𝑐:(1...𝑎)⟶𝑆) → (𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) ∈ (mzPoly‘𝑆))
92, 4, 7, 8syl3anc 1491 . . . . . . . 8 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → (𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) ∈ (mzPoly‘𝑆))
10 simprr 790 . . . . . . . . 9 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))
11 diophrw 38108 . . . . . . . . . 10 ((𝑆 ∈ V ∧ 𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)} = {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)})
1211eqcomd 2805 . . . . . . . . 9 ((𝑆 ∈ V ∧ 𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) → {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)})
132, 5, 10, 12syl3anc 1491 . . . . . . . 8 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)})
14 fveq1 6410 . . . . . . . . . . . . 13 (𝑝 = (𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) → (𝑝𝑢) = ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢))
1514eqeq1d 2801 . . . . . . . . . . . 12 (𝑝 = (𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) → ((𝑝𝑢) = 0 ↔ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0))
1615anbi2d 623 . . . . . . . . . . 11 (𝑝 = (𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) → ((𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0) ↔ (𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)))
1716rexbidv 3233 . . . . . . . . . 10 (𝑝 = (𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) → (∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0) ↔ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)))
1817abbidv 2918 . . . . . . . . 9 (𝑝 = (𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)})
1918rspceeqv 3515 . . . . . . . 8 (((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐))) ∈ (mzPoly‘𝑆) ∧ {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ ((𝑒 ∈ (ℤ ↑𝑚 𝑆) ↦ (𝑏‘(𝑒𝑐)))‘𝑢) = 0)}) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
209, 13, 19syl2anc 580 . . . . . . 7 ((((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) ∧ 𝑐 ∈ V) ∧ (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁)))) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
21 simplll 792 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑁 ∈ ℕ0)
22 simplrl 796 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ¬ 𝑆 ∈ Fin)
23 simplrr 797 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → (1...𝑁) ⊆ 𝑆)
24 simprl 788 . . . . . . . . 9 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → 𝑎 ∈ (ℤ𝑁))
25 eldioph2lem2 38110 . . . . . . . . 9 (((𝑁 ∈ ℕ0 ∧ ¬ 𝑆 ∈ Fin) ∧ ((1...𝑁) ⊆ 𝑆𝑎 ∈ (ℤ𝑁))) → ∃𝑐(𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
2621, 22, 23, 24, 25syl22anc 868 . . . . . . . 8 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑐(𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
27 rexv 3408 . . . . . . . 8 (∃𝑐 ∈ V (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))) ↔ ∃𝑐(𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
2826, 27sylibr 226 . . . . . . 7 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑐 ∈ V (𝑐:(1...𝑎)–1-1𝑆 ∧ (𝑐 ↾ (1...𝑁)) = ( I ↾ (1...𝑁))))
2920, 28r19.29a 3259 . . . . . 6 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
30 eqeq1 2803 . . . . . . 7 (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → (𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ↔ {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3130rexbidv 3233 . . . . . 6 (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → (∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ↔ ∃𝑝 ∈ (mzPoly‘𝑆){𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3229, 31syl5ibrcom 239 . . . . 5 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ (𝑎 ∈ (ℤ𝑁) ∧ 𝑏 ∈ (mzPoly‘(1...𝑎)))) → (𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3332rexlimdvva 3219 . . . 4 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (∃𝑎 ∈ (ℤ𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)} → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
3433adantld 485 . . 3 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → ((𝑁 ∈ ℕ0 ∧ ∃𝑎 ∈ (ℤ𝑁)∃𝑏 ∈ (mzPoly‘(1...𝑎))𝐴 = {𝑡 ∣ ∃𝑑 ∈ (ℕ0𝑚 (1...𝑎))(𝑡 = (𝑑 ↾ (1...𝑁)) ∧ (𝑏𝑑) = 0)}) → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
351, 34syl5bi 234 . 2 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (𝐴 ∈ (Dioph‘𝑁) → ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
36 simpr 478 . . . . 5 (((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}) → 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)})
37 simplll 792 . . . . . . 7 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑁 ∈ ℕ0)
38 simpllr 794 . . . . . . 7 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑆 ∈ V)
39 simplrr 797 . . . . . . 7 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → (1...𝑁) ⊆ 𝑆)
40 simpr 478 . . . . . . 7 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → 𝑝 ∈ (mzPoly‘𝑆))
41 eldioph2 38111 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝑆 ∈ V ∧ (1...𝑁) ⊆ 𝑆) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ∈ (Dioph‘𝑁))
4237, 38, 39, 40, 41syl121anc 1495 . . . . . 6 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ∈ (Dioph‘𝑁))
4342adantr 473 . . . . 5 (((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}) → {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} ∈ (Dioph‘𝑁))
4436, 43eqeltrd 2878 . . . 4 (((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) ∧ 𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}) → 𝐴 ∈ (Dioph‘𝑁))
4544ex 402 . . 3 ((((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) ∧ 𝑝 ∈ (mzPoly‘𝑆)) → (𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} → 𝐴 ∈ (Dioph‘𝑁)))
4645rexlimdva 3212 . 2 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)} → 𝐴 ∈ (Dioph‘𝑁)))
4735, 46impbid 204 1 (((𝑁 ∈ ℕ0𝑆 ∈ V) ∧ (¬ 𝑆 ∈ Fin ∧ (1...𝑁) ⊆ 𝑆)) → (𝐴 ∈ (Dioph‘𝑁) ↔ ∃𝑝 ∈ (mzPoly‘𝑆)𝐴 = {𝑡 ∣ ∃𝑢 ∈ (ℕ0𝑚 𝑆)(𝑡 = (𝑢 ↾ (1...𝑁)) ∧ (𝑝𝑢) = 0)}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 385  w3a 1108   = wceq 1653  wex 1875  wcel 2157  {cab 2785  wrex 3090  Vcvv 3385  wss 3769  cmpt 4922   I cid 5219  cres 5314  ccom 5316  wf 6097  1-1wf1 6098  cfv 6101  (class class class)co 6878  𝑚 cmap 8095  Fincfn 8195  0cc0 10224  1c1 10225  0cn0 11580  cz 11666  cuz 11930  ...cfz 12580  mzPolycmzp 38071  Diophcdioph 38104
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-8 2159  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-rep 4964  ax-sep 4975  ax-nul 4983  ax-pow 5035  ax-pr 5097  ax-un 7183  ax-cnex 10280  ax-resscn 10281  ax-1cn 10282  ax-icn 10283  ax-addcl 10284  ax-addrcl 10285  ax-mulcl 10286  ax-mulrcl 10287  ax-mulcom 10288  ax-addass 10289  ax-mulass 10290  ax-distr 10291  ax-i2m1 10292  ax-1ne0 10293  ax-1rid 10294  ax-rnegex 10295  ax-rrecex 10296  ax-cnre 10297  ax-pre-lttri 10298  ax-pre-lttrn 10299  ax-pre-ltadd 10300  ax-pre-mulgt0 10301
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3or 1109  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2591  df-eu 2609  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ne 2972  df-nel 3075  df-ral 3094  df-rex 3095  df-reu 3096  df-rmo 3097  df-rab 3098  df-v 3387  df-sbc 3634  df-csb 3729  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-pss 3785  df-nul 4116  df-if 4278  df-pw 4351  df-sn 4369  df-pr 4371  df-tp 4373  df-op 4375  df-uni 4629  df-int 4668  df-iun 4712  df-br 4844  df-opab 4906  df-mpt 4923  df-tr 4946  df-id 5220  df-eprel 5225  df-po 5233  df-so 5234  df-fr 5271  df-we 5273  df-xp 5318  df-rel 5319  df-cnv 5320  df-co 5321  df-dm 5322  df-rn 5323  df-res 5324  df-ima 5325  df-pred 5898  df-ord 5944  df-on 5945  df-lim 5946  df-suc 5947  df-iota 6064  df-fun 6103  df-fn 6104  df-f 6105  df-f1 6106  df-fo 6107  df-f1o 6108  df-fv 6109  df-riota 6839  df-ov 6881  df-oprab 6882  df-mpt2 6883  df-of 7131  df-om 7300  df-1st 7401  df-2nd 7402  df-wrecs 7645  df-recs 7707  df-rdg 7745  df-1o 7799  df-oadd 7803  df-er 7982  df-map 8097  df-en 8196  df-dom 8197  df-sdom 8198  df-fin 8199  df-card 9051  df-cda 9278  df-pnf 10365  df-mnf 10366  df-xr 10367  df-ltxr 10368  df-le 10369  df-sub 10558  df-neg 10559  df-nn 11313  df-n0 11581  df-z 11667  df-uz 11931  df-fz 12581  df-hash 13371  df-mzpcl 38072  df-mzp 38073  df-dioph 38105
This theorem is referenced by:  eldioph3b  38114  diophin  38122  diophun  38123  eldioph4b  38161
  Copyright terms: Public domain W3C validator