Theorem 2rexfrabdioph 42784

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 42772	. . . 4 ⊢ ([(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑 ↔ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑)
2	1	rabbii 3411	. . 3 ⊢ {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} = {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ ∃𝑤 ∈ ℕ0 [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑}
3		rexfrabdioph.1	. . . . . 6 ⊢ 𝑀 = (𝑁 + 1)
4		peano2nn0 12482	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
5	3, 4	eqeltrid 2832	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ0)
6	5	adantr 480	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → 𝑀 ∈ ℕ0)
7		sbcrot3 42779	. . . . . . . . 9 ⊢ ([(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
8	7	sbcbii 3810	. . . . . . . 8 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑 ↔ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
9		reseq1 5944	. . . . . . . . . 10 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎 ↾ (1...𝑁)) = ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)))
10	9	sbccomieg 42781	. . . . . . . . 9 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
11		fzssp1 13528	. . . . . . . . . . . 12 ⊢ (1...𝑁) ⊆ (1...(𝑁 + 1))
12	3	oveq2i 7398	. . . . . . . . . . . 12 ⊢ (1...𝑀) = (1...(𝑁 + 1))
13	11, 12	sseqtrri 3996	. . . . . . . . . . 11 ⊢ (1...𝑁) ⊆ (1...𝑀)
14		resabs1 5977	. . . . . . . . . . 11 ⊢ ((1...𝑁) ⊆ (1...𝑀) → ((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)))
15		dfsbcq 3755	. . . . . . . . . . 11 ⊢ (((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) = (𝑡 ↾ (1...𝑁)) → ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
16	13, 14, 15	mp2b 10	. . . . . . . . . 10 ⊢ ([((𝑡 ↾ (1...𝑀)) ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
17		vex 3451	. . . . . . . . . . . . . 14 ⊢ 𝑡 ∈ V
18	17	resex 6000	. . . . . . . . . . . . 13 ⊢ (𝑡 ↾ (1...𝑀)) ∈ V
19		fveq1 6857	. . . . . . . . . . . . . 14 ⊢ (𝑎 = (𝑡 ↾ (1...𝑀)) → (𝑎‘𝑀) = ((𝑡 ↾ (1...𝑀))‘𝑀))
20	19	sbcco3gw 4388	. . . . . . . . . . . . 13 ⊢ ((𝑡 ↾ (1...𝑀)) ∈ V → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
21	18, 20	ax-mp 5	. . . . . . . . . . . 12 ⊢ ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑)
22		nn0p1nn 12481	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
23	3, 22	eqeltrid 2832	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ ℕ)
24		elfz1end 13515	. . . . . . . . . . . . . 14 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (1...𝑀))
25	23, 24	sylib 218	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ0 → 𝑀 ∈ (1...𝑀))
26		fvres 6877	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (1...𝑀) → ((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀))
27		dfsbcq 3755	. . . . . . . . . . . . 13 ⊢ (((𝑡 ↾ (1...𝑀))‘𝑀) = (𝑡‘𝑀) → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
28	25, 26, 27	3syl 18	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → ([((𝑡 ↾ (1...𝑀))‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
29	21, 28	bitrid 283	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ0 → ([(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑎‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑 ↔ [(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑))
30	29	sbcbidv 3809	. . . . . . . . . 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 3413	. . . . . 6 ⊢ (𝑁 ∈ ℕ0 → {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} = {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑀)) / 𝑎][(𝑡‘𝐿) / 𝑤][(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]𝜑})
35	34	eleq1d 2813	. . . . 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 42783	. . . 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 2832	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ {𝑡 ∈ (ℕ0 ↑m (1...𝐿)) ∣ [(𝑡 ↾ (1...𝑁)) / 𝑢][(𝑡‘𝑀) / 𝑣][(𝑡‘𝐿) / 𝑤]𝜑} ∈ (Dioph‘𝐿)) → {𝑎 ∈ (ℕ0 ↑m (1...𝑀)) ∣ [(𝑎 ↾ (1...𝑁)) / 𝑢][(𝑎‘𝑀) / 𝑣]∃𝑤 ∈ ℕ0 𝜑} ∈ (Dioph‘𝑀))
41	3	rexfrabdioph 42783	. 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 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃wrex 3053  {crab 3405  Vcvv 3447  [wsbc 3753   ⊆ wss 3914   ↾ cres 5640  ‘cfv 6511  (class class class)co 7387   ↑_m cmap 8799  1c1 11069   + caddc 11071  ℕcn 12186  ℕ₀cn0 12442  ...cfz 13468  Diophcdioph 42743

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-inf2 9594  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-of 7653  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-oadd 8438  df-er 8671  df-map 8801  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-dju 9854  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-n0 12443  df-z 12530  df-uz 12794  df-fz 13469  df-hash 14296  df-mzpcl 42711  df-mzp 42712  df-dioph 42744

This theorem is referenced by:  3rexfrabdioph  42785  4rexfrabdioph  42786  6rexfrabdioph  42787