Metamath Proof Explorer


Theorem fzn

Description: A finite set of sequential integers is empty if the bounds are reversed. (Contributed by NM, 22-Aug-2005)

Ref Expression
Assertion fzn ⊢ M ∈ ℤ ∧ N ∈ ℤ → N < M ↔ M … N = ∅

Proof

Step Hyp Ref Expression
1 fzn0 ⊢ M … N ≠ ∅ ↔ N ∈ ℤ ≥ M
2 eluz ⊢ M ∈ ℤ ∧ N ∈ ℤ → N ∈ ℤ ≥ M ↔ M ≤ N
3 1 2 bitrid ⊢ M ∈ ℤ ∧ N ∈ ℤ → M … N ≠ ∅ ↔ M ≤ N
4 zre ⊢ M ∈ ℤ → M ∈ ℝ
5 zre ⊢ N ∈ ℤ → N ∈ ℝ
6 lenlt ⊢ M ∈ ℝ ∧ N ∈ ℝ → M ≤ N ↔ ¬ N < M
7 4 5 6 syl2an ⊢ M ∈ ℤ ∧ N ∈ ℤ → M ≤ N ↔ ¬ N < M
8 3 7 bitr2d ⊢ M ∈ ℤ ∧ N ∈ ℤ → ¬ N < M ↔ M … N ≠ ∅
9 8 necon4bbid ⊢ M ∈ ℤ ∧ N ∈ ℤ → N < M ↔ M … N = ∅