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 32241
Description: Lemma for eulerpart 32249. (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 3899 . . . 4 ( ∈ (𝑇𝑅) ↔ (𝑇𝑅))
21anbi1i 623 . . 3 (( ∈ (𝑇𝑅) ∧ 𝑃) ↔ ((𝑇𝑅) ∧ 𝑃))
3 elin 3899 . . 3 ( ∈ ((𝑇𝑅) ∩ 𝑃) ↔ ( ∈ (𝑇𝑅) ∧ 𝑃))
4 eulerpart.p . . . . 5 𝑃 = {𝑓 ∈ (ℕ0m ℕ) ∣ ((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁)}
5 eulerpart.o . . . . 5 𝑂 = {𝑔𝑃 ∣ ∀𝑛 ∈ (𝑔 “ ℕ) ¬ 2 ∥ 𝑛}
6 eulerpart.d . . . . 5 𝐷 = {𝑔𝑃 ∣ ∀𝑛 ∈ ℕ (𝑔𝑛) ≤ 1}
74, 5, 6eulerpartlemo 32232 . . . 4 (𝑂 ↔ (𝑃 ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))
8 cnveq 5771 . . . . . . . . . . . . . . . . 17 (𝑓 = 𝑓 = )
98imaeq1d 5957 . . . . . . . . . . . . . . . 16 (𝑓 = → (𝑓 “ ℕ) = ( “ ℕ))
109eleq1d 2823 . . . . . . . . . . . . . . 15 (𝑓 = → ((𝑓 “ ℕ) ∈ Fin ↔ ( “ ℕ) ∈ Fin))
11 fveq1 6755 . . . . . . . . . . . . . . . . . 18 (𝑓 = → (𝑓𝑘) = (𝑘))
1211oveq1d 7270 . . . . . . . . . . . . . . . . 17 (𝑓 = → ((𝑓𝑘) · 𝑘) = ((𝑘) · 𝑘))
1312sumeq2sdv 15344 . . . . . . . . . . . . . . . 16 (𝑓 = → Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = Σ𝑘 ∈ ℕ ((𝑘) · 𝑘))
1413eqeq1d 2740 . . . . . . . . . . . . . . 15 (𝑓 = → (Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁 ↔ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁))
1510, 14anbi12d 630 . . . . . . . . . . . . . 14 (𝑓 = → (((𝑓 “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑓𝑘) · 𝑘) = 𝑁) ↔ (( “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁)))
1615, 4elrab2 3620 . . . . . . . . . . . . 13 (𝑃 ↔ ( ∈ (ℕ0m ℕ) ∧ (( “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁)))
1716simplbi 497 . . . . . . . . . . . 12 (𝑃 ∈ (ℕ0m ℕ))
18 cnvimass 5978 . . . . . . . . . . . . 13 ( “ ℕ) ⊆ dom
19 nn0ex 12169 . . . . . . . . . . . . . . 15 0 ∈ V
20 nnex 11909 . . . . . . . . . . . . . . 15 ℕ ∈ V
2119, 20elmap 8617 . . . . . . . . . . . . . 14 ( ∈ (ℕ0m ℕ) ↔ :ℕ⟶ℕ0)
22 fdm 6593 . . . . . . . . . . . . . 14 (:ℕ⟶ℕ0 → dom = ℕ)
2321, 22sylbi 216 . . . . . . . . . . . . 13 ( ∈ (ℕ0m ℕ) → dom = ℕ)
2418, 23sseqtrid 3969 . . . . . . . . . . . 12 ( ∈ (ℕ0m ℕ) → ( “ ℕ) ⊆ ℕ)
2517, 24syl 17 . . . . . . . . . . 11 (𝑃 → ( “ ℕ) ⊆ ℕ)
2625sselda 3917 . . . . . . . . . 10 ((𝑃𝑛 ∈ ( “ ℕ)) → 𝑛 ∈ ℕ)
2726ralrimiva 3107 . . . . . . . . 9 (𝑃 → ∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ)
2827biantrurd 532 . . . . . . . 8 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)))
2917biantrurd 532 . . . . . . . 8 (𝑃 → ((∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛) ↔ ( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))))
3016simprbi 496 . . . . . . . . . 10 (𝑃 → (( “ ℕ) ∈ Fin ∧ Σ𝑘 ∈ ℕ ((𝑘) · 𝑘) = 𝑁))
3130simpld 494 . . . . . . . . 9 (𝑃 → ( “ ℕ) ∈ Fin)
3231biantrud 531 . . . . . . . 8 (𝑃 → (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ↔ (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ∧ ( “ ℕ) ∈ Fin)))
3328, 29, 323bitrd 304 . . . . . . 7 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ∧ ( “ ℕ) ∈ Fin)))
34 dfss3 3905 . . . . . . . . . 10 (( “ ℕ) ⊆ 𝐽 ↔ ∀𝑛 ∈ ( “ ℕ)𝑛𝐽)
35 breq2 5074 . . . . . . . . . . . . 13 (𝑧 = 𝑛 → (2 ∥ 𝑧 ↔ 2 ∥ 𝑛))
3635notbid 317 . . . . . . . . . . . 12 (𝑧 = 𝑛 → (¬ 2 ∥ 𝑧 ↔ ¬ 2 ∥ 𝑛))
37 eulerpart.j . . . . . . . . . . . 12 𝐽 = {𝑧 ∈ ℕ ∣ ¬ 2 ∥ 𝑧}
3836, 37elrab2 3620 . . . . . . . . . . 11 (𝑛𝐽 ↔ (𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
3938ralbii 3090 . . . . . . . . . 10 (∀𝑛 ∈ ( “ ℕ)𝑛𝐽 ↔ ∀𝑛 ∈ ( “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛))
40 r19.26 3094 . . . . . . . . . 10 (∀𝑛 ∈ ( “ ℕ)(𝑛 ∈ ℕ ∧ ¬ 2 ∥ 𝑛) ↔ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))
4134, 39, 403bitri 296 . . . . . . . . 9 (( “ ℕ) ⊆ 𝐽 ↔ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛))
4241anbi2i 622 . . . . . . . 8 (( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ↔ ( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)))
4342anbi1i 623 . . . . . . 7 ((( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ∧ ( “ ℕ) ∈ Fin) ↔ (( ∈ (ℕ0m ℕ) ∧ (∀𝑛 ∈ ( “ ℕ)𝑛 ∈ ℕ ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛)) ∧ ( “ ℕ) ∈ Fin))
4433, 43bitr4di 288 . . . . . 6 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ∧ ( “ ℕ) ∈ Fin)))
459sseq1d 3948 . . . . . . . 8 (𝑓 = → ((𝑓 “ ℕ) ⊆ 𝐽 ↔ ( “ ℕ) ⊆ 𝐽))
46 eulerpart.t . . . . . . . 8 𝑇 = {𝑓 ∈ (ℕ0m ℕ) ∣ (𝑓 “ ℕ) ⊆ 𝐽}
4745, 46elrab2 3620 . . . . . . 7 (𝑇 ↔ ( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽))
48 vex 3426 . . . . . . . 8 ∈ V
49 eulerpart.r . . . . . . . 8 𝑅 = {𝑓 ∣ (𝑓 “ ℕ) ∈ Fin}
5048, 10, 49elab2 3606 . . . . . . 7 (𝑅 ↔ ( “ ℕ) ∈ Fin)
5147, 50anbi12i 626 . . . . . 6 ((𝑇𝑅) ↔ (( ∈ (ℕ0m ℕ) ∧ ( “ ℕ) ⊆ 𝐽) ∧ ( “ ℕ) ∈ Fin))
5244, 51bitr4di 288 . . . . 5 (𝑃 → (∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛 ↔ (𝑇𝑅)))
5352pm5.32i 574 . . . 4 ((𝑃 ∧ ∀𝑛 ∈ ( “ ℕ) ¬ 2 ∥ 𝑛) ↔ (𝑃 ∧ (𝑇𝑅)))
54 ancom 460 . . . 4 ((𝑃 ∧ (𝑇𝑅)) ↔ ((𝑇𝑅) ∧ 𝑃))
557, 53, 543bitri 296 . . 3 (𝑂 ↔ ((𝑇𝑅) ∧ 𝑃))
562, 3, 553bitr4ri 303 . 2 (𝑂 ∈ ((𝑇𝑅) ∩ 𝑃))
5756eqriv 2735 1 𝑂 = ((𝑇𝑅) ∩ 𝑃)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1539  wcel 2108  {cab 2715  wral 3063  {crab 3067  cin 3882  wss 3883  c0 4253  𝒫 cpw 4530   class class class wbr 5070  {copab 5132  cmpt 5153  ccnv 5579  dom cdm 5580  cres 5582  cima 5583  ccom 5584  wf 6414  cfv 6418  (class class class)co 7255  cmpo 7257   supp csupp 7948  m cmap 8573  Fincfn 8691  1c1 10803   · cmul 10807  cle 10941  cn 11903  2c2 11958  0cn0 12163  cexp 13710  Σcsu 15325  cdvds 15891  bitscbits 16054  𝟭cind 31878
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-er 8456  df-map 8575  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-nn 11904  df-n0 12164  df-z 12250  df-uz 12512  df-fz 13169  df-seq 13650  df-sum 15326
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator