Metamath Proof Explorer


Theorem jm2.17c

Description: Second half of lemma 2.17 of JonesMatijasevic p. 696. (Contributed by Stefan O'Rear, 15-Oct-2014)

Ref Expression
Assertion jm2.17c ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 + 1 < 2 ⁢ A N + 1

Proof

Step Hyp Ref Expression
1 2re ⊢ 2 ∈ ℝ
2 eluzelre ⊢ A ∈ ℤ ≥ 2 → A ∈ ℝ
3 2 adantr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A ∈ ℝ
4 remulcl ⊢ 2 ∈ ℝ ∧ A ∈ ℝ → 2 ⁢ A ∈ ℝ
5 1 3 4 sylancr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ∈ ℝ
6 nnz ⊢ N ∈ ℕ → N ∈ ℤ
7 6 adantl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → N ∈ ℤ
8 7 peano2zd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → N + 1 ∈ ℤ
9 frmy ⊢ Y rm : ℤ ≥ 2 × ℤ ⟶ ℤ
10 9 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ N + 1 ∈ ℤ → A Y rm N + 1 ∈ ℤ
11 10 zred ⊢ A ∈ ℤ ≥ 2 ∧ N + 1 ∈ ℤ → A Y rm N + 1 ∈ ℝ
12 8 11 syldan ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 ∈ ℝ
13 5 12 remulcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ⁢ A Y rm N + 1 ∈ ℝ
14 nncn ⊢ N ∈ ℕ → N ∈ ℂ
15 14 adantl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → N ∈ ℂ
16 ax-1cn ⊢ 1 ∈ ℂ
17 pncan ⊢ N ∈ ℂ ∧ 1 ∈ ℂ → N + 1 - 1 = N
18 15 16 17 sylancl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → N + 1 - 1 = N
19 18 oveq2d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 - 1 = A Y rm N
20 9 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A Y rm N ∈ ℤ
21 20 zred ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A Y rm N ∈ ℝ
22 6 21 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N ∈ ℝ
23 19 22 eqeltrd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 - 1 ∈ ℝ
24 13 23 resubcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ⁢ A Y rm N + 1 − A Y rm N + 1 - 1 ∈ ℝ
25 nnnn0 ⊢ N ∈ ℕ → N ∈ ℕ 0
26 25 adantl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → N ∈ ℕ 0
27 5 26 reexpcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A N ∈ ℝ
28 5 27 remulcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ⁢ 2 ⁢ A N ∈ ℝ
29 rmy0 ⊢ A ∈ ℤ ≥ 2 → A Y rm 0 = 0
30 29 adantr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm 0 = 0
31 nngt0 ⊢ N ∈ ℕ → 0 < N
32 31 adantl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 0 < N
33 simpl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A ∈ ℤ ≥ 2
34 0zd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 0 ∈ ℤ
35 ltrmy ⊢ A ∈ ℤ ≥ 2 ∧ 0 ∈ ℤ ∧ N ∈ ℤ → 0 < N ↔ A Y rm 0 < A Y rm N
36 33 34 7 35 syl3anc ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 0 < N ↔ A Y rm 0 < A Y rm N
37 32 36 mpbid ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm 0 < A Y rm N
38 30 37 eqbrtrrd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 0 < A Y rm N
39 38 19 breqtrrd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 0 < A Y rm N + 1 - 1
40 23 13 ltsubposd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 0 < A Y rm N + 1 - 1 ↔ 2 ⁢ A ⁢ A Y rm N + 1 − A Y rm N + 1 - 1 < 2 ⁢ A ⁢ A Y rm N + 1
41 39 40 mpbid ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ⁢ A Y rm N + 1 − A Y rm N + 1 - 1 < 2 ⁢ A ⁢ A Y rm N + 1
42 jm2.17b ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 → A Y rm N + 1 ≤ 2 ⁢ A N
43 25 42 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 ≤ 2 ⁢ A N
44 2nn ⊢ 2 ∈ ℕ
45 eluz2nn ⊢ A ∈ ℤ ≥ 2 → A ∈ ℕ
46 nnmulcl ⊢ 2 ∈ ℕ ∧ A ∈ ℕ → 2 ⁢ A ∈ ℕ
47 44 45 46 sylancr ⊢ A ∈ ℤ ≥ 2 → 2 ⁢ A ∈ ℕ
48 47 nngt0d ⊢ A ∈ ℤ ≥ 2 → 0 < 2 ⁢ A
49 48 adantr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 0 < 2 ⁢ A
50 lemul2 ⊢ A Y rm N + 1 ∈ ℝ ∧ 2 ⁢ A N ∈ ℝ ∧ 2 ⁢ A ∈ ℝ ∧ 0 < 2 ⁢ A → A Y rm N + 1 ≤ 2 ⁢ A N ↔ 2 ⁢ A ⁢ A Y rm N + 1 ≤ 2 ⁢ A ⁢ 2 ⁢ A N
51 12 27 5 49 50 syl112anc ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 ≤ 2 ⁢ A N ↔ 2 ⁢ A ⁢ A Y rm N + 1 ≤ 2 ⁢ A ⁢ 2 ⁢ A N
52 43 51 mpbid ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ⁢ A Y rm N + 1 ≤ 2 ⁢ A ⁢ 2 ⁢ A N
53 24 13 28 41 52 ltletrd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ⁢ A Y rm N + 1 − A Y rm N + 1 - 1 < 2 ⁢ A ⁢ 2 ⁢ A N
54 rmyluc2 ⊢ A ∈ ℤ ≥ 2 ∧ N + 1 ∈ ℤ → A Y rm N + 1 + 1 = 2 ⁢ A ⁢ A Y rm N + 1 − A Y rm N + 1 - 1
55 8 54 syldan ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 + 1 = 2 ⁢ A ⁢ A Y rm N + 1 − A Y rm N + 1 - 1
56 5 recnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A ∈ ℂ
57 56 26 expp1d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A N + 1 = 2 ⁢ A N ⁢ 2 ⁢ A
58 27 recnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A N ∈ ℂ
59 58 56 mulcomd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A N ⁢ 2 ⁢ A = 2 ⁢ A ⁢ 2 ⁢ A N
60 57 59 eqtrd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → 2 ⁢ A N + 1 = 2 ⁢ A ⁢ 2 ⁢ A N
61 53 55 60 3brtr4d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ → A Y rm N + 1 + 1 < 2 ⁢ A N + 1