Theorem rabdiophlem2 43163

Description: Lemma for arithmetic diophantine sets. Reuse a polynomial expression under a new quantifier. (Contributed by Stefan O'Rear, 10-Oct-2014.)

Hypothesis

Ref	Expression
rabdiophlem2.1	⊢ 𝑀 = (𝑁 + 1)

Assertion

Ref	Expression
rabdiophlem2	⊢ ((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑀)) ↦ ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴) ∈ (mzPoly‘(1...𝑀)))

Distinct variable groups:   𝑢,𝑁,𝑡   𝑢,𝑀,𝑡   𝑡,𝐴

Allowed substitution hint:   𝐴(𝑢)

Proof of Theorem rabdiophlem2

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑎𝐴
2		nfcsb1v 3875	. . . . . 6 ⊢ Ⅎ𝑢⦋𝑎 / 𝑢⦌𝐴
3		csbeq1a 3865	. . . . . 6 ⊢ (𝑢 = 𝑎 → 𝐴 = ⦋𝑎 / 𝑢⦌𝐴)
4	1, 2, 3	cbvmpt 5202	. . . . 5 ⊢ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) = (𝑎 ∈ (ℤ ↑m (1...𝑁)) ↦ ⦋𝑎 / 𝑢⦌𝐴)
5	4	fveq1i 6843	. . . 4 ⊢ ((𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘(𝑡 ↾ (1...𝑁))) = ((𝑎 ∈ (ℤ ↑m (1...𝑁)) ↦ ⦋𝑎 / 𝑢⦌𝐴)‘(𝑡 ↾ (1...𝑁)))
6		eqid 2737	. . . . 5 ⊢ (𝑎 ∈ (ℤ ↑m (1...𝑁)) ↦ ⦋𝑎 / 𝑢⦌𝐴) = (𝑎 ∈ (ℤ ↑m (1...𝑁)) ↦ ⦋𝑎 / 𝑢⦌𝐴)
7		csbeq1 3854	. . . . 5 ⊢ (𝑎 = (𝑡 ↾ (1...𝑁)) → ⦋𝑎 / 𝑢⦌𝐴 = ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴)
8		rabdiophlem2.1	. . . . . . 7 ⊢ 𝑀 = (𝑁 + 1)
9	8	mapfzcons1cl 43079	. . . . . 6 ⊢ (𝑡 ∈ (ℤ ↑m (1...𝑀)) → (𝑡 ↾ (1...𝑁)) ∈ (ℤ ↑m (1...𝑁)))
10	9	adantl 481	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℤ ↑m (1...𝑀))) → (𝑡 ↾ (1...𝑁)) ∈ (ℤ ↑m (1...𝑁)))
11		mzpf 43097	. . . . . . . 8 ⊢ ((𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) → (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ)
12		eqid 2737	. . . . . . . . 9 ⊢ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) = (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)
13	12	fmpt 7064	. . . . . . . 8 ⊢ (∀𝑢 ∈ (ℤ ↑m (1...𝑁))𝐴 ∈ ℤ ↔ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴):(ℤ ↑m (1...𝑁))⟶ℤ)
14	11, 13	sylibr 234	. . . . . . 7 ⊢ ((𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)) → ∀𝑢 ∈ (ℤ ↑m (1...𝑁))𝐴 ∈ ℤ)
15	14	ad2antlr 728	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℤ ↑m (1...𝑀))) → ∀𝑢 ∈ (ℤ ↑m (1...𝑁))𝐴 ∈ ℤ)
16		nfcsb1v 3875	. . . . . . . 8 ⊢ Ⅎ𝑢⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴
17	16	nfel1 2916	. . . . . . 7 ⊢ Ⅎ𝑢⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴 ∈ ℤ
18		csbeq1a 3865	. . . . . . . 8 ⊢ (𝑢 = (𝑡 ↾ (1...𝑁)) → 𝐴 = ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴)
19	18	eleq1d 2822	. . . . . . 7 ⊢ (𝑢 = (𝑡 ↾ (1...𝑁)) → (𝐴 ∈ ℤ ↔ ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴 ∈ ℤ))
20	17, 19	rspc 3566	. . . . . 6 ⊢ ((𝑡 ↾ (1...𝑁)) ∈ (ℤ ↑m (1...𝑁)) → (∀𝑢 ∈ (ℤ ↑m (1...𝑁))𝐴 ∈ ℤ → ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴 ∈ ℤ))
21	10, 15, 20	sylc 65	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℤ ↑m (1...𝑀))) → ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴 ∈ ℤ)
22	6, 7, 10, 21	fvmptd3 6973	. . . 4 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℤ ↑m (1...𝑀))) → ((𝑎 ∈ (ℤ ↑m (1...𝑁)) ↦ ⦋𝑎 / 𝑢⦌𝐴)‘(𝑡 ↾ (1...𝑁))) = ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴)
23	5, 22	eqtr2id 2785	. . 3 ⊢ (((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) ∧ 𝑡 ∈ (ℤ ↑m (1...𝑀))) → ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴 = ((𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘(𝑡 ↾ (1...𝑁))))
24	23	mpteq2dva 5193	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑀)) ↦ ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴) = (𝑡 ∈ (ℤ ↑m (1...𝑀)) ↦ ((𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘(𝑡 ↾ (1...𝑁)))))
25		ovexd 7403	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (1...𝑀) ∈ V)
26		fzssp1 13495	. . . . 5 ⊢ (1...𝑁) ⊆ (1...(𝑁 + 1))
27	8	oveq2i 7379	. . . . 5 ⊢ (1...𝑀) = (1...(𝑁 + 1))
28	26, 27	sseqtrri 3985	. . . 4 ⊢ (1...𝑁) ⊆ (1...𝑀)
29	28	a1i 11	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (1...𝑁) ⊆ (1...𝑀))
30		simpr 484	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁)))
31		mzpresrename 43111	. . 3 ⊢ (((1...𝑀) ∈ V ∧ (1...𝑁) ⊆ (1...𝑀) ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑀)) ↦ ((𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘(𝑡 ↾ (1...𝑁)))) ∈ (mzPoly‘(1...𝑀)))
32	25, 29, 30, 31	syl3anc 1374	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑀)) ↦ ((𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴)‘(𝑡 ↾ (1...𝑁)))) ∈ (mzPoly‘(1...𝑀)))
33	24, 32	eqeltrd 2837	1 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑢 ∈ (ℤ ↑m (1...𝑁)) ↦ 𝐴) ∈ (mzPoly‘(1...𝑁))) → (𝑡 ∈ (ℤ ↑m (1...𝑀)) ↦ ⦋(𝑡 ↾ (1...𝑁)) / 𝑢⦌𝐴) ∈ (mzPoly‘(1...𝑀)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  Vcvv 3442  ⦋csb 3851   ⊆ wss 3903   ↦ cmpt 5181   ↾ cres 5634  ⟶wf 6496  ‘cfv 6500  (class class class)co 7368   ↑_m cmap 8775  1c1 11039   + caddc 11041  ℕ₀cn0 12413  ℤcz 12500  ...cfz 13435  mzPolycmzp 43083

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 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-of 7632  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-n0 12414  df-z 12501  df-uz 12764  df-fz 13436  df-mzpcl 43084  df-mzp 43085

This theorem is referenced by:  elnn0rabdioph  43164  dvdsrabdioph  43171