Theorem 2rexfrabdioph 41519

Description: Diophantine set builder for existential quantifier, explicit substitution, two variables. (Contributed by Stefan O'Rear, 11-Oct-2014.) (Revised by Stefan O'Rear, 6-May-2015.)

Hypotheses

Ref	Expression
rexfrabdioph.1	⊢ 𝑀 = (𝑁 + 1)
rexfrabdioph.2	⊢ 𝐿 = (𝑀 + 1)

Assertion

Ref	Expression
2rexfrabdioph	⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑢 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑣 ∈ ℕ0 ∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑁))

Distinct variable groups:   𝑢,𝑡,𝑣,𝑤,𝐿   𝑡,𝑀,𝑢,𝑣,𝑤   𝑡,𝑁,𝑢,𝑣,𝑤   𝜑,𝑡

Allowed substitution hints:   𝜑(𝑤,𝑣,𝑢)

Proof of Theorem 2rexfrabdioph

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2sbcrex 41507	. . . 4 ⊢ ([(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑 ↔ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑)
2	1	rabbii 3438	. . 3 ⊢ {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} = {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑}
3		rexfrabdioph.1	. . . . . 6 ⊢ 𝑀 = (𝑁 + 1)
4		peano2nn0 12508	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
5	3, 4	eqeltrid 2837	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ0)
6	5	adantr 481	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → 𝑀 ∈ ℕ0)
7		sbcrot3 41514	. . . . . . . . 9 ⊢ ([(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
8	7	sbcbii 3836	. . . . . . . 8 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
9		reseq1 5973	. . . . . . . . . 10 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎 ↾ (1...𝑁)) = ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)))
10	9	sbccomieg 41516	. . . . . . . . 9 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
11		fzssp1 13540	. . . . . . . . . . . 12 ⊢ (1...𝑁) ⊆ (1...(𝑁 + 1))
12	3	oveq2i 7416	. . . . . . . . . . . 12 ⊢ (1...𝑀) = (1...(𝑁 + 1))
13	11, 12	sseqtrri 4018	. . . . . . . . . . 11 ⊢ (1...𝑁) ⊆ (1...𝑀)
14		resabs1 6009	. . . . . . . . . . 11 ⊢ ((1...𝑁) ⊆ (1...𝑀) → ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)))
15		dfsbcq 3778	. . . . . . . . . . 11 ⊢ (((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)) → ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
16	13, 14, 15	mp2b 10	. . . . . . . . . 10 ⊢ ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
17		vex 3478	. . . . . . . . . . . . . 14 ⊢ 𝑡 ∈ V
18	17	resex 6027	. . . . . . . . . . . . 13 ⊢ (𝑡 ↾ (1...𝑀)) ∈ V
19		fveq1 6887	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎‘𝑀) = ((𝑡 ↾ (1...𝑀))‘𝑀))
20	19	sbcco3gw 4421	. . . . . . . . . . . . 13 ⊢ ((𝑡 ↾ (1...𝑀)) ∈ V → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
21	18, 20	ax-mp 5	. . . . . . . . . . . 12 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
22		nn0p1nn 12507	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
23	3, 22	eqeltrid 2837	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ)
24		elfz1end 13527	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (1...𝑀))
25	23, 24	sylib 217	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ (1...𝑀))
26		fvres 6907	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (1...𝑀) → ((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀))
27		dfsbcq 3778	. . . . . . . . . . . . 13 ⊢ (((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀) → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
28	25, 26, 27	3syl 18	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
29	21, 28	bitrid 282	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
30	29	sbcbidv 3835	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
31	16, 30	bitrid 282	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
32	10, 31	bitrid 282	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
33	8, 32	bitr2id 283	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑))
34	33	rabbidv 3440	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} = {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑})
35	34	eleq1d 2818	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → ({𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿) ↔ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿)))
36	35	biimpa 477	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿))
37		rexfrabdioph.2	. . . . 5 ⊢ 𝐿 = (𝑀 + 1)
38	37	rexfrabdioph 41518	. . . 4 ⊢ ((𝑀 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿)) → {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝑀))
39	6, 36, 38	syl2anc 584	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝑀))
40	2, 39	eqeltrid 2837	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑀))
41	3	rexfrabdioph 41518	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑀)) → {𝑢 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑣 ∈ ℕ0 ∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑁))
42	40, 41	syldan 591	1 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑢 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑣 ∈ ℕ0 ∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑁))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∃wrex 3070  {crab 3432  Vcvv 3474  [wsbc 3776   ⊆ wss 3947   ↾ cres 5677  ‘cfv 6540  (class class class)co 7405   ↑_m cmap 8816  1c1 11107   + caddc 11109  ℕcn 12208  ℕ₀cn0 12468  ...cfz 13480  Diophcdioph 41478

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  ax-inf2 9632  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-of 7666  df-om 7852  df-1st 7971  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-1o 8462  df-oadd 8466  df-er 8699  df-map 8818  df-en 8936  df-dom 8937  df-sdom 8938  df-fin 8939  df-dju 9892  df-card 9930  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-nn 12209  df-n0 12469  df-z 12555  df-uz 12819  df-fz 13481  df-hash 14287  df-mzpcl 41446  df-mzp 41447  df-dioph 41479

This theorem is referenced by:  3rexfrabdioph  41520  4rexfrabdioph  41521  6rexfrabdioph  41522