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

Theorem eulerpartlemr 32025
Description: Lemma for eulerpart 32033. (Contributed by Thierry Arnoux, 13-Nov-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 ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
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.
StepHypRef Expression
1 elin 3873 . . . 4 ( ∈ (𝑇𝑅) ↔ (𝑇𝑅))
21anbi1i 627 . . 3 (( ∈ (𝑇𝑅) ∧ 𝑃) ↔ ((𝑇𝑅) ∧ 𝑃))
3 elin 3873 . . 3 ( ∈ ((𝑇𝑅) ∩ 𝑃) ↔ ( ∈ (𝑇𝑅) ∧ 𝑃))
4 eulerpart.p . . . . 5 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁)}
5 eulerpart.o . . . . 5 𝑂 = {𝑔𝑃 ∣ ∀𝑛 ∈ (𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
6 eulerpart.d . . . . 5 𝐷 = {𝑔𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔𝑛) ≤ 1}
74, 5, 6eulerpartlemo 32016 . . . 4 (𝑂 ↔ (𝑃 ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))
8 cnveq 5731 . . . . . . . . . . . . . . . . 17 (𝑓 = 𝑓 = )
98imaeq1d 5917 . . . . . . . . . . . . . . . 16 (𝑓 = → (𝑓 “ ℕ) = ( “ ℕ))
109eleq1d 2818 . . . . . . . . . . . . . . 15 (𝑓 = → ((𝑓 “ ℕ) ∈ Fin ↔ ( “ ℕ) ∈ Fin))
11 fveq1 6705 . . . . . . . . . . . . . . . . . 18 (𝑓 = → (𝑓𝑘) = (𝑘))
1211oveq1d 7217 . . . . . . . . . . . . . . . . 17 (𝑓 = → ((𝑓𝑘) · 𝑘) = ((𝑘) · 𝑘))
1312sumeq2sdv 15251 . . . . . . . . . . . . . . . 16 (𝑓 = → Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝑘) · 𝑘))
1413eqeq1d 2736 . . . . . . . . . . . . . . 15 (𝑓 = → (Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁 ↔ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁))
1510, 14anbi12d 634 . . . . . . . . . . . . . 14 (𝑓 = → (((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁) ↔ (( “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁)))
1615, 4elrab2 3598 . . . . . . . . . . . . 13 (𝑃 ↔ ( ∈ (ℕ0m ℕ) ∧ (( “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁)))
1716simplbi 501 . . . . . . . . . . . 12 (𝑃 ∈ (ℕ0m ℕ))
18 cnvimass 5938 . . . . . . . . . . . . 13 ( “ ℕ) ⊆ dom
19 nn0ex 12079 . . . . . . . . . . . . . . 15 0 ∈ V
20 nnex 11819 . . . . . . . . . . . . . . 15 ℕ ∈ V
2119, 20elmap 8541 . . . . . . . . . . . . . 14 ( ∈ (ℕ0m ℕ) ↔ :ℕ⟶ℕ0)
22 fdm 6543 . . . . . . . . . . . . . 14 (:ℕ⟶ℕ0 → dom = ℕ)
2321, 22sylbi 220 . . . . . . . . . . . . 13 ( ∈ (ℕ0m ℕ) → dom = ℕ)
2418, 23sseqtrid 3943 . . . . . . . . . . . 12 ( ∈ (ℕ0m ℕ) → ( “ ℕ) ⊆ ℕ)
2517, 24syl 17 . . . . . . . . . . 11 (𝑃 → ( “ ℕ) ⊆ ℕ)
2625sselda 3891 . . . . . . . . . 10 ((𝑃𝑛 ∈ ( “ ℕ)) → 𝑛 ∈ ℕ)
2726ralrimiva 3098 . . . . . . . . 9 (𝑃 → ∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ)
2827biantrurd 536 . . . . . . . 8 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)))
2917biantrurd 536 . . . . . . . 8 (𝑃 → ((∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛) ↔ ( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))))
3016simprbi 500 . . . . . . . . . 10 (𝑃 → (( “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁))
3130simpld 498 . . . . . . . . 9 (𝑃 → ( “ ℕ) ∈ Fin)
3231biantrud 535 . . . . . . . 8 (𝑃 → (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ↔ (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ∧ ( “ ℕ) ∈ Fin)))
3328, 29, 323bitrd 308 . . . . . . 7 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ∧ ( “ ℕ) ∈ Fin)))
34 dfss3 3879 . . . . . . . . . 10 (( “ ℕ) ⊆ 𝐽 ↔ ∀𝑛 ∈ ( “ ℕ)𝑛𝐽)
35 breq2 5047 . . . . . . . . . . . . 13 (𝑧 = 𝑛 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑛))
3635notbid 321 . . . . . . . . . . . 12 (𝑧 = 𝑛 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑛))
37 eulerpart.j . . . . . . . . . . . 12 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
3836, 37elrab2 3598 . . . . . . . . . . 11 (𝑛𝐽 ↔ (𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
3938ralbii 3081 . . . . . . . . . 10 (∀𝑛 ∈ ( “ ℕ)𝑛𝐽 ↔ ∀𝑛 ∈ ( “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
40 r19.26 3085 . . . . . . . . . 10 (∀𝑛 ∈ ( “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛) ↔ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))
4134, 39, 403bitri 300 . . . . . . . . 9 (( “ ℕ) ⊆ 𝐽 ↔ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))
4241anbi2i 626 . . . . . . . 8 (( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ↔ ( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)))
4342anbi1i 627 . . . . . . 7 ((( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ∧ ( “ ℕ) ∈ Fin) ↔ (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ∧ ( “ ℕ) ∈ Fin))
4433, 43bitr4di 292 . . . . . 6 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ∧ ( “ ℕ) ∈ Fin)))
459sseq1d 3922 . . . . . . . 8 (𝑓 = → ((𝑓 “ ℕ) ⊆ 𝐽 ↔ ( “ ℕ) ⊆ 𝐽))
46 eulerpart.t . . . . . . . 8 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
4745, 46elrab2 3598 . . . . . . 7 (𝑇 ↔ ( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽))
48 vex 3405 . . . . . . . 8 ∈ V
49 eulerpart.r . . . . . . . 8 𝑅 = {𝑓 ∣ (𝑓 “ ℕ) ∈ Fin}
5048, 10, 49elab2 3584 . . . . . . 7 (𝑅 ↔ ( “ ℕ) ∈ Fin)
5147, 50anbi12i 630 . . . . . 6 ((𝑇𝑅) ↔ (( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ∧ ( “ ℕ) ∈ Fin))
5244, 51bitr4di 292 . . . . 5 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (𝑇𝑅)))
5352pm5.32i 578 . . . 4 ((𝑃 ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛) ↔ (𝑃 ∧ (𝑇𝑅)))
54 ancom 464 . . . 4 ((𝑃 ∧ (𝑇𝑅)) ↔ ((𝑇𝑅) ∧ 𝑃))
557, 53, 543bitri 300 . . 3 (𝑂 ↔ ((𝑇𝑅) ∧ 𝑃))
562, 3, 553bitr4ri 307 . 2 (𝑂 ∈ ((𝑇𝑅) ∩ 𝑃))
5756eqriv 2731 1 𝑂 = ((𝑇𝑅) ∩ 𝑃)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 399   = wceq 1543  wcel 2110  {cab 2712  wral 3054  {crab 3058  cin 3856  wss 3857  c0 4227  𝒫 cpw 4503   class class class wbr 5043  {copab 5105  cmpt 5124  ccnv 5539  dom cdm 5540  cres 5542  cima 5543  ccom 5544  wf 6365  cfv 6369  (class class class)co 7202  cmpo 7204   supp csupp 7892  m cmap 8497  Fincfn 8615  1c1 10713   · cmul 10717  cle 10851  cn 11813  2c2 11868  0cn0 12073  cexp 13618  Σcsu 15232  cdvds 15796  bitscbits 15959  𝟭cind 31662
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2706  ax-sep 5181  ax-nul 5188  ax-pow 5247  ax-pr 5311  ax-un 7512  ax-cnex 10768  ax-resscn 10769  ax-1cn 10770  ax-icn 10771  ax-addcl 10772  ax-addrcl 10773  ax-mulcl 10774  ax-mulrcl 10775  ax-mulcom 10776  ax-addass 10777  ax-mulass 10778  ax-distr 10779  ax-i2m1 10780  ax-1ne0 10781  ax-1rid 10782  ax-rnegex 10783  ax-rrecex 10784  ax-cnre 10785  ax-pre-lttri 10786  ax-pre-lttrn 10787  ax-pre-ltadd 10788  ax-pre-mulgt0 10789
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2537  df-eu 2566  df-clab 2713  df-cleq 2726  df-clel 2812  df-nfc 2882  df-ne 2936  df-nel 3040  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3403  df-sbc 3688  df-csb 3803  df-dif 3860  df-un 3862  df-in 3864  df-ss 3874  df-pss 3876  df-nul 4228  df-if 4430  df-pw 4505  df-sn 4532  df-pr 4534  df-tp 4536  df-op 4538  df-uni 4810  df-iun 4896  df-br 5044  df-opab 5106  df-mpt 5125  df-tr 5151  df-id 5444  df-eprel 5449  df-po 5457  df-so 5458  df-fr 5498  df-we 5500  df-xp 5546  df-rel 5547  df-cnv 5548  df-co 5549  df-dm 5550  df-rn 5551  df-res 5552  df-ima 5553  df-pred 6149  df-ord 6205  df-on 6206  df-lim 6207  df-suc 6208  df-iota 6327  df-fun 6371  df-fn 6372  df-f 6373  df-f1 6374  df-fo 6375  df-f1o 6376  df-fv 6377  df-riota 7159  df-ov 7205  df-oprab 7206  df-mpo 7207  df-om 7634  df-1st 7750  df-2nd 7751  df-wrecs 8036  df-recs 8097  df-rdg 8135  df-er 8380  df-map 8499  df-en 8616  df-dom 8617  df-sdom 8618  df-pnf 10852  df-mnf 10853  df-xr 10854  df-ltxr 10855  df-le 10856  df-sub 11047  df-neg 11048  df-nn 11814  df-n0 12074  df-z 12160  df-uz 12422  df-fz 13079  df-seq 13558  df-sum 15233
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator