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 39439
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 39438 . . 3 (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell14QR‘𝐷) = {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
21eleq2d 2898 . 2 (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐴 ∈ (Pell14QR‘𝐷) ↔ 𝐴 ∈ {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)}))
3 eqeq1 2825 . . . . 5 (𝑎 = 𝐴 → (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ↔ 𝐴 = (𝑧 + ((√‘𝐷) · 𝑤))))
43anbi1d 631 . . . 4 (𝑎 = 𝐴 → ((𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1) ↔ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
542rexbidv 3300 . . 3 (𝑎 = 𝐴 → (∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
65elrab 3679 . 2 (𝐴 ∈ {𝑎 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝑎 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ↔ (𝐴 ∈ ℝ ∧ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
72, 6syl6bb 289 1 (𝐷 ∈ (ℕ ∖ ◻NN) → (𝐴 ∈ (Pell14QR‘𝐷) ↔ (𝐴 ∈ ℝ ∧ ∃𝑧 ∈ ℕ0𝑤 ∈ ℤ (𝐴 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wcel 2110  wrex 3139  {crab 3142  cdif 3932  cfv 6349  (class class class)co 7150  cr 10530  1c1 10532   + caddc 10534   · cmul 10536  cmin 10864  cn 11632  2c2 11686  0cn0 11891  cz 11975  cexp 13423  csqrt 14586  NNcsquarenn 39426  Pell14QRcpell14qr 39429
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321  ax-cnex 10587  ax-resscn 10588
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-iota 6308  df-fun 6351  df-fv 6357  df-ov 7153  df-pell14qr 39433
This theorem is referenced by:  pell14qrss1234  39446  pell14qrgt0  39449  pell1234qrdich  39451  pell1qrss14  39458  pell14qrdich  39459  rmxycomplete  39507
  Copyright terms: Public domain W3C validator