Metamath Proof Explorer


Theorem rmspecnonsq

Description: The discriminant used to define the X and Y sequences is a nonsquare positive integer and thus a valid Pell equation discriminant. (Contributed by Stefan O'Rear, 21-Sep-2014)

Ref Expression
Assertion rmspecnonsq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ ∖ ◻ ℕ

Proof

Step Hyp Ref Expression
1 eluzelz ⊢ A ∈ ℤ ≥ 2 → A ∈ ℤ
2 zsqcl ⊢ A ∈ ℤ → A 2 ∈ ℤ
3 1 2 syl ⊢ A ∈ ℤ ≥ 2 → A 2 ∈ ℤ
4 1zzd ⊢ A ∈ ℤ ≥ 2 → 1 ∈ ℤ
5 3 4 zsubcld ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℤ
6 sq1 ⊢ 1 2 = 1
7 eluz2b2 ⊢ A ∈ ℤ ≥ 2 ↔ A ∈ ℕ ∧ 1 < A
8 7 simprbi ⊢ A ∈ ℤ ≥ 2 → 1 < A
9 1red ⊢ A ∈ ℤ ≥ 2 → 1 ∈ ℝ
10 eluzelre ⊢ A ∈ ℤ ≥ 2 → A ∈ ℝ
11 0le1 ⊢ 0 ≤ 1
12 11 a1i ⊢ A ∈ ℤ ≥ 2 → 0 ≤ 1
13 eluzge2nn0 ⊢ A ∈ ℤ ≥ 2 → A ∈ ℕ 0
14 13 nn0ge0d ⊢ A ∈ ℤ ≥ 2 → 0 ≤ A
15 9 10 12 14 lt2sqd ⊢ A ∈ ℤ ≥ 2 → 1 < A ↔ 1 2 < A 2
16 8 15 mpbid ⊢ A ∈ ℤ ≥ 2 → 1 2 < A 2
17 6 16 eqbrtrrid ⊢ A ∈ ℤ ≥ 2 → 1 < A 2
18 10 resqcld ⊢ A ∈ ℤ ≥ 2 → A 2 ∈ ℝ
19 9 18 posdifd ⊢ A ∈ ℤ ≥ 2 → 1 < A 2 ↔ 0 < A 2 − 1
20 17 19 mpbid ⊢ A ∈ ℤ ≥ 2 → 0 < A 2 − 1
21 elnnz ⊢ A 2 − 1 ∈ ℕ ↔ A 2 − 1 ∈ ℤ ∧ 0 < A 2 − 1
22 5 20 21 sylanbrc ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ
23 rmspecsqrtnq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℂ ∖ ℚ
24 23 eldifbd ⊢ A ∈ ℤ ≥ 2 → ¬ A 2 − 1 ∈ ℚ
25 24 intnand ⊢ A ∈ ℤ ≥ 2 → ¬ A 2 − 1 ∈ ℕ ∧ A 2 − 1 ∈ ℚ
26 df-squarenn ⊢ ◻ ℕ = a ∈ ℕ | a ∈ ℚ
27 26 eleq2i ⊢ A 2 − 1 ∈ ◻ ℕ ↔ A 2 − 1 ∈ a ∈ ℕ | a ∈ ℚ
28 fveq2 ⊢ a = A 2 − 1 → a = A 2 − 1
29 28 eleq1d ⊢ a = A 2 − 1 → a ∈ ℚ ↔ A 2 − 1 ∈ ℚ
30 29 elrab ⊢ A 2 − 1 ∈ a ∈ ℕ | a ∈ ℚ ↔ A 2 − 1 ∈ ℕ ∧ A 2 − 1 ∈ ℚ
31 27 30 bitr2i ⊢ A 2 − 1 ∈ ℕ ∧ A 2 − 1 ∈ ℚ ↔ A 2 − 1 ∈ ◻ ℕ
32 25 31 sylnib ⊢ A ∈ ℤ ≥ 2 → ¬ A 2 − 1 ∈ ◻ ℕ
33 22 32 eldifd ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ ∖ ◻ ℕ