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 43546
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 43545 . . 3 (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell14QR‘𝐷) = {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
21eleq2d 2847 . 2 (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐴 ∈ (Pell14QR‘𝐷) ↔ 𝐴 ∈ {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)}))
3 eqeq1 2765 . . . . 5 (𝑎 = 𝐴 → (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ↔ 𝐴 = (𝑧 + ((√‘𝐷) · 𝑤))))
43anbi1d 642 . . . 4 (𝑎 = 𝐴 → ((𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1) ↔ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
542rexbidv 3228 . . 3 (𝑎 = 𝐴 → (∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
65elrab 3649 . 2 (𝐴 ∈ {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ↔ (𝐴 ∈ ℝ ∧ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
72, 6bitrdi 290 1 (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐴 ∈ (Pell14QR‘𝐷) ↔ (𝐴 ∈ ℝ ∧ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1568  wcel 2141  wrex 3087  {crab 3414  cdif 3901  cfv 6536  (class class class)co 7410  cr 11098  1c1 11100   + caddc 11102   · cmul 11104  cmin 11440  cn 12232  2c2 12294  0cn0 12503  cz 12590  cexp 14096  csqrt 15283  NNcsquarenn 43533  Pell14QRcpell14qr 43536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-pr 5404  ax-cnex 11155  ax-resscn 11156
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7413  df-pell14qr 43540
This theorem is referenced by:  pell14qrss1234  43553  pell14qrgt0  43556  pell1234qrdich  43558  pell1qrss14  43565  pell14qrdich  43566  rmxycomplete  43614
  Copyright terms: Public domain W3C validator