Theorem eulerpartlemr 34773

Description: Lemma for eulerpart 34781. (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 3920	. . . 4 ⊢ (ℎ ∈ (𝑇 ∩ 𝑅) ↔ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅))
2	1	anbi1i 635	. . 3 ⊢ ((ℎ ∈ (𝑇 ∩ 𝑅) ∧ ℎ ∈ 𝑃) ↔ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ∧ ℎ ∈ 𝑃))
3		elin 3920	. . 3 ⊢ (ℎ ∈ ((𝑇 ∩ 𝑅) ∩ 𝑃) ↔ (ℎ ∈ (𝑇 ∩ 𝑅) ∧ ℎ ∈ 𝑃))
4		eulerpart.p	. . . . 5 ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)}
5		eulerpart.o	. . . . 5 ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
6		eulerpart.d	. . . . 5 ⊢ 𝐷 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ≤ 1}
7	4, 5, 6	eulerpartlemo 34764	. . . 4 ⊢ (ℎ ∈ 𝑂 ↔ (ℎ ∈ 𝑃 ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))
8		cnveq 5858	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = ℎ → ◡𝑓 = ◡ℎ)
9	8	imaeq1d 6060	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = ℎ → (◡𝑓 “ ℕ) = (◡ℎ “ ℕ))
10	9	eleq1d 2847	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = ℎ → ((◡𝑓 “ ℕ) ∈ Fin ↔ (◡ℎ “ ℕ) ∈ Fin))
11		fveq1 6880	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 = ℎ → (𝑓‘𝑘) = (ℎ‘𝑘))
12	11	oveq1d 7427	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = ℎ → ((𝑓‘𝑘) · 𝑘) = ((ℎ‘𝑘) · 𝑘))
13	12	sumeq2sdv 15761	. . . . . . . . . . . . . . . 16 ⊢ (𝑓 = ℎ → Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘))
14	13	eqeq1d 2764	. . . . . . . . . . . . . . 15 ⊢ (𝑓 = ℎ → (Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁 ↔ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁))
15	10, 14	anbi12d 643	. . . . . . . . . . . . . 14 ⊢ (𝑓 = ℎ → (((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁) ↔ ((◡ℎ “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁)))
16	15, 4	elrab2 3653	. . . . . . . . . . . . 13 ⊢ (ℎ ∈ 𝑃 ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ ((◡ℎ “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁)))
17	16	simplbi 501	. . . . . . . . . . . 12 ⊢ (ℎ ∈ 𝑃 → ℎ ∈ (ℕ0 ↑m ℕ))
18		cnvimass 6083	. . . . . . . . . . . . 13 ⊢ (◡ℎ “ ℕ) ⊆ dom ℎ
19		nn0ex 12516	. . . . . . . . . . . . . . 15 ⊢ ℕ0 ∈ V
20		nnex 12245	. . . . . . . . . . . . . . 15 ⊢ ℕ ∈ V
21	19, 20	elmap 8867	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ (ℕ0 ↑m ℕ) ↔ ℎ:ℕ⟶ℕ0)
22		fdm 6715	. . . . . . . . . . . . . 14 ⊢ (ℎ:ℕ⟶ℕ0 → dom ℎ = ℕ)
23	21, 22	sylbi 220	. . . . . . . . . . . . 13 ⊢ (ℎ ∈ (ℕ0 ↑m ℕ) → dom ℎ = ℕ)
24	18, 23	sseqtrid 3978	. . . . . . . . . . . 12 ⊢ (ℎ ∈ (ℕ0 ↑m ℕ) → (◡ℎ “ ℕ) ⊆ ℕ)
25	17, 24	syl 18	. . . . . . . . . . 11 ⊢ (ℎ ∈ 𝑃 → (◡ℎ “ ℕ) ⊆ ℕ)
26	25	sselda 3936	. . . . . . . . . 10 ⊢ ((ℎ ∈ 𝑃 ∧ 𝑛 ∈ (◡ℎ “ ℕ)) → 𝑛 ∈ ℕ)
27	26	ralrimiva 3156	. . . . . . . . 9 ⊢ (ℎ ∈ 𝑃 → ∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ)
28	27	biantrurd 541	. . . . . . . 8 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)))
29	17	biantrurd 541	. . . . . . . 8 ⊢ (ℎ ∈ 𝑃 → ((∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛) ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))))
30	16	simprbi 502	. . . . . . . . . 10 ⊢ (ℎ ∈ 𝑃 → ((◡ℎ “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((ℎ‘𝑘) · 𝑘) = 𝑁))
31	30	simpld 499	. . . . . . . . 9 ⊢ (ℎ ∈ 𝑃 → (◡ℎ “ ℕ) ∈ Fin)
32	31	biantrud 540	. . . . . . . 8 ⊢ (ℎ ∈ 𝑃 → ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ∧ (◡ℎ “ ℕ) ∈ Fin)))
33	28, 29, 32	3bitrd 308	. . . . . . 7 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ∧ (◡ℎ “ ℕ) ∈ Fin)))
34		dfss3 3925	. . . . . . . . . 10 ⊢ ((◡ℎ “ ℕ) ⊆ 𝐽 ↔ ∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ 𝐽)
35		breq2 5112	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑛 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑛))
36	35	notbid 321	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑛 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑛))
37		eulerpart.j	. . . . . . . . . . . 12 ⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
38	36, 37	elrab2 3653	. . . . . . . . . . 11 ⊢ (𝑛 ∈ 𝐽 ↔ (𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
39	38	ralbii 3110	. . . . . . . . . 10 ⊢ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ 𝐽 ↔ ∀𝑛 ∈ (◡ℎ “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
40		r19.26 3124	. . . . . . . . . 10 ⊢ (∀𝑛 ∈ (◡ℎ “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛) ↔ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))
41	34, 39, 40	3bitri 300	. . . . . . . . 9 ⊢ ((◡ℎ “ ℕ) ⊆ 𝐽 ↔ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛))
42	41	anbi2i 634	. . . . . . . 8 ⊢ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)))
43	42	anbi1i 635	. . . . . . 7 ⊢ (((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ∧ (◡ℎ “ ℕ) ∈ Fin) ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (∀𝑛 ∈ (◡ℎ “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛)) ∧ (◡ℎ “ ℕ) ∈ Fin))
44	33, 43	bitr4di 292	. . . . . 6 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ∧ (◡ℎ “ ℕ) ∈ Fin)))
45	9	sseq1d 3967	. . . . . . . 8 ⊢ (𝑓 = ℎ → ((◡𝑓 “ ℕ) ⊆ 𝐽 ↔ (◡ℎ “ ℕ) ⊆ 𝐽))
46		eulerpart.t	. . . . . . . 8 ⊢ 𝑇 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ (◡𝑓 “ ℕ) ⊆ 𝐽}
47	45, 46	elrab2 3653	. . . . . . 7 ⊢ (ℎ ∈ 𝑇 ↔ (ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽))
48		vex 3458	. . . . . . . 8 ⊢ ℎ ∈ V
49		eulerpart.r	. . . . . . . 8 ⊢ 𝑅 = {𝑓 ∣ (◡𝑓 “ ℕ) ∈ Fin}
50	48, 10, 49	elab2 3640	. . . . . . 7 ⊢ (ℎ ∈ 𝑅 ↔ (◡ℎ “ ℕ) ∈ Fin)
51	47, 50	anbi12i 639	. . . . . 6 ⊢ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ↔ ((ℎ ∈ (ℕ0 ↑m ℕ) ∧ (◡ℎ “ ℕ) ⊆ 𝐽) ∧ (◡ℎ “ ℕ) ∈ Fin))
52	44, 51	bitr4di 292	. . . . 5 ⊢ (ℎ ∈ 𝑃 → (∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛 ↔ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅)))
53	52	pm5.32i 584	. . . 4 ⊢ ((ℎ ∈ 𝑃 ∧ ∀𝑛 ∈ (◡ℎ “ ℕ) ¬ 2 ∥ 𝑛) ↔ (ℎ ∈ 𝑃 ∧ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅)))
54		ancom 465	. . . 4 ⊢ ((ℎ ∈ 𝑃 ∧ (ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅)) ↔ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ∧ ℎ ∈ 𝑃))
55	7, 53, 54	3bitri 300	. . 3 ⊢ (ℎ ∈ 𝑂 ↔ ((ℎ ∈ 𝑇 ∧ ℎ ∈ 𝑅) ∧ ℎ ∈ 𝑃))
56	2, 3, 55	3bitr4ri 307	. 2 ⊢ (ℎ ∈ 𝑂 ↔ ℎ ∈ ((𝑇 ∩ 𝑅) ∩ 𝑃))
57	56	eqriv 2759	1 ⊢ 𝑂 = ((𝑇 ∩ 𝑅) ∩ 𝑃)

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 400   = wceq 1569   ∈ wcel 2142  {cab 2740  ∀wral 3078  {crab 3415   ∩ cin 3903   ⊆ wss 3904  ∅c0 4285  𝒫 cpw 4561   class class class wbr 5108  {copab 5172   ↦ cmpt 5191  ^◡ccnv 5659  dom cdm 5660   ↾ cres 5662   “ cima 5663   ∘ ccom 5664  ⟶wf 6532  ‘cfv 6536  (class class class)co 7412   ∈ cmpo 7414   supp csupp 8154   ↑_m cmap 8822  Fincfn 8941  1c1 11107   · cmul 11111   ≤ cle 11250  𝟭cind 12224  ℕcn 12239  2c2 12301  ℕ₀cn0 12510  ↑cexp 14104  Σcsu 15744   ∥ cdvds 16316  bitscbits 16483

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-cnex 11162  ax-1cn 11164  ax-addcl 11166

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-map 8824  df-nn 12240  df-n0 12511  df-seq 14045  df-sum 15745

This theorem is used by: (None)