Mathbox for Stefan O'Rear < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rmxypairf1o Structured version   Visualization version   GIF version

Theorem rmxypairf1o 39895
 Description: The function used to extract rational and irrational parts in df-rmx 39886 and df-rmy 39887 in fact achieves a one-to-one mapping from the quadratic irrationals to pairs of integers. (Contributed by Stefan O'Rear, 21-Sep-2014.)
Assertion
Ref Expression
rmxypairf1o (𝐴 ∈ (ℤ‘2) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))):(ℕ0 × ℤ)–1-1-onto→{𝑎 ∣ ∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))})
Distinct variable group:   𝑏,𝑐,𝑑,𝑎,𝐴

Proof of Theorem rmxypairf1o
StepHypRef Expression
1 ovex 7169 . . . 4 ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))) ∈ V
2 eqid 2798 . . . 4 (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))) = (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))
31, 2fnmpti 6464 . . 3 (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))) Fn (ℕ0 × ℤ)
43a1i 11 . 2 (𝐴 ∈ (ℤ‘2) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))) Fn (ℕ0 × ℤ))
52rnmpt 5792 . . 3 ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))) = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))}
6 vex 3444 . . . . . . . . . 10 𝑐 ∈ V
7 vex 3444 . . . . . . . . . 10 𝑑 ∈ V
86, 7op1std 7684 . . . . . . . . 9 (𝑏 = ⟨𝑐, 𝑑⟩ → (1st𝑏) = 𝑐)
96, 7op2ndd 7685 . . . . . . . . . 10 (𝑏 = ⟨𝑐, 𝑑⟩ → (2nd𝑏) = 𝑑)
109oveq2d 7152 . . . . . . . . 9 (𝑏 = ⟨𝑐, 𝑑⟩ → ((√‘((𝐴↑2) − 1)) · (2nd𝑏)) = ((√‘((𝐴↑2) − 1)) · 𝑑))
118, 10oveq12d 7154 . . . . . . . 8 (𝑏 = ⟨𝑐, 𝑑⟩ → ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))) = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)))
1211eqeq2d 2809 . . . . . . 7 (𝑏 = ⟨𝑐, 𝑑⟩ → (𝑎 = ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))) ↔ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))))
1312rexxp 5678 . . . . . 6 (∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))) ↔ ∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)))
1413bicomi 227 . . . . 5 (∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)) ↔ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))
1514a1i 11 . . . 4 (𝐴 ∈ (ℤ‘2) → (∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑)) ↔ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))))
1615abbidv 2862 . . 3 (𝐴 ∈ (ℤ‘2) → {𝑎 ∣ ∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))} = {𝑎 ∣ ∃𝑏 ∈ (ℕ0 × ℤ)𝑎 = ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))})
175, 16eqtr4id 2852 . 2 (𝐴 ∈ (ℤ‘2) → ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))) = {𝑎 ∣ ∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))})
18 fveq2 6646 . . . . . . . 8 (𝑏 = 𝑐 → (1st𝑏) = (1st𝑐))
19 fveq2 6646 . . . . . . . . 9 (𝑏 = 𝑐 → (2nd𝑏) = (2nd𝑐))
2019oveq2d 7152 . . . . . . . 8 (𝑏 = 𝑐 → ((√‘((𝐴↑2) − 1)) · (2nd𝑏)) = ((√‘((𝐴↑2) − 1)) · (2nd𝑐)))
2118, 20oveq12d 7154 . . . . . . 7 (𝑏 = 𝑐 → ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))) = ((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))))
22 ovex 7169 . . . . . . 7 ((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))) ∈ V
2321, 2, 22fvmpt 6746 . . . . . 6 (𝑐 ∈ (ℕ0 × ℤ) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑐) = ((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))))
2423ad2antrl 727 . . . . 5 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑐) = ((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))))
25 fveq2 6646 . . . . . . . 8 (𝑏 = 𝑑 → (1st𝑏) = (1st𝑑))
26 fveq2 6646 . . . . . . . . 9 (𝑏 = 𝑑 → (2nd𝑏) = (2nd𝑑))
2726oveq2d 7152 . . . . . . . 8 (𝑏 = 𝑑 → ((√‘((𝐴↑2) − 1)) · (2nd𝑏)) = ((√‘((𝐴↑2) − 1)) · (2nd𝑑)))
2825, 27oveq12d 7154 . . . . . . 7 (𝑏 = 𝑑 → ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))))
29 ovex 7169 . . . . . . 7 ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))) ∈ V
3028, 2, 29fvmpt 6746 . . . . . 6 (𝑑 ∈ (ℕ0 × ℤ) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑑) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))))
3130ad2antll 728 . . . . 5 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑑) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))))
3224, 31eqeq12d 2814 . . . 4 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑑) ↔ ((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑)))))
33 rmspecsqrtnq 39890 . . . . . . . 8 (𝐴 ∈ (ℤ‘2) → (√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ))
3433adantr 484 . . . . . . 7 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ))
35 nn0ssq 12347 . . . . . . . 8 0 ⊆ ℚ
36 xp1st 7706 . . . . . . . . 9 (𝑐 ∈ (ℕ0 × ℤ) → (1st𝑐) ∈ ℕ0)
3736ad2antrl 727 . . . . . . . 8 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st𝑐) ∈ ℕ0)
3835, 37sseldi 3913 . . . . . . 7 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st𝑐) ∈ ℚ)
39 xp2nd 7707 . . . . . . . . 9 (𝑐 ∈ (ℕ0 × ℤ) → (2nd𝑐) ∈ ℤ)
4039ad2antrl 727 . . . . . . . 8 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd𝑐) ∈ ℤ)
41 zq 12345 . . . . . . . 8 ((2nd𝑐) ∈ ℤ → (2nd𝑐) ∈ ℚ)
4240, 41syl 17 . . . . . . 7 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd𝑐) ∈ ℚ)
43 xp1st 7706 . . . . . . . . 9 (𝑑 ∈ (ℕ0 × ℤ) → (1st𝑑) ∈ ℕ0)
4443ad2antll 728 . . . . . . . 8 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st𝑑) ∈ ℕ0)
4535, 44sseldi 3913 . . . . . . 7 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (1st𝑑) ∈ ℚ)
46 xp2nd 7707 . . . . . . . . 9 (𝑑 ∈ (ℕ0 × ℤ) → (2nd𝑑) ∈ ℤ)
4746ad2antll 728 . . . . . . . 8 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd𝑑) ∈ ℤ)
48 zq 12345 . . . . . . . 8 ((2nd𝑑) ∈ ℤ → (2nd𝑑) ∈ ℚ)
4947, 48syl 17 . . . . . . 7 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (2nd𝑑) ∈ ℚ)
50 qirropth 39892 . . . . . . 7 (((√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ) ∧ ((1st𝑐) ∈ ℚ ∧ (2nd𝑐) ∈ ℚ) ∧ ((1st𝑑) ∈ ℚ ∧ (2nd𝑑) ∈ ℚ)) → (((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))) ↔ ((1st𝑐) = (1st𝑑) ∧ (2nd𝑐) = (2nd𝑑))))
5134, 38, 42, 45, 49, 50syl122anc 1376 . . . . . 6 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))) ↔ ((1st𝑐) = (1st𝑑) ∧ (2nd𝑐) = (2nd𝑑))))
5251biimpd 232 . . . . 5 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))) → ((1st𝑐) = (1st𝑑) ∧ (2nd𝑐) = (2nd𝑑))))
53 xpopth 7715 . . . . . 6 ((𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ)) → (((1st𝑐) = (1st𝑑) ∧ (2nd𝑐) = (2nd𝑑)) ↔ 𝑐 = 𝑑))
5453adantl 485 . . . . 5 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st𝑐) = (1st𝑑) ∧ (2nd𝑐) = (2nd𝑑)) ↔ 𝑐 = 𝑑))
5552, 54sylibd 242 . . . 4 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((1st𝑐) + ((√‘((𝐴↑2) − 1)) · (2nd𝑐))) = ((1st𝑑) + ((√‘((𝐴↑2) − 1)) · (2nd𝑑))) → 𝑐 = 𝑑))
5632, 55sylbid 243 . . 3 ((𝐴 ∈ (ℤ‘2) ∧ (𝑐 ∈ (ℕ0 × ℤ) ∧ 𝑑 ∈ (ℕ0 × ℤ))) → (((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑑) → 𝑐 = 𝑑))
5756ralrimivva 3156 . 2 (𝐴 ∈ (ℤ‘2) → ∀𝑐 ∈ (ℕ0 × ℤ)∀𝑑 ∈ (ℕ0 × ℤ)(((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑑) → 𝑐 = 𝑑))
58 dff1o6 7011 . 2 ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))):(ℕ0 × ℤ)–1-1-onto→{𝑎 ∣ ∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))} ↔ ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))) Fn (ℕ0 × ℤ) ∧ ran (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))) = {𝑎 ∣ ∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))} ∧ ∀𝑐 ∈ (ℕ0 × ℤ)∀𝑑 ∈ (ℕ0 × ℤ)(((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑐) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘𝑑) → 𝑐 = 𝑑)))
594, 17, 57, 58syl3anbrc 1340 1 (𝐴 ∈ (ℤ‘2) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))):(ℕ0 × ℤ)–1-1-onto→{𝑎 ∣ ∃𝑐 ∈ ℕ0𝑑 ∈ ℤ 𝑎 = (𝑐 + ((√‘((𝐴↑2) − 1)) · 𝑑))})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  {cab 2776  ∀wral 3106  ∃wrex 3107   ∖ cdif 3878  ⟨cop 4531   ↦ cmpt 5111   × cxp 5518  ran crn 5521   Fn wfn 6320  –1-1-onto→wf1o 6324  ‘cfv 6325  (class class class)co 7136  1st c1st 7672  2nd c2nd 7673  ℂcc 10527  1c1 10530   + caddc 10532   · cmul 10534   − cmin 10862  2c2 11683  ℕ0cn0 11888  ℤcz 11972  ℤ≥cuz 12234  ℚcq 12339  ↑cexp 13428  √csqrt 14587 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5168  ax-nul 5175  ax-pow 5232  ax-pr 5296  ax-un 7444  ax-cnex 10585  ax-resscn 10586  ax-1cn 10587  ax-icn 10588  ax-addcl 10589  ax-addrcl 10590  ax-mulcl 10591  ax-mulrcl 10592  ax-mulcom 10593  ax-addass 10594  ax-mulass 10595  ax-distr 10596  ax-i2m1 10597  ax-1ne0 10598  ax-1rid 10599  ax-rnegex 10600  ax-rrecex 10601  ax-cnre 10602  ax-pre-lttri 10603  ax-pre-lttrn 10604  ax-pre-ltadd 10605  ax-pre-mulgt0 10606  ax-pre-sup 10607 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4802  df-iun 4884  df-br 5032  df-opab 5094  df-mpt 5112  df-tr 5138  df-id 5426  df-eprel 5431  df-po 5439  df-so 5440  df-fr 5479  df-we 5481  df-xp 5526  df-rel 5527  df-cnv 5528  df-co 5529  df-dm 5530  df-rn 5531  df-res 5532  df-ima 5533  df-pred 6117  df-ord 6163  df-on 6164  df-lim 6165  df-suc 6166  df-iota 6284  df-fun 6327  df-fn 6328  df-f 6329  df-f1 6330  df-fo 6331  df-f1o 6332  df-fv 6333  df-riota 7094  df-ov 7139  df-oprab 7140  df-mpo 7141  df-om 7564  df-1st 7674  df-2nd 7675  df-wrecs 7933  df-recs 7994  df-rdg 8032  df-er 8275  df-en 8496  df-dom 8497  df-sdom 8498  df-sup 8893  df-inf 8894  df-pnf 10669  df-mnf 10670  df-xr 10671  df-ltxr 10672  df-le 10673  df-sub 10864  df-neg 10865  df-div 11290  df-nn 11629  df-2 11691  df-3 11692  df-n0 11889  df-z 11973  df-uz 12235  df-q 12340  df-rp 12381  df-fl 13160  df-mod 13236  df-seq 13368  df-exp 13429  df-cj 14453  df-re 14454  df-im 14455  df-sqrt 14589  df-abs 14590  df-dvds 15603  df-gcd 15837  df-numer 16068  df-denom 16069 This theorem is referenced by:  rmxyelxp  39896  rmxyval  39899
 Copyright terms: Public domain W3C validator