Theorem eulerpartlemf 34868

Description: Lemma for eulerpart 34880: Odd partitions are zero for even numbers. (Contributed by Thierry Arnoux, 9-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
eulerpartlemf	⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴‘𝑡) = 0)

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

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

Proof of Theorem eulerpartlemf

Step	Hyp	Ref	Expression
1		eldif 3912	. . . . . 6 ⊢ (𝑡 ∈ (ℕ ∖ 𝐽) ↔ (𝑡 ∈ ℕ ∧ ¬ 𝑡 ∈ 𝐽))
2		breq2 5111	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑡 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑡))
3	2	notbid 321	. . . . . . . . . 10 ⊢ (𝑧 = 𝑡 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑡))
4		eulerpart.j	. . . . . . . . . 10 ⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
5	3, 4	elrab2 3652	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝐽 ↔ (𝑡 ∈ ℕ ∧ ¬ 2 ∥ 𝑡))
6	5	simplbi2 506	. . . . . . . 8 ⊢ (𝑡 ∈ ℕ → (¬ 2 ∥ 𝑡 → 𝑡 ∈ 𝐽))
7	6	con1d 146	. . . . . . 7 ⊢ (𝑡 ∈ ℕ → (¬ 𝑡 ∈ 𝐽 → 2 ∥ 𝑡))
8	7	imp 412	. . . . . 6 ⊢ ((𝑡 ∈ ℕ ∧ ¬ 𝑡 ∈ 𝐽) → 2 ∥ 𝑡)
9	1, 8	sylbi 220	. . . . 5 ⊢ (𝑡 ∈ (ℕ ∖ 𝐽) → 2 ∥ 𝑡)
10	9	adantl 487	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 2 ∥ 𝑡)
11	10	adantr 486	. . 3 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → 2 ∥ 𝑡)
12		simpll 779	. . . 4 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → 𝐴 ∈ (𝑇 ∩ 𝑅))
13		eldifi 4081	. . . . . 6 ⊢ (𝑡 ∈ (ℕ ∖ 𝐽) → 𝑡 ∈ ℕ)
14		eulerpart.p	. . . . . . . . . . 11 ⊢ 𝑃 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ ((◡𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓‘𝑘) · 𝑘) = 𝑁)}
15		eulerpart.o	. . . . . . . . . . 11 ⊢ 𝑂 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ (◡𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
16		eulerpart.d	. . . . . . . . . . 11 ⊢ 𝐷 = {𝑔 ∈ 𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔‘𝑛) ≤ 1}
17		eulerpart.f	. . . . . . . . . . 11 ⊢ 𝐹 = (𝑥 ∈ 𝐽, 𝑦 ∈ ℕ0 ↦ ((2↑𝑦) · 𝑥))
18		eulerpart.h	. . . . . . . . . . 11 ⊢ 𝐻 = {𝑟 ∈ ((𝒫 ℕ0 ∩ Fin) ↑m 𝐽) ∣ (𝑟 supp ∅) ∈ Fin}
19		eulerpart.m	. . . . . . . . . . 11 ⊢ 𝑀 = (𝑟 ∈ 𝐻 ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐽 ∧ 𝑦 ∈ (𝑟‘𝑥))})
20		eulerpart.r	. . . . . . . . . . 11 ⊢ 𝑅 = {𝑓 ∣ (◡𝑓 “ ℕ) ∈ Fin}
21		eulerpart.t	. . . . . . . . . . 11 ⊢ 𝑇 = {𝑓 ∈ (ℕ0 ↑m ℕ) ∣ (◡𝑓 “ ℕ) ⊆ 𝐽}
22	14, 15, 16, 4, 17, 18, 19, 20, 21	eulerpartlemt0 34867	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽))
23	22	simp1bi 1163	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → 𝐴 ∈ (ℕ0 ↑m ℕ))
24		elmapi 8851	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℕ0 ↑m ℕ) → 𝐴:ℕ⟶ℕ0)
25	23, 24	syl 18	. . . . . . . 8 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → 𝐴:ℕ⟶ℕ0)
26		ffn 6706	. . . . . . . 8 ⊢ (𝐴:ℕ⟶ℕ0 → 𝐴 Fn ℕ)
27		elpreima 7054	. . . . . . . 8 ⊢ (𝐴 Fn ℕ → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝑡 ∈ ℕ ∧ (𝐴‘𝑡) ∈ ℕ)))
28	25, 26, 27	3syl 19	. . . . . . 7 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝑡 ∈ ℕ ∧ (𝐴‘𝑡) ∈ ℕ)))
29	28	baibd 549	. . . . . 6 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ ℕ) → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝐴‘𝑡) ∈ ℕ))
30	13, 29	sylan2 605	. . . . 5 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝐴‘𝑡) ∈ ℕ))
31	30	biimpar 483	. . . 4 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → 𝑡 ∈ (◡𝐴 “ ℕ))
32	22	simp3bi 1165	. . . . . 6 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → (◡𝐴 “ ℕ) ⊆ 𝐽)
33	32	sselda 3934	. . . . 5 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (◡𝐴 “ ℕ)) → 𝑡 ∈ 𝐽)
34	5	simprbi 503	. . . . 5 ⊢ (𝑡 ∈ 𝐽 → ¬ 2 ∥ 𝑡)
35	33, 34	syl 18	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (◡𝐴 “ ℕ)) → ¬ 2 ∥ 𝑡)
36	12, 31, 35	syl2anc 596	. . 3 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → ¬ 2 ∥ 𝑡)
37	11, 36	pm2.65da 829	. 2 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → ¬ (𝐴‘𝑡) ∈ ℕ)
38	25	adantr 486	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 𝐴:ℕ⟶ℕ0)
39	13	adantl 487	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 𝑡 ∈ ℕ)
40	38, 39	ffvelcdmd 7081	. . 3 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴‘𝑡) ∈ ℕ0)
41		elnn0 12533	. . 3 ⊢ ((𝐴‘𝑡) ∈ ℕ0 ↔ ((𝐴‘𝑡) ∈ ℕ ∨ (𝐴‘𝑡) = 0))
42	40, 41	sylib 221	. 2 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → ((𝐴‘𝑡) ∈ ℕ ∨ (𝐴‘𝑡) = 0))
43		orel1 902	. 2 ⊢ (¬ (𝐴‘𝑡) ∈ ℕ → (((𝐴‘𝑡) ∈ ℕ ∨ (𝐴‘𝑡) = 0) → (𝐴‘𝑡) = 0))
44	37, 42, 43	sylc 66	1 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴‘𝑡) = 0)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145  {cab 2740  ∀wral 3078  {crab 3414   ∖ cdif 3899   ∩ cin 3901   ⊆ wss 3902  ∅c0 4282  𝒫 cpw 4560   class class class wbr 5107  {copab 5171   ↦ cmpt 5190  ^◡ccnv 5658   “ cima 5662   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416   ∈ cmpo 7418   supp csupp 8161   ↑_m cmap 8829  Fincfn 8955  0cc0 11127  1c1 11128   · cmul 11132   ≤ cle 11271  ℕcn 12260  2c2 12322  ℕ₀cn0 12531  ↑cexp 14127  Σcsu 15775   ∥ cdvds 16346

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-mulcl 11189  ax-i2m1 11195

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 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-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-map 8831  df-n0 12532

This theorem is used by:  eulerpartlemgh  34876