Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eulerpartlemf Structured version   Visualization version   GIF version

Theorem eulerpartlemf 34351
Description: Lemma for eulerpart 34363: Odd partitions are zero for even numbers. (Contributed by Thierry Arnoux, 9-Sep-2017.)
Hypotheses
Ref Expression
eulerpart.p 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ 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 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
Assertion
Ref Expression
eulerpartlemf ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴𝑡) = 0)
Distinct variable groups:   𝑧,𝑡   𝑓,𝑔,𝑘,𝑛,𝑡,𝐴   𝑓,𝐽   𝑓,𝑁   𝑃,𝑔
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧,𝑟)   𝐷(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑟)   𝑃(𝑥,𝑦,𝑧,𝑡,𝑓,𝑘,𝑛,𝑟)   𝑅(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑟)   𝑇(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑟)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑟)   𝐻(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑟)   𝐽(𝑥,𝑦,𝑧,𝑡,𝑔,𝑘,𝑛,𝑟)   𝑀(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑟)   𝑁(𝑥,𝑦,𝑧,𝑡,𝑔,𝑘,𝑛,𝑟)   𝑂(𝑥,𝑦,𝑧,𝑡,𝑓,𝑔,𝑘,𝑛,𝑟)

Proof of Theorem eulerpartlemf
StepHypRef Expression
1 eldif 3972 . . . . . 6 (𝑡 ∈ (ℕ ∖ 𝐽) ↔ (𝑡 ∈ ℕ ∧ ¬ 𝑡𝐽))
2 breq2 5151 . . . . . . . . . . 11 (𝑧 = 𝑡 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑡))
32notbid 318 . . . . . . . . . 10 (𝑧 = 𝑡 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑡))
4 eulerpart.j . . . . . . . . . 10 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
53, 4elrab2 3697 . . . . . . . . 9 (𝑡𝐽 ↔ (𝑡 ∈ ℕ ∧ ¬ 2 ∥ 𝑡))
65simplbi2 500 . . . . . . . 8 (𝑡 ∈ ℕ → (¬ 2 ∥ 𝑡𝑡𝐽))
76con1d 145 . . . . . . 7 (𝑡 ∈ ℕ → (¬ 𝑡𝐽 → 2 ∥ 𝑡))
87imp 406 . . . . . 6 ((𝑡 ∈ ℕ ∧ ¬ 𝑡𝐽) → 2 ∥ 𝑡)
91, 8sylbi 217 . . . . 5 (𝑡 ∈ (ℕ ∖ 𝐽) → 2 ∥ 𝑡)
109adantl 481 . . . 4 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 2 ∥ 𝑡)
1110adantr 480 . . 3 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴𝑡) ∈ ℕ) → 2 ∥ 𝑡)
12 simpll 767 . . . 4 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴𝑡) ∈ ℕ) → 𝐴 ∈ (𝑇𝑅))
13 eldifi 4140 . . . . . 6 (𝑡 ∈ (ℕ ∖ 𝐽) → 𝑡 ∈ ℕ)
14 eulerpart.p . . . . . . . . . . 11 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ 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 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
2214, 15, 16, 4, 17, 18, 19, 20, 21eulerpartlemt0 34350 . . . . . . . . . 10 (𝐴 ∈ (𝑇𝑅) ↔ (𝐴 ∈ (ℕ0m ℕ) ∧ (𝐴 “ ℕ) ∈ Fin ∧ (𝐴 “ ℕ) ⊆ 𝐽))
2322simp1bi 1144 . . . . . . . . 9 (𝐴 ∈ (𝑇𝑅) → 𝐴 ∈ (ℕ0m ℕ))
24 elmapi 8887 . . . . . . . . 9 (𝐴 ∈ (ℕ0m ℕ) → 𝐴:ℕ⟶ℕ0)
2523, 24syl 17 . . . . . . . 8 (𝐴 ∈ (𝑇𝑅) → 𝐴:ℕ⟶ℕ0)
26 ffn 6736 . . . . . . . 8 (𝐴:ℕ⟶ℕ0𝐴 Fn ℕ)
27 elpreima 7077 . . . . . . . 8 (𝐴 Fn ℕ → (𝑡 ∈ (𝐴 “ ℕ) ↔ (𝑡 ∈ ℕ ∧ (𝐴𝑡) ∈ ℕ)))
2825, 26, 273syl 18 . . . . . . 7 (𝐴 ∈ (𝑇𝑅) → (𝑡 ∈ (𝐴 “ ℕ) ↔ (𝑡 ∈ ℕ ∧ (𝐴𝑡) ∈ ℕ)))
2928baibd 539 . . . . . 6 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ ℕ) → (𝑡 ∈ (𝐴 “ ℕ) ↔ (𝐴𝑡) ∈ ℕ))
3013, 29sylan2 593 . . . . 5 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝑡 ∈ (𝐴 “ ℕ) ↔ (𝐴𝑡) ∈ ℕ))
3130biimpar 477 . . . 4 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴𝑡) ∈ ℕ) → 𝑡 ∈ (𝐴 “ ℕ))
3222simp3bi 1146 . . . . . 6 (𝐴 ∈ (𝑇𝑅) → (𝐴 “ ℕ) ⊆ 𝐽)
3332sselda 3994 . . . . 5 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (𝐴 “ ℕ)) → 𝑡𝐽)
345simprbi 496 . . . . 5 (𝑡𝐽 → ¬ 2 ∥ 𝑡)
3533, 34syl 17 . . . 4 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (𝐴 “ ℕ)) → ¬ 2 ∥ 𝑡)
3612, 31, 35syl2anc 584 . . 3 (((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) ∧ (𝐴𝑡) ∈ ℕ) → ¬ 2 ∥ 𝑡)
3711, 36pm2.65da 817 . 2 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → ¬ (𝐴𝑡) ∈ ℕ)
3825adantr 480 . . . 4 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 𝐴:ℕ⟶ℕ0)
3913adantl 481 . . . 4 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → 𝑡 ∈ ℕ)
4038, 39ffvelcdmd 7104 . . 3 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴𝑡) ∈ ℕ0)
41 elnn0 12525 . . 3 ((𝐴𝑡) ∈ ℕ0 ↔ ((𝐴𝑡) ∈ ℕ ∨ (𝐴𝑡) = 0))
4240, 41sylib 218 . 2 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → ((𝐴𝑡) ∈ ℕ ∨ (𝐴𝑡) = 0))
43 orel1 888 . 2 (¬ (𝐴𝑡) ∈ ℕ → (((𝐴𝑡) ∈ ℕ ∨ (𝐴𝑡) = 0) → (𝐴𝑡) = 0))
4437, 42, 43sylc 65 1 ((𝐴 ∈ (𝑇𝑅) ∧ 𝑡 ∈ (ℕ ∖ 𝐽)) → (𝐴𝑡) = 0)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 847   = wceq 1536  wcel 2105  {cab 2711  wral 3058  {crab 3432  cdif 3959  cin 3961  wss 3962  c0 4338  𝒫 cpw 4604   class class class wbr 5147  {copab 5209  cmpt 5230  ccnv 5687  cima 5691   Fn wfn 6557  wf 6558  cfv 6562  (class class class)co 7430  cmpo 7432   supp csupp 8183  m cmap 8864  Fincfn 8983  0cc0 11152  1c1 11153   · cmul 11157  cle 11293  cn 12263  2c2 12318  0cn0 12523  cexp 14098  Σcsu 15718  cdvds 16286
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753  ax-1cn 11210  ax-icn 11211  ax-addcl 11212  ax-mulcl 11214  ax-i2m1 11220
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-iun 4997  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-fv 6570  df-ov 7433  df-oprab 7434  df-mpo 7435  df-1st 8012  df-2nd 8013  df-map 8866  df-n0 12524
This theorem is referenced by:  eulerpartlemgh  34359
  Copyright terms: Public domain W3C validator