Theorem eulerpartlemr 34561

Description: Lemma for eulerpart 34569. (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
eulerpartlemr	⊢ 𝑂 = ((𝑇 ∩ 𝑅) ∩ 𝑃)

Distinct variable groups:   𝑓,𝑘,𝑛,𝑧   𝑓,𝐽,𝑛   𝑓,𝑁   𝑔,𝑛,𝑃

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

Proof of Theorem eulerpartlemr

Dummy variable ℎ is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elin 3902	. . . 4 ⊢ (ℎ ∈ (𝑇 ∩ 𝑅) ↔ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅))
2	1	anbi1i 626	. . 3 ⊢ ((ℎ ∈ (𝑇 ∩ 𝑅) ∧ ℎ ∈ 𝑃) ↔ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ∧ ℎ ∈ 𝑃))
3		elin 3902	. . 3 ⊢ (ℎ ∈ ((𝑇 ∩ 𝑅) ∩ 𝑃) ↔ (ℎ ∈ (𝑇 ∩ 𝑅) ∧ ℎ ∈ 𝑃))
4		eulerpart.p	. . . . 5 ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)}
5		eulerpart.o	. . . . 5 ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
6		eulerpart.d	. . . . 5 ⊢ 𝐷 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ≤ 1}
7	4, 5, 6	eulerpartlemo 34552	. . . 4 ⊢ (ℎ ∈ 𝑂 ↔ (ℎ ∈ 𝑃 ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))
8		cnveq 5818	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = ℎ → ◡𝑓 = ◡ℎ)
9	8	imaeq1d 6014	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = ℎ → (◡𝑓 “ ℕ) = (◡ℎ “ ℕ))
10	9	eleq1d 2821	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = ℎ → ((◡𝑓 “ ℕ) ∈ Fin ↔ (◡ℎ “ ℕ) ∈ Fin))
11		fveq1 6829	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 = ℎ → (𝑓‘𝑘) = (ℎ‘𝑘))
12	11	oveq1d 7374	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = ℎ → ((𝑓‘𝑘) · 𝑘) = ((ℎ‘𝑘) · 𝑘))
13	12	sumeq2sdv 15659	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = ℎ → Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘))
14	13	eqeq1d 2738	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = ℎ → (Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁 ↔ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁))
15	10, 14	anbi12d 634	. . . . . . . . . . . . . 14 ⊢ (𝑓 = ℎ → (((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁) ↔ ((◡ℎ “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁)))
16	15, 4	elrab2 3635	. . . . . . . . . . . . 13 ⊢ (ℎ ∈ 𝑃 ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ ((◡ℎ “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁)))
17	16	simplbi 497	. . . . . . . . . . . 12 ⊢ (ℎ ∈ 𝑃 → ℎ ∈ (ℕ0 ↑m ℕ))
18		cnvimass 6037	. . . . . . . . . . . . 13 ⊢ (◡ℎ “ ℕ) ⊆ dom ℎ
19		nn0ex 12437	. . . . . . . . . . . . . . 15 ⊢ ℕ0 ∈ V
20		nnex 12174	. . . . . . . . . . . . . . 15 ⊢ ℕ ∈ V
21	19, 20	elmap 8812	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ (ℕ0 ↑m ℕ) ↔ ℎ:ℕ⟶ℕ0)
22		fdm 6667	. . . . . . . . . . . . . 14 ⊢ (ℎ:ℕ⟶ℕ0 → dom ℎ = ℕ)
23	21, 22	sylbi 218	. . . . . . . . . . . . 13 ⊢ (ℎ ∈ (ℕ0 ↑m ℕ) → dom ℎ = ℕ)
24	18, 23	sseqtrid 3960	. . . . . . . . . . . 12 ⊢ (ℎ ∈ (ℕ0 ↑m ℕ) → (◡ℎ “ ℕ) ⊆ ℕ)
25	17, 24	syl 17	. . . . . . . . . . 11 ⊢ (ℎ ∈ 𝑃 → (◡ℎ “ ℕ) ⊆ ℕ)
26	25	sselda 3918	. . . . . . . . . 10 ⊢ ((ℎ ∈ 𝑃 ∧ 𝑛 ∈ (◡ℎ “ ℕ)) → 𝑛 ∈ ℕ)
27	26	ralrimiva 3128	. . . . . . . . 9 ⊢ (ℎ ∈ 𝑃 → ∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ)
28	27	biantrurd 533	. . . . . . . 8 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)))
29	17	biantrurd 533	. . . . . . . 8 ⊢ (ℎ ∈ 𝑃 → ((∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛) ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))))
30	16	simprbi 498	. . . . . . . . . 10 ⊢ (ℎ ∈ 𝑃 → ((◡ℎ “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁))
31	30	simpld 495	. . . . . . . . 9 ⊢ (ℎ ∈ 𝑃 → (◡ℎ “ ℕ) ∈ Fin)
32	31	biantrud 532	. . . . . . . 8 ⊢ (ℎ ∈ 𝑃 → ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ∧ (◡ℎ “ ℕ) ∈ Fin)))
33	28, 29, 32	3bitrd 306	. . . . . . 7 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ∧ (◡ℎ “ ℕ) ∈ Fin)))
34		dfss3 3907	. . . . . . . . . 10 ⊢ ((◡ℎ “ ℕ) ⊆ 𝐽 ↔ ∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ 𝐽)
35		breq2 5079	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑛 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑛))
36	35	notbid 319	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑛 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑛))
37		eulerpart.j	. . . . . . . . . . . 12 ⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
38	36, 37	elrab2 3635	. . . . . . . . . . 11 ⊢ (𝑛 ∈ 𝐽 ↔ (𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
39	38	ralbii 3082	. . . . . . . . . 10 ⊢ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ 𝐽 ↔ ∀𝑛 ∈ (◡ℎ “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
40		r19.26 3096	. . . . . . . . . 10 ⊢ (∀𝑛 ∈ (◡ℎ “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛) ↔ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))
41	34, 39, 40	3bitri 298	. . . . . . . . 9 ⊢ ((◡ℎ “ ℕ) ⊆ 𝐽 ↔ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))
42	41	anbi2i 625	. . . . . . . 8 ⊢ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)))
43	42	anbi1i 626	. . . . . . 7 ⊢ (((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ∧ (◡ℎ “ ℕ) ∈ Fin) ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ∧ (◡ℎ “ ℕ) ∈ Fin))
44	33, 43	bitr4di 290	. . . . . 6 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ∧ (◡ℎ “ ℕ) ∈ Fin)))
45	9	sseq1d 3949	. . . . . . . 8 ⊢ (𝑓 = ℎ → ((◡𝑓 “ ℕ) ⊆ 𝐽 ↔ (◡ℎ “ ℕ) ⊆ 𝐽))
46		eulerpart.t	. . . . . . . 8 ⊢ 𝑇 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ (◡𝑓 “ ℕ) ⊆ 𝐽}
47	45, 46	elrab2 3635	. . . . . . 7 ⊢ (ℎ ∈ 𝑇 ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽))
48		vex 3432	. . . . . . . 8 ⊢ ℎ ∈ V
49		eulerpart.r	. . . . . . . 8 ⊢ 𝑅 = {𝑓 ∣ (◡𝑓 “ ℕ) ∈ Fin}
50	48, 10, 49	elab2 3623	. . . . . . 7 ⊢ (ℎ ∈ 𝑅 ↔ (◡ℎ “ ℕ) ∈ Fin)
51	47, 50	anbi12i 630	. . . . . 6 ⊢ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ∧ (◡ℎ “ ℕ) ∈ Fin))
52	44, 51	bitr4di 290	. . . . 5 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅)))
53	52	pm5.32i 575	. . . 4 ⊢ ((ℎ ∈ 𝑃 ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛) ↔ (ℎ ∈ 𝑃 ∧ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅)))
54		ancom 461	. . . 4 ⊢ ((ℎ ∈ 𝑃 ∧ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅)) ↔ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ∧ ℎ ∈ 𝑃))
55	7, 53, 54	3bitri 298	. . 3 ⊢ (ℎ ∈ 𝑂 ↔ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ∧ ℎ ∈ 𝑃))
56	2, 3, 55	3bitr4ri 305	. 2 ⊢ (ℎ ∈ 𝑂 ↔ ℎ ∈ ((𝑇 ∩ 𝑅) ∩ 𝑃))
57	56	eqriv 2733	1 ⊢ 𝑂 = ((𝑇 ∩ 𝑅) ∩ 𝑃)

Syntax hints:  ¬ wn 3   ∧ wa 396   = wceq 1543   ∈ wcel 2115  {cab 2714  ∀wral 3050  {crab 3388   ∩ cin 3885   ⊆ wss 3886  ∅c0 4264  𝒫 cpw 4532   class class class wbr 5075  {copab 5137   ↦ cmpt 5156  ^◡ccnv 5620  dom cdm 5621   ↾ cres 5623   “ cima 5624   ∘ ccom 5625  ⟶wf 6484  ‘cfv 6488  (class class class)co 7359   ∈ cmpo 7361   supp csupp 8103   ↑_m cmap 8766  Fincfn 8886  1c1 11033   · cmul 11037   ≤ cle 11174  𝟭cind 12153  ℕcn 12168  2c2 12230  ℕ₀cn0 12431  ↑cexp 14017  Σcsu 15642   ∥ cdvds 16215  bitscbits 16382

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1970  ax-7 2011  ax-8 2117  ax-9 2125  ax-10 2148  ax-11 2164  ax-12 2185  ax-ext 2708  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7681  ax-cnex 11088  ax-1cn 11090  ax-addcl 11092

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 850  df-3or 1089  df-3an 1090  df-tru 1546  df-fal 1556  df-ex 1783  df-nf 1787  df-sb 2070  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2932  df-ral 3051  df-rex 3061  df-reu 3342  df-rab 3389  df-v 3430  df-sbc 3727  df-csb 3835  df-dif 3889  df-un 3891  df-in 3893  df-ss 3903  df-pss 3906  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-ov 7362  df-oprab 7363  df-mpo 7364  df-om 7810  df-2nd 7935  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-map 8768  df-nn 12169  df-n0 12432  df-seq 13958  df-sum 15643

This theorem is referenced by: (None)