Mathbox for Stefan O'Rear < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rmyfval Structured version   Visualization version   GIF version

Theorem rmyfval 36487
 Description: Value of the Y sequence. Not used after rmxyval 36498 is proved. (Contributed by Stefan O'Rear, 21-Sep-2014.)
Assertion
Ref Expression
rmyfval ((𝐴 ∈ (ℤ‘2) ∧ 𝑁 ∈ ℤ) → (𝐴 Yrm 𝑁) = (2nd ‘((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘((𝐴 + (√‘((𝐴↑2) − 1)))↑𝑁))))
Distinct variable groups:   𝐴,𝑏   𝑁,𝑏

Proof of Theorem rmyfval
Dummy variables 𝑛 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 6556 . . . . . . . . . . 11 (𝑎 = 𝐴 → (𝑎↑2) = (𝐴↑2))
21oveq1d 6564 . . . . . . . . . 10 (𝑎 = 𝐴 → ((𝑎↑2) − 1) = ((𝐴↑2) − 1))
32fveq2d 6107 . . . . . . . . 9 (𝑎 = 𝐴 → (√‘((𝑎↑2) − 1)) = (√‘((𝐴↑2) − 1)))
43oveq1d 6564 . . . . . . . 8 (𝑎 = 𝐴 → ((√‘((𝑎↑2) − 1)) · (2nd𝑏)) = ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))
54oveq2d 6565 . . . . . . 7 (𝑎 = 𝐴 → ((1st𝑏) + ((√‘((𝑎↑2) − 1)) · (2nd𝑏))) = ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))
65mpteq2dv 4673 . . . . . 6 (𝑎 = 𝐴 → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝑎↑2) − 1)) · (2nd𝑏)))) = (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))))
76cnveqd 5220 . . . . 5 (𝑎 = 𝐴(𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝑎↑2) − 1)) · (2nd𝑏)))) = (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))))
87adantr 480 . . . 4 ((𝑎 = 𝐴𝑛 = 𝑁) → (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝑎↑2) − 1)) · (2nd𝑏)))) = (𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏)))))
9 id 22 . . . . . 6 (𝑎 = 𝐴𝑎 = 𝐴)
109, 3oveq12d 6567 . . . . 5 (𝑎 = 𝐴 → (𝑎 + (√‘((𝑎↑2) − 1))) = (𝐴 + (√‘((𝐴↑2) − 1))))
11 id 22 . . . . 5 (𝑛 = 𝑁𝑛 = 𝑁)
1210, 11oveqan12d 6568 . . . 4 ((𝑎 = 𝐴𝑛 = 𝑁) → ((𝑎 + (√‘((𝑎↑2) − 1)))↑𝑛) = ((𝐴 + (√‘((𝐴↑2) − 1)))↑𝑁))
138, 12fveq12d 6109 . . 3 ((𝑎 = 𝐴𝑛 = 𝑁) → ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝑎↑2) − 1)) · (2nd𝑏))))‘((𝑎 + (√‘((𝑎↑2) − 1)))↑𝑛)) = ((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘((𝐴 + (√‘((𝐴↑2) − 1)))↑𝑁)))
1413fveq2d 6107 . 2 ((𝑎 = 𝐴𝑛 = 𝑁) → (2nd ‘((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝑎↑2) − 1)) · (2nd𝑏))))‘((𝑎 + (√‘((𝑎↑2) − 1)))↑𝑛))) = (2nd ‘((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘((𝐴 + (√‘((𝐴↑2) − 1)))↑𝑁))))
15 df-rmy 36485 . 2 Yrm = (𝑎 ∈ (ℤ‘2), 𝑛 ∈ ℤ ↦ (2nd ‘((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝑎↑2) − 1)) · (2nd𝑏))))‘((𝑎 + (√‘((𝑎↑2) − 1)))↑𝑛))))
16 fvex 6113 . 2 (2nd ‘((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘((𝐴 + (√‘((𝐴↑2) − 1)))↑𝑁))) ∈ V
1714, 15, 16ovmpt2a 6689 1 ((𝐴 ∈ (ℤ‘2) ∧ 𝑁 ∈ ℤ) → (𝐴 Yrm 𝑁) = (2nd ‘((𝑏 ∈ (ℕ0 × ℤ) ↦ ((1st𝑏) + ((√‘((𝐴↑2) − 1)) · (2nd𝑏))))‘((𝐴 + (√‘((𝐴↑2) − 1)))↑𝑁))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ↦ cmpt 4643   × cxp 5036  ◡ccnv 5037  ‘cfv 5804  (class class class)co 6549  1st c1st 7057  2nd c2nd 7058  1c1 9816   + caddc 9818   · cmul 9820   − cmin 10145  2c2 10947  ℕ0cn0 11169  ℤcz 11254  ℤ≥cuz 11563  ↑cexp 12722  √csqrt 13821   Yrm crmy 36483 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-rmy 36485 This theorem is referenced by:  rmxyval  36498
 Copyright terms: Public domain W3C validator