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

Theorem pell14qrval 44121
Description: Value of the set of positive Pell solutions. (Contributed by Stefan O'Rear, 17-Sep-2014.)
Assertion
Ref Expression
pell14qrval (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell14QR‘𝐷) = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
Distinct variable group:   𝑦,𝑧,𝑤,𝐷

Proof of Theorem pell14qrval
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6916 . . . . . . . 8 (𝑎 = 𝐷 → (√‘𝑎) = (√‘𝐷))
21oveq1d 7466 . . . . . . 7 (𝑎 = 𝐷 → ((√‘𝑎) · 𝑤) = ((√‘𝐷) · 𝑤))
32oveq2d 7467 . . . . . 6 (𝑎 = 𝐷 → (𝑧 + ((√‘𝑎) · 𝑤)) = (𝑧 + ((√‘𝐷) · 𝑤)))
43eqeq2d 2774 . . . . 5 (𝑎 = 𝐷 → (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ↔ 𝑦 = (𝑧 + ((√‘𝐷) · 𝑤))))
5 oveq1 7458 . . . . . . 7 (𝑎 = 𝐷 → (𝑎 · (𝑤↑2)) = (𝐷 · (𝑤↑2)))
65oveq2d 7467 . . . . . 6 (𝑎 = 𝐷 → ((𝑧↑2) − (𝑎 · (𝑤↑2))) = ((𝑧↑2) − (𝐷 · (𝑤↑2))))
76eqeq1d 2765 . . . . 5 (𝑎 = 𝐷 → (((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1 ↔ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))
84, 7anbi12d 644 . . . 4 (𝑎 = 𝐷 → ((𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
982rexbidv 3231 . . 3 (𝑎 = 𝐷 → (∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
109rabbidv 3423 . 2 (𝑎 = 𝐷 → {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)} = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
11 df-pell14qr 44116 . 2 Pell14QR = (𝑎 ∈ (ℕ ∖ ◻NN) ↦ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)})
12 reex 11330 . . 3 ℝ ∈ V
1312rabex 5307 . 2 {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ∈ V
1410, 11, 13fvmpt 7024 1 (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell14QR‘𝐷) = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416   ∖ cdif 4048  ‘cfv 6566  (class class class)co 7451  ℝcr 11238  1c1 11240   + caddc 11242   · cmul 11244   − cmin 11580  ℕcn 12375  2c2 12437  ℕ0cn0 12646  ℤcz 12733  ↑cexp 14244  √csqrt 15443  ◻NNcsquarenn 44109  Pell14QRcpell14qr 44112
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398  ax-cnex 11295  ax-resscn 11296
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-pell14qr 44116
This theorem is used by:  elpell14qr  44122  rmxyelqirr  44183
  Copyright terms: Public domain W3C validator