oddpwdcv - Mathbox for Thierry Arnoux

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

Theorem oddpwdcv 34866

Description: Lemma for eulerpart 34893: value of the 𝐹 function. (Contributed by Thierry Arnoux, 9-Sep-2017.)

**Hypotheses**
Ref	Expression
oddpwdc.j	⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
oddpwdc.f	⊢ 𝐹 = (𝑥 ∈ 𝐽, 𝑦 ∈ ℕ₀ ↦ ((2↑𝑦) · 𝑥))

**Assertion**
Ref	Expression
oddpwdcv	⊢ (𝑊 ∈ (𝐽 × ℕ₀) → (𝐹‘𝑊) = ((2↑(2^nd ‘𝑊)) · (1^st ‘𝑊)))

Distinct variable groups: 𝑥,𝑦,𝑧 𝑥,𝐽,𝑦 𝑥,𝑊,𝑦 Allowed substitution hints: 𝐹(𝑥, 𝑦, 𝑧) 𝐽(𝑧) 𝑊(𝑧)

**Proof of Theorem oddpwdcv**
Step	Hyp	Ref	Expression
1		1st2nd2 8025	. . 3 ⊢ (𝑊 ∈ (𝐽 × ℕ₀) → 𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
2	1	fveq2d 6882	. 2 ⊢ (𝑊 ∈ (𝐽 × ℕ₀) → (𝐹‘𝑊) = (𝐹‘⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩))
3		df-ov 7416	. . 3 ⊢ ((1^st ‘𝑊)𝐹(2^nd ‘𝑊)) = (𝐹‘⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩)
4	3	a1i 11	. 2 ⊢ (𝑊 ∈ (𝐽 × ℕ₀) → ((1^st ‘𝑊)𝐹(2^nd ‘𝑊)) = (𝐹‘⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩))
5		elxp6 8020	. . . 4 ⊢ (𝑊 ∈ (𝐽 × ℕ₀) ↔ (𝑊 = ⟨(1^st ‘𝑊), (2^nd ‘𝑊)⟩ ∧ ((1^st ‘𝑊) ∈ 𝐽 ∧ (2^nd ‘𝑊) ∈ ℕ₀)))
6	5	simprbi 503	. . 3 ⊢ (𝑊 ∈ (𝐽 × ℕ₀) → ((1^st ‘𝑊) ∈ 𝐽 ∧ (2^nd ‘𝑊) ∈ ℕ₀))
7		oveq2 7421	. . . 4 ⊢ (𝑥 = (1^st ‘𝑊) → ((2↑𝑦) · 𝑥) = ((2↑𝑦) · (1^st ‘𝑊)))
8		oveq2 7421	. . . . 5 ⊢ (𝑦 = (2^nd ‘𝑊) → (2↑𝑦) = (2↑(2^nd ‘𝑊)))
9	8	oveq1d 7428	. . . 4 ⊢ (𝑦 = (2^nd ‘𝑊) → ((2↑𝑦) · (1^st ‘𝑊)) = ((2↑(2^nd ‘𝑊)) · (1^st ‘𝑊)))
10		oddpwdc.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐽, 𝑦 ∈ ℕ₀ ↦ ((2↑𝑦) · 𝑥))
11		ovex 7446	. . . 4 ⊢ ((2↑(2^nd ‘𝑊)) · (1^st ‘𝑊)) ∈ V
12	7, 9, 10, 11	ovmpo 7573	. . 3 ⊢ (((1^st ‘𝑊) ∈ 𝐽 ∧ (2^nd ‘𝑊) ∈ ℕ₀) → ((1^st ‘𝑊)𝐹(2^nd ‘𝑊)) = ((2↑(2^nd ‘𝑊)) · (1^st ‘𝑊)))
13	6, 12	syl 18	. 2 ⊢ (𝑊 ∈ (𝐽 × ℕ₀) → ((1^st ‘𝑊)𝐹(2^nd ‘𝑊)) = ((2↑(2^nd ‘𝑊)) · (1^st ‘𝑊)))
14	2, 4, 13	3eqtr2d 2801	1 ⊢ (𝑊 ∈ (𝐽 × ℕ₀) → (𝐹‘𝑊) = ((2↑(2^nd ‘𝑊)) · (1^st ‘𝑊)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {crab 3412 ⟨cop 4590 class class class wbr 5103 × cxp 5653 ‘cfv 6533 (class class class)co 7413 ∈ cmpo 7415 1^st c1st 7984 2^nd c2nd 7985 · cmul 11129 ℕcn 12257 2c2 12319 ℕ₀cn0 12528 ↑cexp 14125 ∥ cdvds 16342

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6489 df-fun 6535 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-1st 7986 df-2nd 7987

This theorem is used by: eulerpartlemgvv 34887 eulerpartlemgh 34889 eulerpartlemgs2 34891

W3C validator