Theorem pell1qrval 42167

Description: Value of the set of first-quadrant Pell solutions. (Contributed by Stefan O'Rear, 17-Sep-2014.)

Assertion

Ref	Expression
pell1qrval	⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell1QR‘𝐷) = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})

Distinct variable group:   𝑦,𝑧,𝑤,𝐷

Proof of Theorem pell1qrval

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6885	. . . . . . . 8 ⊢ (𝑎 = 𝐷 → (√‘𝑎) = (√‘𝐷))
2	1	oveq1d 7420	. . . . . . 7 ⊢ (𝑎 = 𝐷 → ((√‘𝑎) · 𝑤) = ((√‘𝐷) · 𝑤))
3	2	oveq2d 7421	. . . . . 6 ⊢ (𝑎 = 𝐷 → (𝑧 + ((√‘𝑎) · 𝑤)) = (𝑧 + ((√‘𝐷) · 𝑤)))
4	3	eqeq2d 2737	. . . . 5 ⊢ (𝑎 = 𝐷 → (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ↔ 𝑦 = (𝑧 + ((√‘𝐷) · 𝑤))))
5		oveq1 7412	. . . . . . 7 ⊢ (𝑎 = 𝐷 → (𝑎 · (𝑤↑2)) = (𝐷 · (𝑤↑2)))
6	5	oveq2d 7421	. . . . . 6 ⊢ (𝑎 = 𝐷 → ((𝑧↑2) − (𝑎 · (𝑤↑2))) = ((𝑧↑2) − (𝐷 · (𝑤↑2))))
7	6	eqeq1d 2728	. . . . 5 ⊢ (𝑎 = 𝐷 → (((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1 ↔ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))
8	4, 7	anbi12d 630	. . . 4 ⊢ (𝑎 = 𝐷 → ((𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
9	8	2rexbidv 3213	. . 3 ⊢ (𝑎 = 𝐷 → (∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
10	9	rabbidv 3434	. 2 ⊢ (𝑎 = 𝐷 → {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)} = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
11		df-pell1qr 42163	. 2 ⊢ Pell1QR = (𝑎 ∈ (ℕ ∖ ◻NN) ↦ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)})
12		reex 11203	. . 3 ⊢ ℝ ∈ V
13	12	rabex 5325	. 2 ⊢ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ∈ V
14	10, 11, 13	fvmpt 6992	1 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell1QR‘𝐷) = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1533   ∈ wcel 2098  ∃wrex 3064  {crab 3426   ∖ cdif 3940  ‘cfv 6537  (class class class)co 7405  ℝcr 11111  1c1 11113   + caddc 11115   · cmul 11117   − cmin 11448  ℕcn 12216  2c2 12271  ℕ₀cn0 12476  ↑cexp 14032  √csqrt 15186  ◻_NNcsquarenn 42157  Pell1QRcpell1qr 42158

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420  ax-cnex 11168  ax-resscn 11169

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-iota 6489  df-fun 6539  df-fv 6545  df-ov 7408  df-pell1qr 42163

This theorem is referenced by:  elpell1qr  42168