Metamath Proof Explorer


Theorem climuzcnv

Description: Utility lemma to convert between m <_ k and k e. ( ZZ>=m ) in limit theorems. (Contributed by Paul Chapman, 10-Nov-2012)

Ref Expression
Assertion climuzcnv ⊢ m ∈ ℕ → k ∈ ℤ ≥ m → φ ↔ k ∈ ℕ → m ≤ k → φ

Proof

Step Hyp Ref Expression
1 elnnuz ⊢ m ∈ ℕ ↔ m ∈ ℤ ≥ 1
2 uztrn ⊢ k ∈ ℤ ≥ m ∧ m ∈ ℤ ≥ 1 → k ∈ ℤ ≥ 1
3 1 2 sylan2b ⊢ k ∈ ℤ ≥ m ∧ m ∈ ℕ → k ∈ ℤ ≥ 1
4 elnnuz ⊢ k ∈ ℕ ↔ k ∈ ℤ ≥ 1
5 3 4 sylibr ⊢ k ∈ ℤ ≥ m ∧ m ∈ ℕ → k ∈ ℕ
6 5 expcom ⊢ m ∈ ℕ → k ∈ ℤ ≥ m → k ∈ ℕ
7 eluzle ⊢ k ∈ ℤ ≥ m → m ≤ k
8 7 a1i ⊢ m ∈ ℕ → k ∈ ℤ ≥ m → m ≤ k
9 6 8 jcad ⊢ m ∈ ℕ → k ∈ ℤ ≥ m → k ∈ ℕ ∧ m ≤ k
10 nnz ⊢ k ∈ ℕ → k ∈ ℤ
11 nnz ⊢ m ∈ ℕ → m ∈ ℤ
12 eluz2 ⊢ k ∈ ℤ ≥ m ↔ m ∈ ℤ ∧ k ∈ ℤ ∧ m ≤ k
13 12 biimpri ⊢ m ∈ ℤ ∧ k ∈ ℤ ∧ m ≤ k → k ∈ ℤ ≥ m
14 11 13 syl3an1 ⊢ m ∈ ℕ ∧ k ∈ ℤ ∧ m ≤ k → k ∈ ℤ ≥ m
15 10 14 syl3an2 ⊢ m ∈ ℕ ∧ k ∈ ℕ ∧ m ≤ k → k ∈ ℤ ≥ m
16 15 3expib ⊢ m ∈ ℕ → k ∈ ℕ ∧ m ≤ k → k ∈ ℤ ≥ m
17 9 16 impbid ⊢ m ∈ ℕ → k ∈ ℤ ≥ m ↔ k ∈ ℕ ∧ m ≤ k
18 17 imbi1d ⊢ m ∈ ℕ → k ∈ ℤ ≥ m → φ ↔ k ∈ ℕ ∧ m ≤ k → φ
19 impexp ⊢ k ∈ ℕ ∧ m ≤ k → φ ↔ k ∈ ℕ → m ≤ k → φ
20 18 19 bitrdi ⊢ m ∈ ℕ → k ∈ ℤ ≥ m → φ ↔ k ∈ ℕ → m ≤ k → φ