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

Theorem elpell14qr 43280
Description: Membership in the set of positive Pell solutions. (Contributed by Stefan O'Rear, 17-Sep-2014.)
Assertion
Ref Expression
elpell14qr (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐴 ∈ (Pell14QR‘𝐷) ↔ (𝐴 ∈ ℝ ∧ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))))
Distinct variable groups:   𝑧,𝑤,𝐷   𝑧,𝐴,𝑤

Proof of Theorem elpell14qr
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 pell14qrval 43279 . . 3 (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell14QR‘𝐷) = {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
21eleq2d 2823 . 2 (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐴 ∈ (Pell14QR‘𝐷) ↔ 𝐴 ∈ {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)}))
3 eqeq1 2741 . . . . 5 (𝑎 = 𝐴 → (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ↔ 𝐴 = (𝑧 + ((√‘𝐷) · 𝑤))))
43anbi1d 632 . . . 4 (𝑎 = 𝐴 → ((𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1) ↔ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
542rexbidv 3203 . . 3 (𝑎 = 𝐴 → (∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
65elrab 3635 . 2 (𝐴 ∈ {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ↔ (𝐴 ∈ ℝ ∧ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
72, 6bitrdi 287 1 (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐴 ∈ (Pell14QR‘𝐷) ↔ (𝐴 ∈ ℝ ∧ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3062  {crab 3390  cdif 3887  cfv 6490  (class class class)co 7358  cr 11026  1c1 11028   + caddc 11030   · cmul 11032  cmin 11365  cn 12146  2c2 12201  0cn0 12402  cz 12489  cexp 13985  csqrt 15157  NNcsquarenn 43267  Pell14QRcpell14qr 43270
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-pr 5368  ax-cnex 11083  ax-resscn 11084
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-ov 7361  df-pell14qr 43274
This theorem is referenced by:  pell14qrss1234  43287  pell14qrgt0  43290  pell1234qrdich  43292  pell1qrss14  43299  pell14qrdich  43300  rmxycomplete  43348
  Copyright terms: Public domain W3C validator