Theorem pell14qrval 43995

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 6893	. . . . . . . 8 ⊢ (𝑎 = 𝐷 → (√‘𝑎) = (√‘𝐷))
2	1	oveq1d 7442	. . . . . . 7 ⊢ (𝑎 = 𝐷 → ((√‘𝑎) · 𝑤) = ((√‘𝐷) · 𝑤))
3	2	oveq2d 7443	. . . . . 6 ⊢ (𝑎 = 𝐷 → (𝑧 + ((√‘𝑎) · 𝑤)) = (𝑧 + ((√‘𝐷) · 𝑤)))
4	3	eqeq2d 2774	. . . . 5 ⊢ (𝑎 = 𝐷 → (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ↔ 𝑦 = (𝑧 + ((√‘𝐷) · 𝑤))))
5		oveq1 7434	. . . . . . 7 ⊢ (𝑎 = 𝐷 → (𝑎 · (𝑤↑2)) = (𝐷 · (𝑤↑2)))
6	5	oveq2d 7443	. . . . . 6 ⊢ (𝑎 = 𝐷 → ((𝑧↑2) − (𝑎 · (𝑤↑2))) = ((𝑧↑2) − (𝐷 · (𝑤↑2))))
7	6	eqeq1d 2765	. . . . 5 ⊢ (𝑎 = 𝐷 → (((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1 ↔ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))
8	4, 7	anbi12d 644	. . . 4 ⊢ (𝑎 = 𝐷 → ((𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
9	8	2rexbidv 3230	. . 3 ⊢ (𝑎 = 𝐷 → (∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
10	9	rabbidv 3422	. 2 ⊢ (𝑎 = 𝐷 → {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)} = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
11		df-pell14qr 43990	. 2 ⊢ Pell14QR = (𝑎 ∈ (ℕ ∖ ◻NN) ↦ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)})
12		reex 11301	. . 3 ⊢ ℝ ∈ V
13	12	rabex 5303	. 2 ⊢ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ∈ V
14	10, 11, 13	fvmpt 7001	1 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell14QR‘𝐷) = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℤ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∃wrex 3089  {crab 3415   ∖ cdif 4047  ‘cfv 6546  (class class class)co 7427  ℝcr 11209  1c1 11211   + caddc 11213   · cmul 11215   − cmin 11551  ℕcn 12345  2c2 12407  ℕ₀cn0 12616  ℤcz 12703  ↑cexp 14214  √csqrt 15412  ◻_NNcsquarenn 43983  Pell14QRcpell14qr 43986

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394  ax-cnex 11266  ax-resscn 11267

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-iota 6500  df-fun 6548  df-fv 6554  df-ov 7430  df-pell14qr 43990

This theorem is used by:  elpell14qr  43996  rmxyelqirr  44057