Metamath Proof Explorer


Theorem ssfzunsnext

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)

Ref Expression
Assertion ssfzunsnext ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → S ∪ I ⊆ if I ≤ M I M … if I ≤ N N I

Proof

Step Hyp Ref Expression
1 simpl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → S ⊆ M … N
2 simp3 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ∈ ℤ
3 simp1 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → M ∈ ℤ
4 2 3 ifcld ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → if I ≤ M I M ∈ ℤ
5 4 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → if I ≤ M I M ∈ ℤ
6 simp2 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → N ∈ ℤ
7 6 2 ifcld ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → if I ≤ N N I ∈ ℤ
8 7 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → if I ≤ N N I ∈ ℤ
9 elfzelz ⊢ k ∈ M … N → k ∈ ℤ
10 9 adantl ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → k ∈ ℤ
11 4 zred ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → if I ≤ M I M ∈ ℝ
12 11 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → if I ≤ M I M ∈ ℝ
13 zre ⊢ M ∈ ℤ → M ∈ ℝ
14 13 3ad2ant1 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → M ∈ ℝ
15 14 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → M ∈ ℝ
16 9 zred ⊢ k ∈ M … N → k ∈ ℝ
17 16 adantl ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → k ∈ ℝ
18 zre ⊢ I ∈ ℤ → I ∈ ℝ
19 13 18 anim12i ⊢ M ∈ ℤ ∧ I ∈ ℤ → M ∈ ℝ ∧ I ∈ ℝ
20 19 ancomd ⊢ M ∈ ℤ ∧ I ∈ ℤ → I ∈ ℝ ∧ M ∈ ℝ
21 20 3adant2 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ∈ ℝ ∧ M ∈ ℝ
22 21 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → I ∈ ℝ ∧ M ∈ ℝ
23 min2 ⊢ I ∈ ℝ ∧ M ∈ ℝ → if I ≤ M I M ≤ M
24 22 23 syl ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → if I ≤ M I M ≤ M
25 elfzle1 ⊢ k ∈ M … N → M ≤ k
26 25 adantl ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → M ≤ k
27 12 15 17 24 26 letrd ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → if I ≤ M I M ≤ k
28 zre ⊢ N ∈ ℤ → N ∈ ℝ
29 28 3ad2ant2 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → N ∈ ℝ
30 29 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → N ∈ ℝ
31 7 zred ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → if I ≤ N N I ∈ ℝ
32 31 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → if I ≤ N N I ∈ ℝ
33 elfzle2 ⊢ k ∈ M … N → k ≤ N
34 33 adantl ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → k ≤ N
35 28 18 anim12i ⊢ N ∈ ℤ ∧ I ∈ ℤ → N ∈ ℝ ∧ I ∈ ℝ
36 35 3adant1 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → N ∈ ℝ ∧ I ∈ ℝ
37 36 ancomd ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ∈ ℝ ∧ N ∈ ℝ
38 max2 ⊢ I ∈ ℝ ∧ N ∈ ℝ → N ≤ if I ≤ N N I
39 37 38 syl ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → N ≤ if I ≤ N N I
40 39 adantr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → N ≤ if I ≤ N N I
41 17 30 32 34 40 letrd ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → k ≤ if I ≤ N N I
42 5 8 10 27 41 elfzd ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ ∧ k ∈ M … N → k ∈ if I ≤ M I M … if I ≤ N N I
43 42 ex ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → k ∈ M … N → k ∈ if I ≤ M I M … if I ≤ N N I
44 43 ssrdv ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → M … N ⊆ if I ≤ M I M … if I ≤ N N I
45 44 adantl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → M … N ⊆ if I ≤ M I M … if I ≤ N N I
46 1 45 sstrd ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → S ⊆ if I ≤ M I M … if I ≤ N N I
47 4 adantl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → if I ≤ M I M ∈ ℤ
48 7 adantl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → if I ≤ N N I ∈ ℤ
49 2 adantl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ∈ ℤ
50 19 3adant2 ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → M ∈ ℝ ∧ I ∈ ℝ
51 50 adantl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → M ∈ ℝ ∧ I ∈ ℝ
52 51 ancomd ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ∈ ℝ ∧ M ∈ ℝ
53 min1 ⊢ I ∈ ℝ ∧ M ∈ ℝ → if I ≤ M I M ≤ I
54 52 53 syl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → if I ≤ M I M ≤ I
55 36 adantl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → N ∈ ℝ ∧ I ∈ ℝ
56 55 ancomd ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ∈ ℝ ∧ N ∈ ℝ
57 max1 ⊢ I ∈ ℝ ∧ N ∈ ℝ → I ≤ if I ≤ N N I
58 56 57 syl ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ≤ if I ≤ N N I
59 47 48 49 54 58 elfzd ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ∈ if I ≤ M I M … if I ≤ N N I
60 59 snssd ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → I ⊆ if I ≤ M I M … if I ≤ N N I
61 46 60 unssd ⊢ S ⊆ M … N ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ I ∈ ℤ → S ∪ I ⊆ if I ≤ M I M … if I ≤ N N I