Theorem eulerpartlemf 33668

Description: Lemma for eulerpart 33680: 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 3958	. . . . . 6 ⊢ (𝑡 ∈ (ℕ ∖ 𝐽) ↔ (𝑡 ∈ ℕ ∧ ¬ 𝑡 ∈ 𝐽))
2		breq2 5152	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑡 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑡))
3	2	notbid 318	. . . . . . . . . 10 ⊢ (𝑧 = 𝑡 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑡))
4		eulerpart.j	. . . . . . . . . 10 ⊢ 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
5	3, 4	elrab2 3686	. . . . . . . . 9 ⊢ (𝑡 ∈ 𝐽 ↔ (𝑡 ∈ ℕ ∧ ¬ 2 ∥ 𝑡))
6	5	simplbi2 500	. . . . . . . 8 ⊢ (𝑡 ∈ ℕ → (¬ 2 ∥ 𝑡 → 𝑡 ∈ 𝐽))
7	6	con1d 145	. . . . . . 7 ⊢ (𝑡 ∈ ℕ → (¬ 𝑡 ∈ 𝐽 → 2 ∥ 𝑡))
8	7	imp 406	. . . . . 6 ⊢ ((𝑡 ∈ ℕ ∧ ¬ 𝑡 ∈ 𝐽) → 2 ∥ 𝑡)
9	1, 8	sylbi 216	. . . . 5 ⊢ (𝑡 ∈ (ℕ ∖ 𝐽) → 2 ∥ 𝑡)
10	9	adantl 481	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 2 ∥ 𝑡)
11	10	adantr 480	. . 3 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → 2 ∥ 𝑡)
12		simpll 764	. . . 4 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → 𝐴 ∈ (𝑇 ∩ 𝑅))
13		eldifi 4126	. . . . . 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 33667	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) ↔ (𝐴 ∈ (ℕ0 ↑m ℕ) ∧ (◡𝐴 “ ℕ) ∈ Fin ∧ (◡𝐴 “ ℕ) ⊆ 𝐽))
23	22	simp1bi 1144	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → 𝐴 ∈ (ℕ0 ↑m ℕ))
24		elmapi 8847	. . . . . . . . 9 ⊢ (𝐴 ∈ (ℕ0 ↑m ℕ) → 𝐴:ℕ⟶ℕ0)
25	23, 24	syl 17	. . . . . . . 8 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → 𝐴:ℕ⟶ℕ0)
26		ffn 6717	. . . . . . . 8 ⊢ (𝐴:ℕ⟶ℕ0 → 𝐴 Fn ℕ)
27		elpreima 7059	. . . . . . . 8 ⊢ (𝐴 Fn ℕ → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝑡 ∈ ℕ ∧ (𝐴‘𝑡) ∈ ℕ)))
28	25, 26, 27	3syl 18	. . . . . . 7 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝑡 ∈ ℕ ∧ (𝐴‘𝑡) ∈ ℕ)))
29	28	baibd 539	. . . . . 6 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ ℕ) → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝐴‘𝑡) ∈ ℕ))
30	13, 29	sylan2 592	. . . . 5 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝑡 ∈ (◡𝐴 “ ℕ) ↔ (𝐴‘𝑡) ∈ ℕ))
31	30	biimpar 477	. . . 4 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → 𝑡 ∈ (◡𝐴 “ ℕ))
32	22	simp3bi 1146	. . . . . 6 ⊢ (𝐴 ∈ (𝑇 ∩ 𝑅) → (◡𝐴 “ ℕ) ⊆ 𝐽)
33	32	sselda 3982	. . . . 5 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (◡𝐴 “ ℕ)) → 𝑡 ∈ 𝐽)
34	5	simprbi 496	. . . . 5 ⊢ (𝑡 ∈ 𝐽 → ¬ 2 ∥ 𝑡)
35	33, 34	syl 17	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (◡𝐴 “ ℕ)) → ¬ 2 ∥ 𝑡)
36	12, 31, 35	syl2anc 583	. . 3 ⊢ (((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴‘𝑡) ∈ ℕ) → ¬ 2 ∥ 𝑡)
37	11, 36	pm2.65da 814	. 2 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → ¬ (𝐴‘𝑡) ∈ ℕ)
38	25	adantr 480	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 𝐴:ℕ⟶ℕ0)
39	13	adantl 481	. . . 4 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 𝑡 ∈ ℕ)
40	38, 39	ffvelcdmd 7087	. . 3 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴‘𝑡) ∈ ℕ0)
41		elnn0 12479	. . 3 ⊢ ((𝐴‘𝑡) ∈ ℕ0 ↔ ((𝐴‘𝑡) ∈ ℕ ∨ (𝐴‘𝑡) = 0))
42	40, 41	sylib 217	. 2 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → ((𝐴‘𝑡) ∈ ℕ ∨ (𝐴‘𝑡) = 0))
43		orel1 886	. 2 ⊢ (¬ (𝐴‘𝑡) ∈ ℕ → (((𝐴‘𝑡) ∈ ℕ ∨ (𝐴‘𝑡) = 0) → (𝐴‘𝑡) = 0))
44	37, 42, 43	sylc 65	1 ⊢ ((𝐴 ∈ (𝑇 ∩ 𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴‘𝑡) = 0)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 844   = wceq 1540   ∈ wcel 2105  {cab 2708  ∀wral 3060  {crab 3431   ∖ cdif 3945   ∩ cin 3947   ⊆ wss 3948  ∅c0 4322  𝒫 cpw 4602   class class class wbr 5148  {copab 5210   ↦ cmpt 5231  ^◡ccnv 5675   “ cima 5679   Fn wfn 6538  ⟶wf 6539  ‘cfv 6543  (class class class)co 7412   ∈ cmpo 7414   supp csupp 8150   ↑_m cmap 8824  Fincfn 8943  0cc0 11114  1c1 11115   · cmul 11119   ≤ cle 11254  ℕcn 12217  2c2 12272  ℕ₀cn0 12477  ↑cexp 14032  Σcsu 15637   ∥ cdvds 16202

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7729  ax-1cn 11172  ax-icn 11173  ax-addcl 11174  ax-mulcl 11176  ax-i2m1 11182

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7979  df-2nd 7980  df-map 8826  df-n0 12478

This theorem is referenced by:  eulerpartlemgh  33676