Metamath Proof Explorer


Theorem inffz

Description: The infimum of a finite sequence of integers. (Contributed by Scott Fenton, 8-Aug-2013) (Revised by AV, 10-Oct-2021)

Ref Expression
Assertion inffz ⊢ N ∈ ℤ ≥ M → inf M … N ℤ < = M

Proof

Step Hyp Ref Expression
1 zssre ⊢ ℤ ⊆ ℝ
2 ltso ⊢ < Or ℝ
3 soss ⊢ ℤ ⊆ ℝ → < Or ℝ → < Or ℤ
4 1 2 3 mp2 ⊢ < Or ℤ
5 4 a1i ⊢ N ∈ ℤ ≥ M → < Or ℤ
6 eluzel2 ⊢ N ∈ ℤ ≥ M → M ∈ ℤ
7 eluzfz1 ⊢ N ∈ ℤ ≥ M → M ∈ M … N
8 elfzle1 ⊢ x ∈ M … N → M ≤ x
9 8 adantl ⊢ N ∈ ℤ ≥ M ∧ x ∈ M … N → M ≤ x
10 6 zred ⊢ N ∈ ℤ ≥ M → M ∈ ℝ
11 elfzelz ⊢ x ∈ M … N → x ∈ ℤ
12 11 zred ⊢ x ∈ M … N → x ∈ ℝ
13 lenlt ⊢ M ∈ ℝ ∧ x ∈ ℝ → M ≤ x ↔ ¬ x < M
14 10 12 13 syl2an ⊢ N ∈ ℤ ≥ M ∧ x ∈ M … N → M ≤ x ↔ ¬ x < M
15 9 14 mpbid ⊢ N ∈ ℤ ≥ M ∧ x ∈ M … N → ¬ x < M
16 5 6 7 15 infmin ⊢ N ∈ ℤ ≥ M → inf M … N ℤ < = M