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 34346
Description: Lemma for eulerpart 34373: 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 8007 . . 3 (𝑊 ∈ (𝐽 × ℕ0) → 𝑊 = ⟨(1st𝑊), (2nd𝑊)⟩)
21fveq2d 6862 . 2 (𝑊 ∈ (𝐽 × ℕ0) → (𝐹𝑊) = (𝐹‘⟨(1st𝑊), (2nd𝑊)⟩))
3 df-ov 7390 . . 3 ((1st𝑊)𝐹(2nd𝑊)) = (𝐹‘⟨(1st𝑊), (2nd𝑊)⟩)
43a1i 11 . 2 (𝑊 ∈ (𝐽 × ℕ0) → ((1st𝑊)𝐹(2nd𝑊)) = (𝐹‘⟨(1st𝑊), (2nd𝑊)⟩))
5 elxp6 8002 . . . 4 (𝑊 ∈ (𝐽 × ℕ0) ↔ (𝑊 = ⟨(1st𝑊), (2nd𝑊)⟩ ∧ ((1st𝑊) ∈ 𝐽 ∧ (2nd𝑊) ∈ ℕ0)))
65simprbi 496 . . 3 (𝑊 ∈ (𝐽 × ℕ0) → ((1st𝑊) ∈ 𝐽 ∧ (2nd𝑊) ∈ ℕ0))
7 oveq2 7395 . . . 4 (𝑥 = (1st𝑊) → ((2↑𝑦) · 𝑥) = ((2↑𝑦) · (1st𝑊)))
8 oveq2 7395 . . . . 5 (𝑦 = (2nd𝑊) → (2↑𝑦) = (2↑(2nd𝑊)))
98oveq1d 7402 . . . 4 (𝑦 = (2nd𝑊) → ((2↑𝑦) · (1st𝑊)) = ((2↑(2nd𝑊)) · (1st𝑊)))
10 oddpwdc.f . . . 4 𝐹 = (𝑥𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
11 ovex 7420 . . . 4 ((2↑(2nd𝑊)) · (1st𝑊)) ∈ V
127, 9, 10, 11ovmpo 7549 . . 3 (((1st𝑊) ∈ 𝐽 ∧ (2nd𝑊) ∈ ℕ0) → ((1st𝑊)𝐹(2nd𝑊)) = ((2↑(2nd𝑊)) · (1st𝑊)))
136, 12syl 17 . 2 (𝑊 ∈ (𝐽 × ℕ0) → ((1st𝑊)𝐹(2nd𝑊)) = ((2↑(2nd𝑊)) · (1st𝑊)))
142, 4, 133eqtr2d 2770 1 (𝑊 ∈ (𝐽 × ℕ0) → (𝐹𝑊) = ((2↑(2nd𝑊)) · (1st𝑊)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1540  wcel 2109  {crab 3405  cop 4595   class class class wbr 5107   × cxp 5636  cfv 6511  (class class class)co 7387  cmpo 7389  1st c1st 7966  2nd c2nd 7967   · cmul 11073  cn 12186  2c2 12241  0cn0 12442  cexp 14026  cdvds 16222
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969
This theorem is referenced by:  eulerpartlemgvv  34367  eulerpartlemgh  34369  eulerpartlemgs2  34371
  Copyright terms: Public domain W3C validator