Metamath Proof Explorer


Theorem rmxyelqirr

Description: The solutions used to construct the X and Y sequences are quadratic irrationals. (Contributed by Stefan O'Rear, 21-Sep-2014) (Proof shortened by SN, 23-Dec-2024)

Ref Expression
Assertion rmxyelqirr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A + A 2 − 1 N ∈ a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d

Proof

Step Hyp Ref Expression
1 rmspecnonsq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ ∖ ◻ ℕ
2 1 adantr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A 2 − 1 ∈ ℕ ∖ ◻ ℕ
3 pell14qrval ⊢ A 2 − 1 ∈ ℕ ∖ ◻ ℕ → Pell14QR ⁡ A 2 − 1 = a ∈ ℝ | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1
4 2 3 syl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → Pell14QR ⁡ A 2 − 1 = a ∈ ℝ | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1
5 rabssab ⊢ a ∈ ℝ | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1 ⊆ a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1
6 simpl ⊢ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1 → a = c + A 2 − 1 ⁢ d
7 6 reximi ⊢ ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1 → ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d
8 7 reximi ⊢ ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1 → ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d
9 8 ss2abi ⊢ a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1 ⊆ a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d
10 5 9 sstri ⊢ a ∈ ℝ | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ c 2 − A 2 − 1 ⁢ d 2 = 1 ⊆ a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d
11 4 10 eqsstrdi ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → Pell14QR ⁡ A 2 − 1 ⊆ a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d
12 simpr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → N ∈ ℤ
13 rmspecfund ⊢ A ∈ ℤ ≥ 2 → PellFund ⁡ A 2 − 1 = A + A 2 − 1
14 13 adantr ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → PellFund ⁡ A 2 − 1 = A + A 2 − 1
15 14 eqcomd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A + A 2 − 1 = PellFund ⁡ A 2 − 1
16 15 oveq1d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A + A 2 − 1 N = PellFund ⁡ A 2 − 1 N
17 oveq2 ⊢ a = N → PellFund ⁡ A 2 − 1 a = PellFund ⁡ A 2 − 1 N
18 17 rspceeqv ⊢ N ∈ ℤ ∧ A + A 2 − 1 N = PellFund ⁡ A 2 − 1 N → ∃ a ∈ ℤ A + A 2 − 1 N = PellFund ⁡ A 2 − 1 a
19 12 16 18 syl2anc ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → ∃ a ∈ ℤ A + A 2 − 1 N = PellFund ⁡ A 2 − 1 a
20 pellfund14b ⊢ A 2 − 1 ∈ ℕ ∖ ◻ ℕ → A + A 2 − 1 N ∈ Pell14QR ⁡ A 2 − 1 ↔ ∃ a ∈ ℤ A + A 2 − 1 N = PellFund ⁡ A 2 − 1 a
21 2 20 syl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A + A 2 − 1 N ∈ Pell14QR ⁡ A 2 − 1 ↔ ∃ a ∈ ℤ A + A 2 − 1 N = PellFund ⁡ A 2 − 1 a
22 19 21 mpbird ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A + A 2 − 1 N ∈ Pell14QR ⁡ A 2 − 1
23 11 22 sseldd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A + A 2 − 1 N ∈ a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d