Metamath Proof Explorer


Theorem fzss2

Description: Subset relationship for finite sets of sequential integers. (Contributed by NM, 4-Oct-2005) (Revised by Mario Carneiro, 30-Apr-2015)

Ref Expression
Assertion fzss2 ⊢ N ∈ ℤ ≥ K → M … K ⊆ M … N

Proof

Step Hyp Ref Expression
1 elfzuz ⊢ k ∈ M … K → k ∈ ℤ ≥ M
2 1 adantl ⊢ N ∈ ℤ ≥ K ∧ k ∈ M … K → k ∈ ℤ ≥ M
3 elfzuz3 ⊢ k ∈ M … K → K ∈ ℤ ≥ k
4 uztrn ⊢ N ∈ ℤ ≥ K ∧ K ∈ ℤ ≥ k → N ∈ ℤ ≥ k
5 3 4 sylan2 ⊢ N ∈ ℤ ≥ K ∧ k ∈ M … K → N ∈ ℤ ≥ k
6 elfzuzb ⊢ k ∈ M … N ↔ k ∈ ℤ ≥ M ∧ N ∈ ℤ ≥ k
7 2 5 6 sylanbrc ⊢ N ∈ ℤ ≥ K ∧ k ∈ M … K → k ∈ M … N
8 7 ex ⊢ N ∈ ℤ ≥ K → k ∈ M … K → k ∈ M … N
9 8 ssrdv ⊢ N ∈ ℤ ≥ K → M … K ⊆ M … N