Theorem eulerpartlemgv 35051

Description: Lemma for eulerpart 35060: value of the function 𝐺. (Contributed by Thierry Arnoux, 13-Nov-2017.)

Hypotheses

Ref	Expression
eulerpart.p	⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)}
eulerpart.o	⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
eulerpart.d	⊢ 𝐷 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ≤ 1}
eulerpart.j	⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
eulerpart.f	⊢ 𝐹 = (𝑥 ∈ 𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
eulerpart.h	⊢ 𝐻 = {𝑟 ∈ ((𝒫 ℕ0 ∩ Fin) ↑m 𝐽) ∣ (𝑟 supp ∅) ∈ Fin}
eulerpart.m	⊢ 𝑀 = (𝑟 ∈ 𝐻 ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ (𝑟‘𝑥))})
eulerpart.r	⊢ 𝑅 = {𝑓 ∣ (◡𝑓 “ ℕ) ∈ Fin}
eulerpart.t	⊢ 𝑇 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ (◡𝑓 “ ℕ) ⊆ 𝐽}
eulerpart.g	⊢ 𝐺 = (𝑜 ∈ (𝑇 ∩ 𝑅) ↦ ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝑜 ↾ 𝐽))))))

Assertion

Ref	Expression
eulerpartlemgv	⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → (𝐺‘𝐴) = ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴 ↾ 𝐽))))))

Distinct variable groups:   𝐴,𝑜   𝑜,𝐹   𝑜,𝐽   𝑜,𝑀   𝑅,𝑜   𝑇,𝑜

Allowed substitution hints:   𝐴(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑟)   𝐷(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑜, 𝑟)   𝑃(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑜, 𝑟)   𝑅(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑟)   𝑇(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑟)   𝐹(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑟)   𝐺(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑜, 𝑟)   𝐻(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑜, 𝑟)   𝐽(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑟)   𝑀(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑟)   𝑁(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑜, 𝑟)   𝑂(𝑥, 𝑦, 𝑧, 𝑓, 𝑔, 𝑘, 𝑛, 𝑜, 𝑟)

Proof of Theorem eulerpartlemgv

Step	Hyp	Ref	Expression
1		reseq1 5963	. . . . . 6 ⊢ (𝑜 = 𝐴 → (𝑜 ↾ 𝐽) = (𝐴 ↾ 𝐽))
2	1	coeq2d 5839	. . . . 5 ⊢ (𝑜 = 𝐴 → (bits ∘ (𝑜 ↾ 𝐽)) = (bits ∘ (𝐴 ↾ 𝐽)))
3	2	fveq2d 6889	. . . 4 ⊢ (𝑜 = 𝐴 → (𝑀‘(bits ∘ (𝑜 ↾ 𝐽))) = (𝑀‘(bits ∘ (𝐴 ↾ 𝐽))))
4	3	imaeq2d 6051	. . 3 ⊢ (𝑜 = 𝐴 → (𝐹 “ (𝑀‘(bits ∘ (𝑜 ↾ 𝐽)))) = (𝐹 “ (𝑀‘(bits ∘ (𝐴 ↾ 𝐽)))))
5	4	fveq2d 6889	. 2 ⊢ (𝑜 = 𝐴 → ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝑜 ↾ 𝐽))))) = ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴 ↾ 𝐽))))))
6		eulerpart.g	. 2 ⊢ 𝐺 = (𝑜 ∈ (𝑇 ∩ 𝑅) ↦ ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝑜 ↾ 𝐽))))))
7		fvex 6898	. 2 ⊢ ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴 ↾ 𝐽))))) ∈ V
8	5, 6, 7	fvmpt 6993	1 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → (𝐺‘𝐴) = ((𝟭‘ℕ)‘(𝐹 “ (𝑀‘(bits ∘ (𝐴 ↾ 𝐽))))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  {crab 3412   ⊆ wss 3895   ∩ cin 4089  ∅c0 4278  𝒫 cpw 4556   class class class wbr 5102  {copab 5166   ↦ cmpt 5185  ^◡ccnv 5649   ↾ cres 5652   “ cima 5653   ∘ ccom 5654  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   supp csupp 8179   ↑_m cmap 8850  Fincfn 8976  1c1 11204   · cmul 11208   ≤ cle 11347  𝟭cind 12323  ℕcn 12338  2c2 12400  ℕ₀cn0 12609  ↑cexp 14207  Σcsu 15858   ∥ cdvds 16427  bitscbits 16594

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fv 6546

This theorem is used by:  eulerpartlemgvv  35054  eulerpartlemgf  35057  eulerpartlemn  35059