Metamath Proof Explorer


Theorem elfzle2

Description: A member of a finite set of sequential integer is less than or equal to the upper bound. (Contributed by NM, 6-Sep-2005) (Revised by Mario Carneiro, 28-Apr-2015)

Ref Expression
Assertion elfzle2 ( 𝐾 ∈ ( 𝑀 ... 𝑁 ) → 𝐾 ≤ 𝑁 )

Proof

Step Hyp Ref Expression
1 elfzuz3 ⊢ ( 𝐾 ∈ ( 𝑀 ... 𝑁 ) → 𝑁 ∈ ( ℤ≥ ‘ 𝐾 ) )
2 eluzle ⊢ ( 𝑁 ∈ ( ℤ≥ ‘ 𝐾 ) → 𝐾 ≤ 𝑁 )
3 1 2 syl ⊢ ( 𝐾 ∈ ( 𝑀 ... 𝑁 ) → 𝐾 ≤ 𝑁 )