Theorem pell1qrval 43601

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 6881	. . . . . . . 8 ⊢ (𝑎 = 𝐷 → (√‘𝑎) = (√‘𝐷))
2	1	oveq1d 7425	. . . . . . 7 ⊢ (𝑎 = 𝐷 → ((√‘𝑎) · 𝑤) = ((√‘𝐷) · 𝑤))
3	2	oveq2d 7426	. . . . . 6 ⊢ (𝑎 = 𝐷 → (𝑧 + ((√‘𝑎) · 𝑤)) = (𝑧 + ((√‘𝐷) · 𝑤)))
4	3	eqeq2d 2774	. . . . 5 ⊢ (𝑎 = 𝐷 → (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ↔ 𝑦 = (𝑧 + ((√‘𝐷) · 𝑤))))
5		oveq1 7417	. . . . . . 7 ⊢ (𝑎 = 𝐷 → (𝑎 · (𝑤↑2)) = (𝐷 · (𝑤↑2)))
6	5	oveq2d 7426	. . . . . 6 ⊢ (𝑎 = 𝐷 → ((𝑧↑2) − (𝑎 · (𝑤↑2))) = ((𝑧↑2) − (𝐷 · (𝑤↑2))))
7	6	eqeq1d 2765	. . . . 5 ⊢ (𝑎 = 𝐷 → (((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1 ↔ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1))
8	4, 7	anbi12d 643	. . . 4 ⊢ (𝑎 = 𝐷 → ((𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
9	8	2rexbidv 3230	. . 3 ⊢ (𝑎 = 𝐷 → (∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1) ↔ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)))
10	9	rabbidv 3423	. 2 ⊢ (𝑎 = 𝐷 → {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)} = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})
11		df-pell1qr 43597	. 2 ⊢ Pell1QR = (𝑎 ∈ (ℕ ∖ ◻NN) ↦ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝑎) · 𝑤)) ∧ ((𝑧↑2) − (𝑎 · (𝑤↑2))) = 1)})
12		reex 11195	. . 3 ⊢ ℝ ∈ V
13	12	rabex 5309	. 2 ⊢ {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)} ∈ V
14	10, 11, 13	fvmpt 6989	1 ⊢ (𝐷 ∈ (ℕ ∖ ◻NN) → (Pell1QR‘𝐷) = {𝑦 ∈ ℝ ∣ ∃𝑧 ∈ ℕ0 ∃𝑤 ∈ ℕ0 (𝑦 = (𝑧 + ((√‘𝐷) · 𝑤)) ∧ ((𝑧↑2) − (𝐷 · (𝑤↑2))) = 1)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  {crab 3416   ∖ cdif 3902  ‘cfv 6536  (class class class)co 7410  ℝcr 11103  1c1 11105   + caddc 11107   · cmul 11109   − cmin 11445  ℕcn 12237  2c2 12299  ℕ₀cn0 12508  ↑cexp 14102  √csqrt 15289  ◻_NNcsquarenn 43591  Pell1QRcpell1qr 43592

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404  ax-cnex 11160  ax-resscn 11161

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  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 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  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-pell1qr 43597

This theorem is used by:  elpell1qr  43602