Theorem 2rexfrabdioph 43242

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 43230	. . . 4 ⊢ ([(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑 ↔ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑)
2	1	rabbii 3395	. . 3 ⊢ {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} = {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑}
3		rexfrabdioph.1	. . . . . 6 ⊢ 𝑀 = (𝑁 + 1)
4		peano2nn0 12468	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
5	3, 4	eqeltrid 2841	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ0)
6	5	adantr 480	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → 𝑀 ∈ ℕ0)
7		sbcrot3 43237	. . . . . . . . 9 ⊢ ([(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
8	7	sbcbii 3786	. . . . . . . 8 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
9		reseq1 5932	. . . . . . . . . 10 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎 ↾ (1...𝑁)) = ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)))
10	9	sbccomieg 43239	. . . . . . . . 9 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
11		fzssp1 13512	. . . . . . . . . . . 12 ⊢ (1...𝑁) ⊆ (1...(𝑁 + 1))
12	3	oveq2i 7371	. . . . . . . . . . . 12 ⊢ (1...𝑀) = (1...(𝑁 + 1))
13	11, 12	sseqtrri 3972	. . . . . . . . . . 11 ⊢ (1...𝑁) ⊆ (1...𝑀)
14		resabs1 5965	. . . . . . . . . . 11 ⊢ ((1...𝑁) ⊆ (1...𝑀) → ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)))
15		dfsbcq 3731	. . . . . . . . . . 11 ⊢ (((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)) → ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
16	13, 14, 15	mp2b 10	. . . . . . . . . 10 ⊢ ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
17		vex 3434	. . . . . . . . . . . . . 14 ⊢ 𝑡 ∈ V
18	17	resex 5988	. . . . . . . . . . . . 13 ⊢ (𝑡 ↾ (1...𝑀)) ∈ V
19		fveq1 6833	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎‘𝑀) = ((𝑡 ↾ (1...𝑀))‘𝑀))
20	19	sbcco3gw 4366	. . . . . . . . . . . . 13 ⊢ ((𝑡 ↾ (1...𝑀)) ∈ V → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
21	18, 20	ax-mp 5	. . . . . . . . . . . 12 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
22		nn0p1nn 12467	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
23	3, 22	eqeltrid 2841	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ)
24		elfz1end 13499	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (1...𝑀))
25	23, 24	sylib 218	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ (1...𝑀))
26		fvres 6853	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (1...𝑀) → ((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀))
27		dfsbcq 3731	. . . . . . . . . . . . 13 ⊢ (((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀) → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
28	25, 26, 27	3syl 18	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
29	21, 28	bitrid 283	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
30	29	sbcbidv 3785	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
31	16, 30	bitrid 283	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
32	10, 31	bitrid 283	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
33	8, 32	bitr2id 284	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑))
34	33	rabbidv 3397	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} = {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑})
35	34	eleq1d 2822	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → ({𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿) ↔ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿)))
36	35	biimpa 476	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿))
37		rexfrabdioph.2	. . . . 5 ⊢ 𝐿 = (𝑀 + 1)
38	37	rexfrabdioph 43241	. . . 4 ⊢ ((𝑀 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿)) → {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝑀))
39	6, 36, 38	syl2anc 585	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝑀))
40	2, 39	eqeltrid 2841	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑀))
41	3	rexfrabdioph 43241	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑀)) → {𝑢 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑣 ∈ ℕ0 ∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑁))
42	40, 41	syldan 592	1 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑢 ∈ (ℕ0 ↑m (1...𝑁)) ∣ ∃𝑣 ∈ ℕ0 ∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑁))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∃wrex 3062  {crab 3390  Vcvv 3430  [wsbc 3729   ⊆ wss 3890   ↾ cres 5626  ‘cfv 6492  (class class class)co 7360   ↑_m cmap 8766  1c1 11030   + caddc 11032  ℕcn 12165  ℕ₀cn0 12428  ...cfz 13452  Diophcdioph 43201

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 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-inf2 9553  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

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 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-oadd 8402  df-er 8636  df-map 8768  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-dju 9816  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-n0 12429  df-z 12516  df-uz 12780  df-fz 13453  df-hash 14284  df-mzpcl 43169  df-mzp 43170  df-dioph 43202

This theorem is referenced by:  3rexfrabdioph  43243  4rexfrabdioph  43244  6rexfrabdioph  43245