Metamath Proof Explorer


Theorem rmxluc

Description: The X sequence is a Lucas (second-order integer recurrence) sequence. Part 3 of equation 2.11 of JonesMatijasevic p. 695. (Contributed by Stefan O'Rear, 14-Oct-2014)

Ref Expression
Assertion rmxluc ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N + 1 = 2 ⁢ A ⁢ A X rm N − A X rm N − 1

Proof

Step Hyp Ref Expression
1 peano2zm ⊢ N ∈ ℤ → N − 1 ∈ ℤ
2 frmx ⊢ X rm : ℤ ≥ 2 × ℤ ⟶ ℕ 0
3 2 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ N − 1 ∈ ℤ → A X rm N − 1 ∈ ℕ 0
4 3 nn0cnd ⊢ A ∈ ℤ ≥ 2 ∧ N − 1 ∈ ℤ → A X rm N − 1 ∈ ℂ
5 1 4 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N − 1 ∈ ℂ
6 peano2z ⊢ N ∈ ℤ → N + 1 ∈ ℤ
7 2 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ N + 1 ∈ ℤ → A X rm N + 1 ∈ ℕ 0
8 7 nn0cnd ⊢ A ∈ ℤ ≥ 2 ∧ N + 1 ∈ ℤ → A X rm N + 1 ∈ ℂ
9 6 8 sylan2 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N + 1 ∈ ℂ
10 5 9 addcomd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N − 1 + A X rm N + 1 = A X rm N + 1 + A X rm N − 1
11 rmxp1 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N + 1 = A X rm N ⁢ A + A 2 − 1 ⁢ A Y rm N
12 rmxm1 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N − 1 = A ⁢ A X rm N − A 2 − 1 ⁢ A Y rm N
13 11 12 oveq12d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N + 1 + A X rm N − 1 = A X rm N ⁢ A + A 2 − 1 ⁢ A Y rm N + A ⁢ A X rm N − A 2 − 1 ⁢ A Y rm N
14 2 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ∈ ℕ 0
15 14 nn0cnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ∈ ℂ
16 eluzelcn ⊢ A ∈ ℤ ≥ 2 → A ∈ ℂ
17 16 adantr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A ∈ ℂ
18 15 17 mulcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ⁢ A ∈ ℂ
19 rmspecnonsq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ ∖ ◻ ℕ
20 19 eldifad ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ
21 20 nncnd ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℂ
22 21 adantr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A 2 − 1 ∈ ℂ
23 frmy ⊢ Y rm : ℤ ≥ 2 × ℤ ⟶ ℤ
24 23 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A Y rm N ∈ ℤ
25 24 zcnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A Y rm N ∈ ℂ
26 22 25 mulcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A 2 − 1 ⁢ A Y rm N ∈ ℂ
27 17 15 mulcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A ⁢ A X rm N ∈ ℂ
28 18 26 27 ppncand ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ⁢ A + A 2 − 1 ⁢ A Y rm N + A ⁢ A X rm N − A 2 − 1 ⁢ A Y rm N = A X rm N ⁢ A + A ⁢ A X rm N
29 15 17 mulcomd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ⁢ A = A ⁢ A X rm N
30 29 oveq1d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ⁢ A + A ⁢ A X rm N = A ⁢ A X rm N + A ⁢ A X rm N
31 2cnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → 2 ∈ ℂ
32 31 17 15 mulassd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → 2 ⁢ A ⁢ A X rm N = 2 ⁢ A ⁢ A X rm N
33 27 2timesd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → 2 ⁢ A ⁢ A X rm N = A ⁢ A X rm N + A ⁢ A X rm N
34 32 33 eqtr2d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A ⁢ A X rm N + A ⁢ A X rm N = 2 ⁢ A ⁢ A X rm N
35 28 30 34 3eqtrd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ⁢ A + A 2 − 1 ⁢ A Y rm N + A ⁢ A X rm N − A 2 − 1 ⁢ A Y rm N = 2 ⁢ A ⁢ A X rm N
36 10 13 35 3eqtrd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N − 1 + A X rm N + 1 = 2 ⁢ A ⁢ A X rm N
37 2cn ⊢ 2 ∈ ℂ
38 mulcl ⊢ 2 ∈ ℂ ∧ A ∈ ℂ → 2 ⁢ A ∈ ℂ
39 37 17 38 sylancr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → 2 ⁢ A ∈ ℂ
40 39 15 mulcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → 2 ⁢ A ⁢ A X rm N ∈ ℂ
41 40 5 9 subaddd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → 2 ⁢ A ⁢ A X rm N − A X rm N − 1 = A X rm N + 1 ↔ A X rm N − 1 + A X rm N + 1 = 2 ⁢ A ⁢ A X rm N
42 36 41 mpbird ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → 2 ⁢ A ⁢ A X rm N − A X rm N − 1 = A X rm N + 1
43 42 eqcomd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N + 1 = 2 ⁢ A ⁢ A X rm N − A X rm N − 1