Metamath Proof Explorer


Theorem fzss1

Description: Subset relationship for finite sets of sequential integers. (Contributed by NM, 28-Sep-2005) (Proof shortened by Mario Carneiro, 28-Apr-2015)

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

Proof

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