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

Theorem eq0rabdioph 39238
 Description: This is the first of a number of theorems which allow sets to be proven Diophantine by syntactic induction, and models the correspondence between Diophantine sets and monotone existential first-order logic. This first theorem shows that the zero set of an implicit polynomial is Diophantine. (Contributed by Stefan O'Rear, 10-Oct-2014.)
Assertion
Ref Expression
eq0rabdioph ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 = 0} ∈ (Dioph‘𝑁))
Distinct variable group:   𝑡,𝑁
Allowed substitution hint:   𝐴(𝑡)

Proof of Theorem eq0rabdioph
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nfv 1908 . . . . . . . 8 𝑡 𝑁 ∈ ℕ0
2 nfmpt1 5161 . . . . . . . . 9 𝑡(𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)
32nfel1 2999 . . . . . . . 8 𝑡(𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))
41, 3nfan 1893 . . . . . . 7 𝑡(𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)))
5 zex 11979 . . . . . . . . . . . . . 14 ℤ ∈ V
6 nn0ssz 11992 . . . . . . . . . . . . . 14 0 ⊆ ℤ
7 mapss 8442 . . . . . . . . . . . . . 14 ((ℤ ∈ V ∧ ℕ0 ⊆ ℤ) → (ℕ0m (1...𝑁)) ⊆ (ℤ ↑m (1...𝑁)))
85, 6, 7mp2an 688 . . . . . . . . . . . . 13 (ℕ0m (1...𝑁)) ⊆ (ℤ ↑m (1...𝑁))
98sseli 3967 . . . . . . . . . . . 12 (𝑡 ∈ (ℕ0m (1...𝑁)) → 𝑡 ∈ (ℤ ↑m (1...𝑁)))
109adantl 482 . . . . . . . . . . 11 (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0m (1...𝑁))) → 𝑡 ∈ (ℤ ↑m (1...𝑁)))
11 mzpf 39198 . . . . . . . . . . . . 13 ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) → (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ)
12 mptfcl 39182 . . . . . . . . . . . . . 14 ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ → (𝑡 ∈ (ℤ ↑m (1...𝑁)) → 𝐴 ∈ ℤ))
1312imp 407 . . . . . . . . . . . . 13 (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ ∧ 𝑡 ∈ (ℤ ↑m (1...𝑁))) → 𝐴 ∈ ℤ)
1411, 9, 13syl2an 595 . . . . . . . . . . . 12 (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) ∧ 𝑡 ∈ (ℕ0m (1...𝑁))) → 𝐴 ∈ ℤ)
1514adantll 710 . . . . . . . . . . 11 (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0m (1...𝑁))) → 𝐴 ∈ ℤ)
16 eqid 2826 . . . . . . . . . . . 12 (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) = (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)
1716fvmpt2 6775 . . . . . . . . . . 11 ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ∧ 𝐴 ∈ ℤ) → ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 𝐴)
1810, 15, 17syl2anc 584 . . . . . . . . . 10 (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0m (1...𝑁))) → ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 𝐴)
1918eqcomd 2832 . . . . . . . . 9 (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0m (1...𝑁))) → 𝐴 = ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡))
2019eqeq1d 2828 . . . . . . . 8 (((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℕ0m (1...𝑁))) → (𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0))
2120ex 413 . . . . . . 7 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℕ0m (1...𝑁)) → (𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0)))
224, 21ralrimi 3221 . . . . . 6 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → ∀𝑡 ∈ (ℕ0m (1...𝑁))(𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0))
23 rabbi 3389 . . . . . 6 (∀𝑡 ∈ (ℕ0m (1...𝑁))(𝐴 = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0) ↔ {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 = 0} = {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0})
2422, 23sylib 219 . . . . 5 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 = 0} = {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0})
25 nfcv 2982 . . . . . 6 𝑡(ℕ0m (1...𝑁))
26 nfcv 2982 . . . . . 6 𝑎(ℕ0m (1...𝑁))
27 nfv 1908 . . . . . 6 𝑎((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0
28 nffvmpt1 6678 . . . . . . 7 𝑡((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎)
2928nfeq1 2998 . . . . . 6 𝑡((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0
30 fveqeq2 6676 . . . . . 6 (𝑡 = 𝑎 → (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0))
3125, 26, 27, 29, 30cbvrab 3496 . . . . 5 {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑡) = 0} = {𝑎 ∈ (ℕ0m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0}
3224, 31syl6eq 2877 . . . 4 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 = 0} = {𝑎 ∈ (ℕ0m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0})
33 df-rab 3152 . . . 4 {𝑎 ∈ (ℕ0m (1...𝑁)) ∣ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0} = {𝑎 ∣ (𝑎 ∈ (ℕ0m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0)}
3432, 33syl6eq 2877 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 = 0} = {𝑎 ∣ (𝑎 ∈ (ℕ0m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0)})
35 elmapi 8418 . . . . . . . . . 10 (𝑏 ∈ (ℕ0m (1...𝑁)) → 𝑏:(1...𝑁)⟶ℕ0)
36 ffn 6511 . . . . . . . . . 10 (𝑏:(1...𝑁)⟶ℕ0𝑏 Fn (1...𝑁))
37 fnresdm 6463 . . . . . . . . . 10 (𝑏 Fn (1...𝑁) → (𝑏 ↾ (1...𝑁)) = 𝑏)
3835, 36, 373syl 18 . . . . . . . . 9 (𝑏 ∈ (ℕ0m (1...𝑁)) → (𝑏 ↾ (1...𝑁)) = 𝑏)
3938eqeq2d 2837 . . . . . . . 8 (𝑏 ∈ (ℕ0m (1...𝑁)) → (𝑎 = (𝑏 ↾ (1...𝑁)) ↔ 𝑎 = 𝑏))
40 equcom 2018 . . . . . . . 8 (𝑎 = 𝑏𝑏 = 𝑎)
4139, 40syl6bb 288 . . . . . . 7 (𝑏 ∈ (ℕ0m (1...𝑁)) → (𝑎 = (𝑏 ↾ (1...𝑁)) ↔ 𝑏 = 𝑎))
4241anbi1d 629 . . . . . 6 (𝑏 ∈ (ℕ0m (1...𝑁)) → ((𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0) ↔ (𝑏 = 𝑎 ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)))
4342rexbiia 3251 . . . . 5 (∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0) ↔ ∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑏 = 𝑎 ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0))
44 fveqeq2 6676 . . . . . 6 (𝑏 = 𝑎 → (((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0 ↔ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0))
4544ceqsrexbv 3654 . . . . 5 (∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑏 = 𝑎 ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0) ↔ (𝑎 ∈ (ℕ0m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0))
4643, 45bitr2i 277 . . . 4 ((𝑎 ∈ (ℕ0m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0) ↔ ∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0))
4746abbii 2891 . . 3 {𝑎 ∣ (𝑎 ∈ (ℕ0m (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑎) = 0)} = {𝑎 ∣ ∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)}
4834, 47syl6eq 2877 . 2 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 = 0} = {𝑎 ∣ ∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)})
49 simpl 483 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → 𝑁 ∈ ℕ0)
50 nn0z 11994 . . . . 5 (𝑁 ∈ ℕ0𝑁 ∈ ℤ)
51 uzid 12247 . . . . 5 (𝑁 ∈ ℤ → 𝑁 ∈ (ℤ𝑁))
5250, 51syl 17 . . . 4 (𝑁 ∈ ℕ0𝑁 ∈ (ℤ𝑁))
5352adantr 481 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → 𝑁 ∈ (ℤ𝑁))
54 simpr 485 . . 3 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)))
55 eldioph 39220 . . 3 ((𝑁 ∈ ℕ0𝑁 ∈ (ℤ𝑁) ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑎 ∣ ∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)} ∈ (Dioph‘𝑁))
5649, 53, 54, 55syl3anc 1365 . 2 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑎 ∣ ∃𝑏 ∈ (ℕ0m (1...𝑁))(𝑎 = (𝑏 ↾ (1...𝑁)) ∧ ((𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘𝑏) = 0)} ∈ (Dioph‘𝑁))
5748, 56eqeltrd 2918 1 ((𝑁 ∈ ℕ0 ∧ (𝑡 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → {𝑡 ∈ (ℕ0m (1...𝑁)) ∣ 𝐴 = 0} ∈ (Dioph‘𝑁))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1530   ∈ wcel 2107  {cab 2804  ∀wral 3143  ∃wrex 3144  {crab 3147  Vcvv 3500   ⊆ wss 3940   ↦ cmpt 5143   ↾ cres 5556   Fn wfn 6347  ⟶wf 6348  ‘cfv 6352  (class class class)co 7148   ↑m cmap 8396  0cc0 10526  1c1 10527  ℕ0cn0 11886  ℤcz 11970  ℤ≥cuz 12232  ...cfz 12882  mzPolycmzp 39184  Diophcdioph 39217 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 7451  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603 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-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 6146  df-ord 6192  df-on 6193  df-lim 6194  df-suc 6195  df-iota 6312  df-fun 6354  df-fn 6355  df-f 6356  df-f1 6357  df-fo 6358  df-f1o 6359  df-fv 6360  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-of 7399  df-om 7569  df-1st 7680  df-2nd 7681  df-wrecs 7938  df-recs 7999  df-rdg 8037  df-er 8279  df-map 8398  df-en 8499  df-dom 8500  df-sdom 8501  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-nn 11628  df-n0 11887  df-z 11971  df-uz 12233  df-fz 12883  df-mzpcl 39185  df-mzp 39186  df-dioph 39218 This theorem is referenced by:  eqrabdioph  39239  0dioph  39240  vdioph  39241  rmydioph  39476  expdioph  39485
 Copyright terms: Public domain W3C validator