Metamath Proof Explorer


Theorem rmspecfund

Description: The base of exponent used to define the X and Y sequences is the fundamental solution of the corresponding Pell equation. (Contributed by Stefan O'Rear, 21-Sep-2014)

Ref Expression
Assertion rmspecfund ⊢ A ∈ ℤ ≥ 2 → PellFund ⁡ A 2 − 1 = A + A 2 − 1

Proof

Step Hyp Ref Expression
1 rmspecnonsq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ ∖ ◻ ℕ
2 eluzelz ⊢ A ∈ ℤ ≥ 2 → A ∈ ℤ
3 zsqcl ⊢ A ∈ ℤ → A 2 ∈ ℤ
4 2 3 syl ⊢ A ∈ ℤ ≥ 2 → A 2 ∈ ℤ
5 4 zred ⊢ A ∈ ℤ ≥ 2 → A 2 ∈ ℝ
6 1red ⊢ A ∈ ℤ ≥ 2 → 1 ∈ ℝ
7 5 6 resubcld ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℝ
8 sq1 ⊢ 1 2 = 1
9 8 a1i ⊢ A ∈ ℤ ≥ 2 → 1 2 = 1
10 eluz2b2 ⊢ A ∈ ℤ ≥ 2 ↔ A ∈ ℕ ∧ 1 < A
11 10 simprbi ⊢ A ∈ ℤ ≥ 2 → 1 < A
12 eluzelre ⊢ A ∈ ℤ ≥ 2 → A ∈ ℝ
13 0le1 ⊢ 0 ≤ 1
14 13 a1i ⊢ A ∈ ℤ ≥ 2 → 0 ≤ 1
15 eluzge2nn0 ⊢ A ∈ ℤ ≥ 2 → A ∈ ℕ 0
16 15 nn0ge0d ⊢ A ∈ ℤ ≥ 2 → 0 ≤ A
17 6 12 14 16 lt2sqd ⊢ A ∈ ℤ ≥ 2 → 1 < A ↔ 1 2 < A 2
18 11 17 mpbid ⊢ A ∈ ℤ ≥ 2 → 1 2 < A 2
19 9 18 eqbrtrrd ⊢ A ∈ ℤ ≥ 2 → 1 < A 2
20 6 5 posdifd ⊢ A ∈ ℤ ≥ 2 → 1 < A 2 ↔ 0 < A 2 − 1
21 19 20 mpbid ⊢ A ∈ ℤ ≥ 2 → 0 < A 2 − 1
22 7 21 elrpd ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℝ +
23 22 rpsqrtcld ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℝ +
24 23 rpred ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℝ
25 24 recnd ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℂ
26 25 mulridd ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ⋅ 1 = A 2 − 1
27 26 oveq2d ⊢ A ∈ ℤ ≥ 2 → A + A 2 − 1 ⋅ 1 = A + A 2 − 1
28 pell1qrss14 ⊢ A 2 − 1 ∈ ℕ ∖ ◻ ℕ → Pell1QR ⁡ A 2 − 1 ⊆ Pell14QR ⁡ A 2 − 1
29 1 28 syl ⊢ A ∈ ℤ ≥ 2 → Pell1QR ⁡ A 2 − 1 ⊆ Pell14QR ⁡ A 2 − 1
30 1nn0 ⊢ 1 ∈ ℕ 0
31 30 a1i ⊢ A ∈ ℤ ≥ 2 → 1 ∈ ℕ 0
32 8 oveq2i ⊢ A 2 − 1 ⁢ 1 2 = A 2 − 1 ⋅ 1
33 7 recnd ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℂ
34 33 mulridd ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ⋅ 1 = A 2 − 1
35 32 34 eqtrid ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ⁢ 1 2 = A 2 − 1
36 35 oveq2d ⊢ A ∈ ℤ ≥ 2 → A 2 − A 2 − 1 ⁢ 1 2 = A 2 − A 2 − 1
37 5 recnd ⊢ A ∈ ℤ ≥ 2 → A 2 ∈ ℂ
38 1cnd ⊢ A ∈ ℤ ≥ 2 → 1 ∈ ℂ
39 37 38 nncand ⊢ A ∈ ℤ ≥ 2 → A 2 − A 2 − 1 = 1
40 36 39 eqtrd ⊢ A ∈ ℤ ≥ 2 → A 2 − A 2 − 1 ⁢ 1 2 = 1
41 pellqrexplicit ⊢ A 2 − 1 ∈ ℕ ∖ ◻ ℕ ∧ A ∈ ℕ 0 ∧ 1 ∈ ℕ 0 ∧ A 2 − A 2 − 1 ⁢ 1 2 = 1 → A + A 2 − 1 ⋅ 1 ∈ Pell1QR ⁡ A 2 − 1
42 1 15 31 40 41 syl31anc ⊢ A ∈ ℤ ≥ 2 → A + A 2 − 1 ⋅ 1 ∈ Pell1QR ⁡ A 2 − 1
43 29 42 sseldd ⊢ A ∈ ℤ ≥ 2 → A + A 2 − 1 ⋅ 1 ∈ Pell14QR ⁡ A 2 − 1
44 27 43 eqeltrrd ⊢ A ∈ ℤ ≥ 2 → A + A 2 − 1 ∈ Pell14QR ⁡ A 2 − 1
45 6 24 readdcld ⊢ A ∈ ℤ ≥ 2 → 1 + A 2 − 1 ∈ ℝ
46 12 24 readdcld ⊢ A ∈ ℤ ≥ 2 → A + A 2 − 1 ∈ ℝ
47 6 23 ltaddrpd ⊢ A ∈ ℤ ≥ 2 → 1 < 1 + A 2 − 1
48 6 12 24 11 ltadd1dd ⊢ A ∈ ℤ ≥ 2 → 1 + A 2 − 1 < A + A 2 − 1
49 6 45 46 47 48 lttrd ⊢ A ∈ ℤ ≥ 2 → 1 < A + A 2 − 1
50 pellfundlb ⊢ A 2 − 1 ∈ ℕ ∖ ◻ ℕ ∧ A + A 2 − 1 ∈ Pell14QR ⁡ A 2 − 1 ∧ 1 < A + A 2 − 1 → PellFund ⁡ A 2 − 1 ≤ A + A 2 − 1
51 1 44 49 50 syl3anc ⊢ A ∈ ℤ ≥ 2 → PellFund ⁡ A 2 − 1 ≤ A + A 2 − 1
52 37 38 npcand ⊢ A ∈ ℤ ≥ 2 → A 2 - 1 + 1 = A 2
53 52 fveq2d ⊢ A ∈ ℤ ≥ 2 → A 2 - 1 + 1 = A 2
54 12 16 sqrtsqd ⊢ A ∈ ℤ ≥ 2 → A 2 = A
55 53 54 eqtrd ⊢ A ∈ ℤ ≥ 2 → A 2 - 1 + 1 = A
56 55 oveq1d ⊢ A ∈ ℤ ≥ 2 → A 2 - 1 + 1 + A 2 − 1 = A + A 2 − 1
57 pellfundge ⊢ A 2 − 1 ∈ ℕ ∖ ◻ ℕ → A 2 - 1 + 1 + A 2 − 1 ≤ PellFund ⁡ A 2 − 1
58 1 57 syl ⊢ A ∈ ℤ ≥ 2 → A 2 - 1 + 1 + A 2 − 1 ≤ PellFund ⁡ A 2 − 1
59 56 58 eqbrtrrd ⊢ A ∈ ℤ ≥ 2 → A + A 2 − 1 ≤ PellFund ⁡ A 2 − 1
60 pellfundre ⊢ A 2 − 1 ∈ ℕ ∖ ◻ ℕ → PellFund ⁡ A 2 − 1 ∈ ℝ
61 1 60 syl ⊢ A ∈ ℤ ≥ 2 → PellFund ⁡ A 2 − 1 ∈ ℝ
62 61 46 letri3d ⊢ A ∈ ℤ ≥ 2 → PellFund ⁡ A 2 − 1 = A + A 2 − 1 ↔ PellFund ⁡ A 2 − 1 ≤ A + A 2 − 1 ∧ A + A 2 − 1 ≤ PellFund ⁡ A 2 − 1
63 51 59 62 mpbir2and ⊢ A ∈ ℤ ≥ 2 → PellFund ⁡ A 2 − 1 = A + A 2 − 1