Theorem eulerpartlemt0 34783

Description: Lemma for eulerpart 34796. (Contributed by Thierry Arnoux, 19-Sep-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 ℕ) ∣ (◡𝑓 “ ℕ) ⊆ 𝐽}

Assertion

Ref	Expression
eulerpartlemt0	⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽))

Distinct variable groups:   𝐴,𝑓   𝑓,𝐽

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

Proof of Theorem eulerpartlemt0

Step	Hyp	Ref	Expression
1		cnveq 5864	. . . . . 6 ⊢ (𝑓 = 𝐴 → ◡𝑓 = ◡𝐴)
2	1	imaeq1d 6066	. . . . 5 ⊢ (𝑓 = 𝐴 → (◡𝑓 “ ℕ) = (◡𝐴 “ ℕ))
3	2	sseq1d 3971	. . . 4 ⊢ (𝑓 = 𝐴 → ((◡𝑓 “ ℕ) ⊆ 𝐽 ↔ (◡𝐴 “ ℕ) ⊆ 𝐽))
4		eulerpart.t	. . . 4 ⊢ 𝑇 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ (◡𝑓 “ ℕ) ⊆ 𝐽}
5	3, 4	elrab2 3657	. . 3 ⊢ (𝐴 ∈ 𝑇 ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ⊆ 𝐽))
6	2	eleq1d 2851	. . . 4 ⊢ (𝑓 = 𝐴 → ((◡𝑓 “ ℕ) ∈ Fin ↔ (◡𝐴 “ ℕ) ∈ Fin))
7		eulerpart.r	. . . 4 ⊢ 𝑅 = {𝑓 ∣ (◡𝑓 “ ℕ) ∈ Fin}
8	6, 7	elab4g 3645	. . 3 ⊢ (𝐴 ∈ 𝑅 ↔ (𝐴 ∈ V ∧ (◡𝐴 “ ℕ) ∈ Fin))
9	5, 8	anbi12i 640	. 2 ⊢ ((𝐴 ∈ 𝑇 ∧ 𝐴 ∈ 𝑅) ↔ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ⊆ 𝐽) ∧ (𝐴 ∈ V ∧ (◡𝐴 “ ℕ) ∈ Fin)))
10		elin 3924	. 2 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) ↔ (𝐴 ∈ 𝑇 ∧ 𝐴 ∈ 𝑅))
11		elex 3479	. . . . 5 ⊢ (𝐴 ∈ (ℕ0 ↑m ℕ) → 𝐴 ∈ V)
12	11	pm4.71i 569	. . . 4 ⊢ (𝐴 ∈ (ℕ0 ↑m ℕ) ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ 𝐴 ∈ V))
13	12	anbi1i 636	. . 3 ⊢ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽)) ↔ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ 𝐴 ∈ V) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽)))
14		3anass 1111	. . 3 ⊢ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽) ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽)))
15		an42 670	. . 3 ⊢ (((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ⊆ 𝐽) ∧ (𝐴 ∈ V ∧ (◡𝐴 “ ℕ) ∈ Fin)) ↔ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ 𝐴 ∈ V) ∧ ((◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽)))
16	13, 14, 15	3bitr4i 306	. 2 ⊢ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽) ↔ ((𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ⊆ 𝐽) ∧ (𝐴 ∈ V ∧ (◡𝐴 “ ℕ) ∈ Fin)))
17	9, 10, 16	3bitr4i 306	1 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  {cab 2744  ∀wral 3082  {crab 3419  Vcvv 3458   ∩ cin 3907   ⊆ wss 3908  ∅c0 4289  𝒫 cpw 4567   class class class wbr 5114  {copab 5178   ↦ cmpt 5197  ^◡ccnv 5665   “ cima 5669  ‘cfv 6543  (class class class)co 7423   ∈ cmpo 7425   supp csupp 8165   ↑_m cmap 8833  Fincfn 8952  1c1 11119   · cmul 11123   ≤ cle 11262  ℕcn 12251  2c2 12313  ℕ₀cn0 12522  ↑cexp 14117  Σcsu 15763   ∥ cdvds 16335

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 2148  ax-9 2156  ax-ext 2738

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-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-cnv 5674  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679

This theorem is used by:  eulerpartlemf  34784  eulerpartlemt  34785  eulerpartlemmf  34789  eulerpartlemgvv  34790  eulerpartlemgu  34791  eulerpartlemgh  34792  eulerpartlemgs2  34794  eulerpartlemn  34795