Metamath Proof Explorer


Theorem rmxdiophlem

Description: X can be expressed in terms of Y, so it is also Diophantine. (Contributed by Stefan O'Rear, 15-Oct-2014)

Ref Expression
Assertion rmxdiophlem ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X = A X rm N ↔ ∃ y ∈ ℕ 0 y = A Y rm N ∧ X 2 − A 2 − 1 ⁢ y 2 = 1

Proof

Step Hyp Ref Expression
1 nn0sqcl ⊢ X ∈ ℕ 0 → X 2 ∈ ℕ 0
2 1 3ad2ant3 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X 2 ∈ ℕ 0
3 2 nn0cnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X 2 ∈ ℂ
4 simp1 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A ∈ ℤ ≥ 2
5 nn0z ⊢ N ∈ ℕ 0 → N ∈ ℤ
6 5 3ad2ant2 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → N ∈ ℤ
7 frmx ⊢ X rm : ℤ ≥ 2 × ℤ ⟶ ℕ 0
8 7 fovcl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N ∈ ℕ 0
9 4 6 8 syl2anc ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A X rm N ∈ ℕ 0
10 nn0sqcl ⊢ A X rm N ∈ ℕ 0 → A X rm N 2 ∈ ℕ 0
11 9 10 syl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A X rm N 2 ∈ ℕ 0
12 11 nn0cnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A X rm N 2 ∈ ℂ
13 rmspecnonsq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ ∖ ◻ ℕ
14 13 eldifad ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ
15 14 nnnn0d ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℕ 0
16 15 3ad2ant1 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A 2 − 1 ∈ ℕ 0
17 rmynn0 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 → A Y rm N ∈ ℕ 0
18 17 3adant3 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A Y rm N ∈ ℕ 0
19 nn0sqcl ⊢ A Y rm N ∈ ℕ 0 → A Y rm N 2 ∈ ℕ 0
20 18 19 syl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A Y rm N 2 ∈ ℕ 0
21 16 20 nn0mulcld ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A 2 − 1 ⁢ A Y rm N 2 ∈ ℕ 0
22 21 nn0cnd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A 2 − 1 ⁢ A Y rm N 2 ∈ ℂ
23 3 12 22 subcan2ad ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X 2 − A 2 − 1 ⁢ A Y rm N 2 = A X rm N 2 − A 2 − 1 ⁢ A Y rm N 2 ↔ X 2 = A X rm N 2
24 rmxynorm ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℤ → A X rm N 2 − A 2 − 1 ⁢ A Y rm N 2 = 1
25 4 6 24 syl2anc ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A X rm N 2 − A 2 − 1 ⁢ A Y rm N 2 = 1
26 25 eqeq2d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X 2 − A 2 − 1 ⁢ A Y rm N 2 = A X rm N 2 − A 2 − 1 ⁢ A Y rm N 2 ↔ X 2 − A 2 − 1 ⁢ A Y rm N 2 = 1
27 nn0re ⊢ X ∈ ℕ 0 → X ∈ ℝ
28 nn0ge0 ⊢ X ∈ ℕ 0 → 0 ≤ X
29 27 28 jca ⊢ X ∈ ℕ 0 → X ∈ ℝ ∧ 0 ≤ X
30 29 3ad2ant3 ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X ∈ ℝ ∧ 0 ≤ X
31 nn0re ⊢ A X rm N ∈ ℕ 0 → A X rm N ∈ ℝ
32 nn0ge0 ⊢ A X rm N ∈ ℕ 0 → 0 ≤ A X rm N
33 31 32 jca ⊢ A X rm N ∈ ℕ 0 → A X rm N ∈ ℝ ∧ 0 ≤ A X rm N
34 9 33 syl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → A X rm N ∈ ℝ ∧ 0 ≤ A X rm N
35 sq11 ⊢ X ∈ ℝ ∧ 0 ≤ X ∧ A X rm N ∈ ℝ ∧ 0 ≤ A X rm N → X 2 = A X rm N 2 ↔ X = A X rm N
36 30 34 35 syl2anc ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X 2 = A X rm N 2 ↔ X = A X rm N
37 23 26 36 3bitr3rd ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X = A X rm N ↔ X 2 − A 2 − 1 ⁢ A Y rm N 2 = 1
38 oveq1 ⊢ y = A Y rm N → y 2 = A Y rm N 2
39 38 oveq2d ⊢ y = A Y rm N → A 2 − 1 ⁢ y 2 = A 2 − 1 ⁢ A Y rm N 2
40 39 oveq2d ⊢ y = A Y rm N → X 2 − A 2 − 1 ⁢ y 2 = X 2 − A 2 − 1 ⁢ A Y rm N 2
41 40 eqeq1d ⊢ y = A Y rm N → X 2 − A 2 − 1 ⁢ y 2 = 1 ↔ X 2 − A 2 − 1 ⁢ A Y rm N 2 = 1
42 41 ceqsrexv ⊢ A Y rm N ∈ ℕ 0 → ∃ y ∈ ℕ 0 y = A Y rm N ∧ X 2 − A 2 − 1 ⁢ y 2 = 1 ↔ X 2 − A 2 − 1 ⁢ A Y rm N 2 = 1
43 18 42 syl ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → ∃ y ∈ ℕ 0 y = A Y rm N ∧ X 2 − A 2 − 1 ⁢ y 2 = 1 ↔ X 2 − A 2 − 1 ⁢ A Y rm N 2 = 1
44 37 43 bitr4d ⊢ A ∈ ℤ ≥ 2 ∧ N ∈ ℕ 0 ∧ X ∈ ℕ 0 → X = A X rm N ↔ ∃ y ∈ ℕ 0 y = A Y rm N ∧ X 2 − A 2 − 1 ⁢ y 2 = 1