Metamath Proof Explorer

Theorem elfzonlteqm1

Description: If an element of a half-open integer range is not less than the upper bound of the range decreased by 1, it must be equal to the upper bound of the range decreased by 1. (Contributed by AV, 3-Nov-2018)

Ref Expression
Assertion elfzonlteqm1 ⊢ A ∈ 0 ..^ B ∧ ¬ A < B − 1 → A = B − 1

Proof

Step Hyp Ref Expression
1 0z ⊢ 0 ∈ ℤ
2 elfzo0 ⊢ A ∈ 0 ..^ B ↔ A ∈ ℕ 0 ∧ B ∈ ℕ ∧ A < B
3 elnnuz ⊢ B ∈ ℕ ↔ B ∈ ℤ ≥ 1
4 3 biimpi ⊢ B ∈ ℕ → B ∈ ℤ ≥ 1
5 0p1e1 ⊢ 0 + 1 = 1
6 5 a1i ⊢ B ∈ ℕ → 0 + 1 = 1
7 6 fveq2d ⊢ B ∈ ℕ → ℤ ≥ 0 + 1 = ℤ ≥ 1
8 4 7 eleqtrrd ⊢ B ∈ ℕ → B ∈ ℤ ≥ 0 + 1
9 8 3ad2ant2 ⊢ A ∈ ℕ 0 ∧ B ∈ ℕ ∧ A < B → B ∈ ℤ ≥ 0 + 1
10 2 9 sylbi ⊢ A ∈ 0 ..^ B → B ∈ ℤ ≥ 0 + 1
11 fzosplitsnm1 ⊢ 0 ∈ ℤ ∧ B ∈ ℤ ≥ 0 + 1 → 0 ..^ B = 0 ..^ B − 1 ∪ B − 1
12 1 10 11 sylancr ⊢ A ∈ 0 ..^ B → 0 ..^ B = 0 ..^ B − 1 ∪ B − 1
13 eleq2 ⊢ 0 ..^ B = 0 ..^ B − 1 ∪ B − 1 → A ∈ 0 ..^ B ↔ A ∈ 0 ..^ B − 1 ∪ B − 1
14 elun ⊢ A ∈ 0 ..^ B − 1 ∪ B − 1 ↔ A ∈ 0 ..^ B − 1 ∨ A ∈ B − 1
15 elfzo0 ⊢ A ∈ 0 ..^ B − 1 ↔ A ∈ ℕ 0 ∧ B − 1 ∈ ℕ ∧ A < B − 1
16 pm2.24 ⊢ A < B − 1 → ¬ A < B − 1 → A = B − 1
17 16 3ad2ant3 ⊢ A ∈ ℕ 0 ∧ B − 1 ∈ ℕ ∧ A < B − 1 → ¬ A < B − 1 → A = B − 1
18 15 17 sylbi ⊢ A ∈ 0 ..^ B − 1 → ¬ A < B − 1 → A = B − 1
19 elsni ⊢ A ∈ B − 1 → A = B − 1
20 19 a1d ⊢ A ∈ B − 1 → ¬ A < B − 1 → A = B − 1
21 18 20 jaoi ⊢ A ∈ 0 ..^ B − 1 ∨ A ∈ B − 1 → ¬ A < B − 1 → A = B − 1
22 14 21 sylbi ⊢ A ∈ 0 ..^ B − 1 ∪ B − 1 → ¬ A < B − 1 → A = B − 1
23 13 22 syl6bi ⊢ 0 ..^ B = 0 ..^ B − 1 ∪ B − 1 → A ∈ 0 ..^ B → ¬ A < B − 1 → A = B − 1
24 12 23 mpcom ⊢ A ∈ 0 ..^ B → ¬ A < B − 1 → A = B − 1
25 24 imp ⊢ A ∈ 0 ..^ B ∧ ¬ A < B − 1 → A = B − 1