Metamath Proof Explorer


Theorem zm1nn

Description: An integer minus 1 is positive under certain circumstances. (Contributed by Alexander van der Vekens, 9-Jun-2018)

Ref Expression
Assertion zm1nn ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → J ∈ ℝ ∧ 0 ≤ J ∧ J < L - N - 1 → L − 1 ∈ ℕ

Proof

Step Hyp Ref Expression
1 0red ⊢ J ∈ ℝ ∧ N ∈ ℕ 0 ∧ L ∈ ℤ → 0 ∈ ℝ
2 simpl ⊢ J ∈ ℝ ∧ N ∈ ℕ 0 ∧ L ∈ ℤ → J ∈ ℝ
3 zre ⊢ L ∈ ℤ → L ∈ ℝ
4 nn0re ⊢ N ∈ ℕ 0 → N ∈ ℝ
5 resubcl ⊢ L ∈ ℝ ∧ N ∈ ℝ → L − N ∈ ℝ
6 3 4 5 syl2anr ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → L − N ∈ ℝ
7 6 adantl ⊢ J ∈ ℝ ∧ N ∈ ℕ 0 ∧ L ∈ ℤ → L − N ∈ ℝ
8 peano2rem ⊢ L − N ∈ ℝ → L - N - 1 ∈ ℝ
9 7 8 syl ⊢ J ∈ ℝ ∧ N ∈ ℕ 0 ∧ L ∈ ℤ → L - N - 1 ∈ ℝ
10 lelttr ⊢ 0 ∈ ℝ ∧ J ∈ ℝ ∧ L - N - 1 ∈ ℝ → 0 ≤ J ∧ J < L - N - 1 → 0 < L - N - 1
11 1 2 9 10 syl3anc ⊢ J ∈ ℝ ∧ N ∈ ℕ 0 ∧ L ∈ ℤ → 0 ≤ J ∧ J < L - N - 1 → 0 < L - N - 1
12 1red ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → 1 ∈ ℝ
13 12 6 posdifd ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → 1 < L − N ↔ 0 < L - N - 1
14 4 adantr ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → N ∈ ℝ
15 3 adantl ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → L ∈ ℝ
16 12 14 15 ltaddsubd ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → 1 + N < L ↔ 1 < L − N
17 elnn0z ⊢ N ∈ ℕ 0 ↔ N ∈ ℤ ∧ 0 ≤ N
18 0red ⊢ N ∈ ℤ ∧ L ∈ ℤ → 0 ∈ ℝ
19 zre ⊢ N ∈ ℤ → N ∈ ℝ
20 19 adantr ⊢ N ∈ ℤ ∧ L ∈ ℤ → N ∈ ℝ
21 1red ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 ∈ ℝ
22 18 20 21 leadd2d ⊢ N ∈ ℤ ∧ L ∈ ℤ → 0 ≤ N ↔ 1 + 0 ≤ 1 + N
23 1re ⊢ 1 ∈ ℝ
24 0re ⊢ 0 ∈ ℝ
25 23 24 readdcli ⊢ 1 + 0 ∈ ℝ
26 25 a1i ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 + 0 ∈ ℝ
27 1red ⊢ N ∈ ℤ → 1 ∈ ℝ
28 27 19 readdcld ⊢ N ∈ ℤ → 1 + N ∈ ℝ
29 28 adantr ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 + N ∈ ℝ
30 3 adantl ⊢ N ∈ ℤ ∧ L ∈ ℤ → L ∈ ℝ
31 lelttr ⊢ 1 + 0 ∈ ℝ ∧ 1 + N ∈ ℝ ∧ L ∈ ℝ → 1 + 0 ≤ 1 + N ∧ 1 + N < L → 1 + 0 < L
32 26 29 30 31 syl3anc ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 + 0 ≤ 1 + N ∧ 1 + N < L → 1 + 0 < L
33 peano2zm ⊢ L ∈ ℤ → L − 1 ∈ ℤ
34 33 adantl ⊢ N ∈ ℤ ∧ L ∈ ℤ → L − 1 ∈ ℤ
35 34 adantr ⊢ N ∈ ℤ ∧ L ∈ ℤ ∧ 1 + 0 < L → L − 1 ∈ ℤ
36 1red ⊢ L ∈ ℤ → 1 ∈ ℝ
37 0red ⊢ L ∈ ℤ → 0 ∈ ℝ
38 36 37 3 ltaddsub2d ⊢ L ∈ ℤ → 1 + 0 < L ↔ 0 < L − 1
39 38 biimpd ⊢ L ∈ ℤ → 1 + 0 < L → 0 < L − 1
40 39 adantl ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 + 0 < L → 0 < L − 1
41 40 imp ⊢ N ∈ ℤ ∧ L ∈ ℤ ∧ 1 + 0 < L → 0 < L − 1
42 elnnz ⊢ L − 1 ∈ ℕ ↔ L − 1 ∈ ℤ ∧ 0 < L − 1
43 35 41 42 sylanbrc ⊢ N ∈ ℤ ∧ L ∈ ℤ ∧ 1 + 0 < L → L − 1 ∈ ℕ
44 43 ex ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 + 0 < L → L − 1 ∈ ℕ
45 32 44 syld ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 + 0 ≤ 1 + N ∧ 1 + N < L → L − 1 ∈ ℕ
46 45 expd ⊢ N ∈ ℤ ∧ L ∈ ℤ → 1 + 0 ≤ 1 + N → 1 + N < L → L − 1 ∈ ℕ
47 22 46 sylbid ⊢ N ∈ ℤ ∧ L ∈ ℤ → 0 ≤ N → 1 + N < L → L − 1 ∈ ℕ
48 47 impancom ⊢ N ∈ ℤ ∧ 0 ≤ N → L ∈ ℤ → 1 + N < L → L − 1 ∈ ℕ
49 17 48 sylbi ⊢ N ∈ ℕ 0 → L ∈ ℤ → 1 + N < L → L − 1 ∈ ℕ
50 49 imp ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → 1 + N < L → L − 1 ∈ ℕ
51 16 50 sylbird ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → 1 < L − N → L − 1 ∈ ℕ
52 13 51 sylbird ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → 0 < L - N - 1 → L − 1 ∈ ℕ
53 52 adantl ⊢ J ∈ ℝ ∧ N ∈ ℕ 0 ∧ L ∈ ℤ → 0 < L - N - 1 → L − 1 ∈ ℕ
54 11 53 syld ⊢ J ∈ ℝ ∧ N ∈ ℕ 0 ∧ L ∈ ℤ → 0 ≤ J ∧ J < L - N - 1 → L − 1 ∈ ℕ
55 54 ex ⊢ J ∈ ℝ → N ∈ ℕ 0 ∧ L ∈ ℤ → 0 ≤ J ∧ J < L - N - 1 → L − 1 ∈ ℕ
56 55 com23 ⊢ J ∈ ℝ → 0 ≤ J ∧ J < L - N - 1 → N ∈ ℕ 0 ∧ L ∈ ℤ → L − 1 ∈ ℕ
57 56 3impib ⊢ J ∈ ℝ ∧ 0 ≤ J ∧ J < L - N - 1 → N ∈ ℕ 0 ∧ L ∈ ℤ → L − 1 ∈ ℕ
58 57 com12 ⊢ N ∈ ℕ 0 ∧ L ∈ ℤ → J ∈ ℝ ∧ 0 ≤ J ∧ J < L - N - 1 → L − 1 ∈ ℕ