Metamath Proof Explorer


Theorem ltrmxnn0

Description: The X-sequence is strictly monotonic on NN0 . (Contributed by Stefan O'Rear, 4-Oct-2014)

Ref Expression
Assertion ltrmxnn0 ⊢ A ∈ ℤ ≥ 2 ∧ M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M < N ↔ A X rm M < A X rm N

Proof

Step Hyp Ref Expression
1 nn0z ⊢ b ∈ ℕ 0 → b ∈ ℤ
2 frmx ⊢ X rm : ℤ ≥ 2 × ℤ ⟶ ℕ 0
3 2 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℤ → A X rm b ∈ ℕ 0
4 1 3 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b ∈ ℕ 0
5 4 nn0red ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b ∈ ℝ
6 eluzelre ⊢ A ∈ ℤ ≥ 2 → A ∈ ℝ
7 6 adantr ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A ∈ ℝ
8 5 7 remulcld ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b ⁢ A ∈ ℝ
9 1 peano2zd ⊢ b ∈ ℕ 0 → b + 1 ∈ ℤ
10 2 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ b + 1 ∈ ℤ → A X rm b + 1 ∈ ℕ 0
11 9 10 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b + 1 ∈ ℕ 0
12 11 nn0red ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b + 1 ∈ ℝ
13 eluz2b2 ⊢ A ∈ ℤ ≥ 2 ↔ A ∈ ℕ ∧ 1 < A
14 13 simprbi ⊢ A ∈ ℤ ≥ 2 → 1 < A
15 14 adantr ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 1 < A
16 rmxypos ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 0 < A X rm b ∧ 0 ≤ A Y rm b
17 16 simpld ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 0 < A X rm b
18 ltmulgt11 ⊢ A X rm b ∈ ℝ ∧ A ∈ ℝ ∧ 0 < A X rm b → 1 < A ↔ A X rm b < A X rm b ⁢ A
19 5 7 17 18 syl3anc ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 1 < A ↔ A X rm b < A X rm b ⁢ A
20 15 19 mpbid ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b < A X rm b ⁢ A
21 rmspecnonsq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ ∖ ◻ ℕ
22 21 eldifad ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ
23 22 adantr ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A 2 − 1 ∈ ℕ
24 23 nnred ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A 2 − 1 ∈ ℝ
25 frmy ⊢ Y rm : ℤ ≥ 2 × ℤ ⟶ ℤ
26 25 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℤ → A Y rm b ∈ ℤ
27 1 26 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A Y rm b ∈ ℤ
28 27 zred ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A Y rm b ∈ ℝ
29 23 nnnn0d ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A 2 − 1 ∈ ℕ 0
30 29 nn0ge0d ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 0 ≤ A 2 − 1
31 16 simprd ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 0 ≤ A Y rm b
32 24 28 30 31 mulge0d ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 0 ≤ A 2 − 1 ⁢ A Y rm b
33 24 28 remulcld ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A 2 − 1 ⁢ A Y rm b ∈ ℝ
34 8 33 addge01d ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → 0 ≤ A 2 − 1 ⁢ A Y rm b ↔ A X rm b ⁢ A ≤ A X rm b ⁢ A + A 2 − 1 ⁢ A Y rm b
35 32 34 mpbid ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b ⁢ A ≤ A X rm b ⁢ A + A 2 − 1 ⁢ A Y rm b
36 rmxp1 ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℤ → A X rm b + 1 = A X rm b ⁢ A + A 2 − 1 ⁢ A Y rm b
37 1 36 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b + 1 = A X rm b ⁢ A + A 2 − 1 ⁢ A Y rm b
38 35 37 breqtrrd ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b ⁢ A ≤ A X rm b + 1
39 5 8 12 20 38 ltletrd ⊢ A ∈ ℤ ≥ 2 ∧ b ∈ ℕ 0 → A X rm b < A X rm b + 1
40 nn0z ⊢ a ∈ ℕ 0 → a ∈ ℤ
41 2 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ a ∈ ℤ → A X rm a ∈ ℕ 0
42 40 41 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ a ∈ ℕ 0 → A X rm a ∈ ℕ 0
43 42 nn0red ⊢ A ∈ ℤ ≥ 2 ∧ a ∈ ℕ 0 → A X rm a ∈ ℝ
44 nn0uz ⊢ ℕ 0 = ℤ ≥ 0
45 oveq2 ⊢ a = b + 1 → A X rm a = A X rm b + 1
46 oveq2 ⊢ a = b → A X rm a = A X rm b
47 oveq2 ⊢ a = M → A X rm a = A X rm M
48 oveq2 ⊢ a = N → A X rm a = A X rm N
49 39 43 44 45 46 47 48 monotuz ⊢ A ∈ ℤ ≥ 2 ∧ M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M < N ↔ A X rm M < A X rm N
50 49 3impb ⊢ A ∈ ℤ ≥ 2 ∧ M ∈ ℕ 0 ∧ N ∈ ℕ 0 → M < N ↔ A X rm M < A X rm N