Theorem ssfzunsnext 13523

Description: A subset of a finite sequence of integers extended by an integer is a subset of a (possibly extended) finite sequence of integers. (Contributed by AV, 13-Nov-2021.)

Assertion

Ref	Expression
ssfzunsnext	⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → (𝑆 ∪ {𝐼}) ⊆ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))

Proof of Theorem ssfzunsnext

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 482	. . 3 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → 𝑆 ⊆ (𝑀...𝑁))
2		simp3 1139	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝐼 ∈ ℤ)
3		simp1 1137	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝑀 ∈ ℤ)
4	2, 3	ifcld 4513	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ∈ ℤ)
5	4	adantr 480	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ∈ ℤ)
6		simp2 1138	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝑁 ∈ ℤ)
7	6, 2	ifcld 4513	. . . . . . . 8 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) ∈ ℤ)
8	7	adantr 480	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) ∈ ℤ)
9		elfzelz 13478	. . . . . . . 8 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ ℤ)
10	9	adantl 481	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ∈ ℤ)
11	4	zred 12633	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ∈ ℝ)
12	11	adantr 480	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ∈ ℝ)
13		zre 12528	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
14	13	3ad2ant1 1134	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝑀 ∈ ℝ)
15	14	adantr 480	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑀 ∈ ℝ)
16	9	zred 12633	. . . . . . . . 9 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ ℝ)
17	16	adantl 481	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ∈ ℝ)
18		zre 12528	. . . . . . . . . . . . 13 ⊢ (𝐼 ∈ ℤ → 𝐼 ∈ ℝ)
19	13, 18	anim12i 614	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝑀 ∈ ℝ ∧ 𝐼 ∈ ℝ))
20	19	ancomd 461	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝐼 ∈ ℝ ∧ 𝑀 ∈ ℝ))
21	20	3adant2 1132	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝐼 ∈ ℝ ∧ 𝑀 ∈ ℝ))
22	21	adantr 480	. . . . . . . . 9 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐼 ∈ ℝ ∧ 𝑀 ∈ ℝ))
23		min2 13142	. . . . . . . . 9 ⊢ ((𝐼 ∈ ℝ ∧ 𝑀 ∈ ℝ) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ≤ 𝑀)
24	22, 23	syl 17	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ≤ 𝑀)
25		elfzle1 13481	. . . . . . . . 9 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑀 ≤ 𝑘)
26	25	adantl 481	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑀 ≤ 𝑘)
27	12, 15, 17, 24, 26	letrd 11303	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ≤ 𝑘)
28		zre 12528	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ)
29	28	3ad2ant2 1135	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝑁 ∈ ℝ)
30	29	adantr 480	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑁 ∈ ℝ)
31	7	zred 12633	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) ∈ ℝ)
32	31	adantr 480	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) ∈ ℝ)
33		elfzle2 13482	. . . . . . . . 9 ⊢ (𝑘 ∈ (𝑀...𝑁) → 𝑘 ≤ 𝑁)
34	33	adantl 481	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ≤ 𝑁)
35	28, 18	anim12i 614	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝑁 ∈ ℝ ∧ 𝐼 ∈ ℝ))
36	35	3adant1 1131	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝑁 ∈ ℝ ∧ 𝐼 ∈ ℝ))
37	36	ancomd 461	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ))
38		max2 13139	. . . . . . . . . 10 ⊢ ((𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝑁 ≤ if(𝐼 ≤ 𝑁, 𝑁, 𝐼))
39	37, 38	syl 17	. . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → 𝑁 ≤ if(𝐼 ≤ 𝑁, 𝑁, 𝐼))
40	39	adantr 480	. . . . . . . 8 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑁 ≤ if(𝐼 ≤ 𝑁, 𝑁, 𝐼))
41	17, 30, 32, 34, 40	letrd 11303	. . . . . . 7 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ≤ if(𝐼 ≤ 𝑁, 𝑁, 𝐼))
42	5, 8, 10, 27, 41	elfzd 13469	. . . . . 6 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) ∧ 𝑘 ∈ (𝑀...𝑁)) → 𝑘 ∈ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))
43	42	ex 412	. . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝑘 ∈ (𝑀...𝑁) → 𝑘 ∈ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼))))
44	43	ssrdv 3927	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝑀...𝑁) ⊆ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))
45	44	adantl 481	. . 3 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → (𝑀...𝑁) ⊆ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))
46	1, 45	sstrd 3932	. 2 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → 𝑆 ⊆ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))
47	4	adantl 481	. . . 4 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ∈ ℤ)
48	7	adantl 481	. . . 4 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → if(𝐼 ≤ 𝑁, 𝑁, 𝐼) ∈ ℤ)
49	2	adantl 481	. . . 4 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → 𝐼 ∈ ℤ)
50	19	3adant2 1132	. . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ) → (𝑀 ∈ ℝ ∧ 𝐼 ∈ ℝ))
51	50	adantl 481	. . . . . 6 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → (𝑀 ∈ ℝ ∧ 𝐼 ∈ ℝ))
52	51	ancomd 461	. . . . 5 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → (𝐼 ∈ ℝ ∧ 𝑀 ∈ ℝ))
53		min1 13141	. . . . 5 ⊢ ((𝐼 ∈ ℝ ∧ 𝑀 ∈ ℝ) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ≤ 𝐼)
54	52, 53	syl 17	. . . 4 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → if(𝐼 ≤ 𝑀, 𝐼, 𝑀) ≤ 𝐼)
55	36	adantl 481	. . . . . 6 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → (𝑁 ∈ ℝ ∧ 𝐼 ∈ ℝ))
56	55	ancomd 461	. . . . 5 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → (𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ))
57		max1 13137	. . . . 5 ⊢ ((𝐼 ∈ ℝ ∧ 𝑁 ∈ ℝ) → 𝐼 ≤ if(𝐼 ≤ 𝑁, 𝑁, 𝐼))
58	56, 57	syl 17	. . . 4 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → 𝐼 ≤ if(𝐼 ≤ 𝑁, 𝑁, 𝐼))
59	47, 48, 49, 54, 58	elfzd 13469	. . 3 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → 𝐼 ∈ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))
60	59	snssd 4730	. 2 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → {𝐼} ⊆ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))
61	46, 60	unssd 4132	1 ⊢ ((𝑆 ⊆ (𝑀...𝑁) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝐼 ∈ ℤ)) → (𝑆 ∪ {𝐼}) ⊆ (if(𝐼 ≤ 𝑀, 𝐼, 𝑀)...if(𝐼 ≤ 𝑁, 𝑁, 𝐼)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   ∈ wcel 2114   ∪ cun 3887   ⊆ wss 3889  ifcif 4466  {csn 4567   class class class wbr 5085  (class class class)co 7367  ℝcr 11037   ≤ cle 11180  ℤcz 12524  ...cfz 13461

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 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-pre-lttri 11112  ax-pre-lttrn 11113

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-po 5539  df-so 5540  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-neg 11380  df-z 12525  df-uz 12789  df-fz 13462

This theorem is referenced by:  ssfzunsn  13524  setsstruct2  17144