Metamath Proof Explorer


Theorem rmxypairf1o

Description: The function used to extract rational and irrational parts in df-rmx and df-rmy in fact achieves a one-to-one mapping from the quadratic irrationals to pairs of integers. (Contributed by Stefan O'Rear, 21-Sep-2014)

Ref Expression
Assertion rmxypairf1o ⊢ A ∈ ℤ ≥ 2 → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b : ℕ 0 × ℤ ⟶ 1-1 onto a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d

Proof

Step Hyp Ref Expression
1 ovex ⊢ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ∈ V
2 eqid ⊢ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b = b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b
3 1 2 fnmpti ⊢ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b Fn ℕ 0 × ℤ
4 3 a1i ⊢ A ∈ ℤ ≥ 2 → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b Fn ℕ 0 × ℤ
5 2 rnmpt ⊢ ran ⁡ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b = a | ∃ b ∈ ℕ 0 × ℤ a = 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b
6 vex ⊢ c ∈ V
7 vex ⊢ d ∈ V
8 6 7 op1std ⊢ b = c d → 1 st ⁡ b = c
9 6 7 op2ndd ⊢ b = c d → 2 nd ⁡ b = d
10 9 oveq2d ⊢ b = c d → A 2 − 1 ⁢ 2 nd ⁡ b = A 2 − 1 ⁢ d
11 8 10 oveq12d ⊢ b = c d → 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b = c + A 2 − 1 ⁢ d
12 11 eqeq2d ⊢ b = c d → a = 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ↔ a = c + A 2 − 1 ⁢ d
13 12 rexxp ⊢ ∃ b ∈ ℕ 0 × ℤ a = 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ↔ ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d
14 13 bicomi ⊢ ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ↔ ∃ b ∈ ℕ 0 × ℤ a = 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b
15 14 a1i ⊢ A ∈ ℤ ≥ 2 → ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ↔ ∃ b ∈ ℕ 0 × ℤ a = 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b
16 15 abbidv ⊢ A ∈ ℤ ≥ 2 → a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d = a | ∃ b ∈ ℕ 0 × ℤ a = 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b
17 5 16 eqtr4id ⊢ A ∈ ℤ ≥ 2 → ran ⁡ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b = a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d
18 fveq2 ⊢ b = c → 1 st ⁡ b = 1 st ⁡ c
19 fveq2 ⊢ b = c → 2 nd ⁡ b = 2 nd ⁡ c
20 19 oveq2d ⊢ b = c → A 2 − 1 ⁢ 2 nd ⁡ b = A 2 − 1 ⁢ 2 nd ⁡ c
21 18 20 oveq12d ⊢ b = c → 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b = 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c
22 ovex ⊢ 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c ∈ V
23 21 2 22 fvmpt ⊢ c ∈ ℕ 0 × ℤ → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ c = 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c
24 23 ad2antrl ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ c = 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c
25 fveq2 ⊢ b = d → 1 st ⁡ b = 1 st ⁡ d
26 fveq2 ⊢ b = d → 2 nd ⁡ b = 2 nd ⁡ d
27 26 oveq2d ⊢ b = d → A 2 − 1 ⁢ 2 nd ⁡ b = A 2 − 1 ⁢ 2 nd ⁡ d
28 25 27 oveq12d ⊢ b = d → 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d
29 ovex ⊢ 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d ∈ V
30 28 2 29 fvmpt ⊢ d ∈ ℕ 0 × ℤ → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ d = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d
31 30 ad2antll ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ d = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d
32 24 31 eqeq12d ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ c = b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ d ↔ 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d
33 rmspecsqrtnq ⊢ A ∈ ℤ ≥ 2 → A 2 − 1 ∈ ℂ ∖ ℚ
34 33 adantr ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → A 2 − 1 ∈ ℂ ∖ ℚ
35 nn0ssq ⊢ ℕ 0 ⊆ ℚ
36 xp1st ⊢ c ∈ ℕ 0 × ℤ → 1 st ⁡ c ∈ ℕ 0
37 36 ad2antrl ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ c ∈ ℕ 0
38 35 37 sselid ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ c ∈ ℚ
39 xp2nd ⊢ c ∈ ℕ 0 × ℤ → 2 nd ⁡ c ∈ ℤ
40 39 ad2antrl ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 2 nd ⁡ c ∈ ℤ
41 zq ⊢ 2 nd ⁡ c ∈ ℤ → 2 nd ⁡ c ∈ ℚ
42 40 41 syl ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 2 nd ⁡ c ∈ ℚ
43 xp1st ⊢ d ∈ ℕ 0 × ℤ → 1 st ⁡ d ∈ ℕ 0
44 43 ad2antll ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ d ∈ ℕ 0
45 35 44 sselid ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ d ∈ ℚ
46 xp2nd ⊢ d ∈ ℕ 0 × ℤ → 2 nd ⁡ d ∈ ℤ
47 46 ad2antll ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 2 nd ⁡ d ∈ ℤ
48 zq ⊢ 2 nd ⁡ d ∈ ℤ → 2 nd ⁡ d ∈ ℚ
49 47 48 syl ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 2 nd ⁡ d ∈ ℚ
50 qirropth ⊢ A 2 − 1 ∈ ℂ ∖ ℚ ∧ 1 st ⁡ c ∈ ℚ ∧ 2 nd ⁡ c ∈ ℚ ∧ 1 st ⁡ d ∈ ℚ ∧ 2 nd ⁡ d ∈ ℚ → 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d ↔ 1 st ⁡ c = 1 st ⁡ d ∧ 2 nd ⁡ c = 2 nd ⁡ d
51 34 38 42 45 49 50 syl122anc ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d ↔ 1 st ⁡ c = 1 st ⁡ d ∧ 2 nd ⁡ c = 2 nd ⁡ d
52 51 biimpd ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d → 1 st ⁡ c = 1 st ⁡ d ∧ 2 nd ⁡ c = 2 nd ⁡ d
53 xpopth ⊢ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ c = 1 st ⁡ d ∧ 2 nd ⁡ c = 2 nd ⁡ d ↔ c = d
54 53 adantl ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ c = 1 st ⁡ d ∧ 2 nd ⁡ c = 2 nd ⁡ d ↔ c = d
55 52 54 sylibd ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → 1 st ⁡ c + A 2 − 1 ⁢ 2 nd ⁡ c = 1 st ⁡ d + A 2 − 1 ⁢ 2 nd ⁡ d → c = d
56 32 55 sylbid ⊢ A ∈ ℤ ≥ 2 ∧ c ∈ ℕ 0 × ℤ ∧ d ∈ ℕ 0 × ℤ → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ c = b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ d → c = d
57 56 ralrimivva ⊢ A ∈ ℤ ≥ 2 → ∀ c ∈ ℕ 0 × ℤ ∀ d ∈ ℕ 0 × ℤ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ c = b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ d → c = d
58 dff1o6 ⊢ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b : ℕ 0 × ℤ ⟶ 1-1 onto a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ↔ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b Fn ℕ 0 × ℤ ∧ ran ⁡ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b = a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d ∧ ∀ c ∈ ℕ 0 × ℤ ∀ d ∈ ℕ 0 × ℤ b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ c = b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b ⁡ d → c = d
59 4 17 57 58 syl3anbrc ⊢ A ∈ ℤ ≥ 2 → b ∈ ℕ 0 × ℤ ⟼ 1 st ⁡ b + A 2 − 1 ⁢ 2 nd ⁡ b : ℕ 0 × ℤ ⟶ 1-1 onto a | ∃ c ∈ ℕ 0 ∃ d ∈ ℤ a = c + A 2 − 1 ⁢ d