Theorem pell14qrval 43633

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.

Step	Hyp	Ref	Expression
1		fveq2 6885	. . . . . . . 8 ⊢ (𝑎 = 𝐷 → (√‘𝑎) = (√‘𝐷))
2	1	oveq1d 7434	. . . . . . 7 ⊢ (𝑎 = 𝐷 → ((√‘𝑎) · 𝑤) = ((√‘𝐷) · 𝑤))
3	2	oveq2d 7435	. . . . . 6 ⊢ (𝑎 = 𝐷 → (𝑧 + ((√‘𝑎) · 𝑤)) = (𝑧 + ((√‘𝐷) · 𝑤)))
4	3	eqeq2d 2776	. . . . 5 ⊢ (𝑎 = 𝐷 → (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ↔ 𝑦 = (𝑧 + ((√‘𝐷) · 𝑤))))
5		oveq1 7426	. . . . . . 7 ⊢ (𝑎 = 𝐷 → (𝑎 · (𝑤↑2)) = (𝐷 · (𝑤↑2)))
6	5	oveq2d 7435	. . . . . 6 ⊢ (𝑎 = 𝐷 → ((𝑧↑2) − (𝑎 · (𝑤↑2))) = ((𝑧↑2) − (𝐷 · (𝑤↑2))))
7	6	eqeq1d 2767	. . . . 5 ⊢ (𝑎 = 𝐷 → (((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1 ↔ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))
8	4, 7	anbi12d 644	. . . 4 ⊢ (𝑎 = 𝐷 → ((𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
9	8	2rexbidv 3232	. . 3 ⊢ (𝑎 = 𝐷 → (∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
10	9	rabbidv 3425	. 2 ⊢ (𝑎 = 𝐷 → {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)} = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
11		df-pell14qr 43628	. 2 ⊢ Pell14QR = (𝑎 ∈ (ℕ ∖ ◻NN) ↦ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)})
12		reex 11206	. . 3 ⊢ ℝ ∈ V
13	12	rabex 5311	. 2 ⊢ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ∈ V
14	10, 11, 13	fvmpt 6993	1 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell14QR‘𝐷) = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃wrex 3091  {crab 3418   ∖ cdif 3903  ‘cfv 6540  (class class class)co 7419  ℝcr 11114  1c1 11116   + caddc 11118   · cmul 11120   − cmin 11456  ℕcn 12248  2c2 12310  ℕ₀cn0 12519  ℤcz 12606  ↑cexp 14115  √csqrt 15308  ◻_NNcsquarenn 43621  Pell14QRcpell14qr 43624

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406  ax-cnex 11171  ax-resscn 11172

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-pell14qr 43628

This theorem is used by:  elpell14qr  43634  rmxyelqirr  43695