Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  oddpwdcv Structured version   Visualization version   GIF version

Theorem oddpwdcv 34532
Description: Lemma for eulerpart 34559: value of the 𝐹 function. (Contributed by Thierry Arnoux, 9-Sep-2017.)
Hypotheses
Ref Expression
oddpwdc.j 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
oddpwdc.f 𝐹 = (𝑥𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
Assertion
Ref Expression
oddpwdcv (𝑊 ∈ (𝐽 × ℕ0) → (𝐹𝑊) = ((2↑(2nd𝑊)) · (1st𝑊)))
Distinct variable groups:   𝑥,𝑦,𝑧   𝑥,𝐽,𝑦   𝑥,𝑊,𝑦
Allowed substitution hints:   𝐹(𝑥,𝑦,𝑧)   𝐽(𝑧)   𝑊(𝑧)

Proof of Theorem oddpwdcv
StepHypRef Expression
1 1st2nd2 7982 . . 3 (𝑊 ∈ (𝐽 × ℕ0) → 𝑊 = ⟨(1st𝑊), (2nd𝑊)⟩)
21fveq2d 6846 . 2 (𝑊 ∈ (𝐽 × ℕ0) → (𝐹𝑊) = (𝐹‘⟨(1st𝑊), (2nd𝑊)⟩))
3 df-ov 7371 . . 3 ((1st𝑊)𝐹(2nd𝑊)) = (𝐹‘⟨(1st𝑊), (2nd𝑊)⟩)
43a1i 11 . 2 (𝑊 ∈ (𝐽 × ℕ0) → ((1st𝑊)𝐹(2nd𝑊)) = (𝐹‘⟨(1st𝑊), (2nd𝑊)⟩))
5 elxp6 7977 . . . 4 (𝑊 ∈ (𝐽 × ℕ0) ↔ (𝑊 = ⟨(1st𝑊), (2nd𝑊)⟩ ∧ ((1st𝑊) ∈ 𝐽 ∧ (2nd𝑊) ∈ ℕ0)))
65simprbi 497 . . 3 (𝑊 ∈ (𝐽 × ℕ0) → ((1st𝑊) ∈ 𝐽 ∧ (2nd𝑊) ∈ ℕ0))
7 oveq2 7376 . . . 4 (𝑥 = (1st𝑊) → ((2↑𝑦) · 𝑥) = ((2↑𝑦) · (1st𝑊)))
8 oveq2 7376 . . . . 5 (𝑦 = (2nd𝑊) → (2↑𝑦) = (2↑(2nd𝑊)))
98oveq1d 7383 . . . 4 (𝑦 = (2nd𝑊) → ((2↑𝑦) · (1st𝑊)) = ((2↑(2nd𝑊)) · (1st𝑊)))
10 oddpwdc.f . . . 4 𝐹 = (𝑥𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
11 ovex 7401 . . . 4 ((2↑(2nd𝑊)) · (1st𝑊)) ∈ V
127, 9, 10, 11ovmpo 7528 . . 3 (((1st𝑊) ∈ 𝐽 ∧ (2nd𝑊) ∈ ℕ0) → ((1st𝑊)𝐹(2nd𝑊)) = ((2↑(2nd𝑊)) · (1st𝑊)))
136, 12syl 17 . 2 (𝑊 ∈ (𝐽 × ℕ0) → ((1st𝑊)𝐹(2nd𝑊)) = ((2↑(2nd𝑊)) · (1st𝑊)))
142, 4, 133eqtr2d 2778 1 (𝑊 ∈ (𝐽 × ℕ0) → (𝐹𝑊) = ((2↑(2nd𝑊)) · (1st𝑊)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  {crab 3401  cop 4588   class class class wbr 5100   × cxp 5630  cfv 6500  (class class class)co 7368  cmpo 7370  1st c1st 7941  2nd c2nd 7942   · cmul 11043  cn 12157  2c2 12212  0cn0 12413  cexp 13996  cdvds 16191
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944
This theorem is referenced by:  eulerpartlemgvv  34553  eulerpartlemgh  34555  eulerpartlemgs2  34557
  Copyright terms: Public domain W3C validator