Theorem 2rexfrabdioph 40813

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 40801	. . . 4 ⊢ ([(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑 ↔ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑)
2	1	rabbii 3415	. . 3 ⊢ {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} = {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑}
3		rexfrabdioph.1	. . . . . 6 ⊢ 𝑀 = (𝑁 + 1)
4		peano2nn0 12323	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
5	3, 4	eqeltrid 2841	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ0)
6	5	adantr 482	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → 𝑀 ∈ ℕ0)
7		sbcrot3 40808	. . . . . . . . 9 ⊢ ([(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
8	7	sbcbii 3781	. . . . . . . 8 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
9		reseq1 5897	. . . . . . . . . 10 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎 ↾ (1...𝑁)) = ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)))
10	9	sbccomieg 40810	. . . . . . . . 9 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
11		fzssp1 13349	. . . . . . . . . . . 12 ⊢ (1...𝑁) ⊆ (1...(𝑁 + 1))
12	3	oveq2i 7318	. . . . . . . . . . . 12 ⊢ (1...𝑀) = (1...(𝑁 + 1))
13	11, 12	sseqtrri 3963	. . . . . . . . . . 11 ⊢ (1...𝑁) ⊆ (1...𝑀)
14		resabs1 5933	. . . . . . . . . . 11 ⊢ ((1...𝑁) ⊆ (1...𝑀) → ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)))
15		dfsbcq 3723	. . . . . . . . . . 11 ⊢ (((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)) → ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
16	13, 14, 15	mp2b 10	. . . . . . . . . 10 ⊢ ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
17		vex 3441	. . . . . . . . . . . . . 14 ⊢ 𝑡 ∈ V
18	17	resex 5951	. . . . . . . . . . . . 13 ⊢ (𝑡 ↾ (1...𝑀)) ∈ V
19		fveq1 6803	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎‘𝑀) = ((𝑡 ↾ (1...𝑀))‘𝑀))
20	19	sbcco3gw 4362	. . . . . . . . . . . . 13 ⊢ ((𝑡 ↾ (1...𝑀)) ∈ V → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
21	18, 20	ax-mp 5	. . . . . . . . . . . 12 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
22		nn0p1nn 12322	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
23	3, 22	eqeltrid 2841	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ)
24		elfz1end 13336	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (1...𝑀))
25	23, 24	sylib 217	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ (1...𝑀))
26		fvres 6823	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (1...𝑀) → ((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀))
27		dfsbcq 3723	. . . . . . . . . . . . 13 ⊢ (((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀) → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
28	25, 26, 27	3syl 18	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
29	21, 28	bitrid 283	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
30	29	sbcbidv 3780	. . . . . . . . . 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 3421	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} = {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑})
35	34	eleq1d 2821	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → ({𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿) ↔ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿)))
36	35	biimpa 478	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑} ∈ (Dioph‘𝐿))
37		rexfrabdioph.2	. . . . 5 ⊢ 𝐿 = (𝑀 + 1)
38	37	rexfrabdioph 40812	. . . 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 40812	. 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 205   ∧ wa 397   = wceq 1539   ∈ wcel 2104  ∃wrex 3071  {crab 3303  Vcvv 3437  [wsbc 3721   ⊆ wss 3892   ↾ cres 5602  ‘cfv 6458  (class class class)co 7307   ↑_m cmap 8646  1c1 10922   + caddc 10924  ℕcn 12023  ℕ₀cn0 12283  ...cfz 13289  Diophcdioph 40772

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-rep 5218  ax-sep 5232  ax-nul 5239  ax-pow 5297  ax-pr 5361  ax-un 7620  ax-inf2 9447  ax-cnex 10977  ax-resscn 10978  ax-1cn 10979  ax-icn 10980  ax-addcl 10981  ax-addrcl 10982  ax-mulcl 10983  ax-mulrcl 10984  ax-mulcom 10985  ax-addass 10986  ax-mulass 10987  ax-distr 10988  ax-i2m1 10989  ax-1ne0 10990  ax-1rid 10991  ax-rnegex 10992  ax-rrecex 10993  ax-cnre 10994  ax-pre-lttri 10995  ax-pre-lttrn 10996  ax-pre-ltadd 10997  ax-pre-mulgt0 10998

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3or 1088  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-reu 3305  df-rab 3306  df-v 3439  df-sbc 3722  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-pss 3911  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-int 4887  df-iun 4933  df-br 5082  df-opab 5144  df-mpt 5165  df-tr 5199  df-id 5500  df-eprel 5506  df-po 5514  df-so 5515  df-fr 5555  df-we 5557  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-pred 6217  df-ord 6284  df-on 6285  df-lim 6286  df-suc 6287  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-f1 6463  df-fo 6464  df-f1o 6465  df-fv 6466  df-riota 7264  df-ov 7310  df-oprab 7311  df-mpo 7312  df-of 7565  df-om 7745  df-1st 7863  df-2nd 7864  df-frecs 8128  df-wrecs 8159  df-recs 8233  df-rdg 8272  df-1o 8328  df-oadd 8332  df-er 8529  df-map 8648  df-en 8765  df-dom 8766  df-sdom 8767  df-fin 8768  df-dju 9707  df-card 9745  df-pnf 11061  df-mnf 11062  df-xr 11063  df-ltxr 11064  df-le 11065  df-sub 11257  df-neg 11258  df-nn 12024  df-n0 12284  df-z 12370  df-uz 12633  df-fz 13290  df-hash 14095  df-mzpcl 40740  df-mzp 40741  df-dioph 40773

This theorem is referenced by:  3rexfrabdioph  40814  4rexfrabdioph  40815  6rexfrabdioph  40816