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

Theorem eulerpartlemgu 29212
Description: Lemma for eulerpart 29217: Rewriting the  U set for an odd partition Note that interestingly, this proof reuses marypha2lem2 7954. (Contributed by Thierry Arnoux, 10-Aug-2018.)
Hypotheses
Ref Expression
eulerpart.p  |-  P  =  { f  e.  ( NN0  ^m  NN )  |  ( ( `' f " NN )  e.  Fin  /\  sum_ k  e.  NN  (
( f `  k
)  x.  k )  =  N ) }
eulerpart.o  |-  O  =  { g  e.  P  |  A. n  e.  ( `' g " NN )  -.  2  ||  n }
eulerpart.d  |-  D  =  { g  e.  P  |  A. n  e.  NN  ( g `  n
)  <_  1 }
eulerpart.j  |-  J  =  { z  e.  NN  |  -.  2  ||  z }
eulerpart.f  |-  F  =  ( x  e.  J ,  y  e.  NN0  |->  ( ( 2 ^ y )  x.  x
) )
eulerpart.h  |-  H  =  { r  e.  ( ( ~P NN0  i^i  Fin )  ^m  J )  |  ( r supp  (/) )  e. 
Fin }
eulerpart.m  |-  M  =  ( r  e.  H  |->  { <. x ,  y
>.  |  ( x  e.  J  /\  y  e.  ( r `  x
) ) } )
eulerpart.r  |-  R  =  { f  |  ( `' f " NN )  e.  Fin }
eulerpart.t  |-  T  =  { f  e.  ( NN0  ^m  NN )  |  ( `' f
" NN )  C_  J }
eulerpart.g  |-  G  =  ( o  e.  ( T  i^i  R ) 
|->  ( (𝟭 `  NN ) `  ( F " ( M `  (bits  o.  ( o  |`  J ) ) ) ) ) )
eulerpartlemgh.1  |-  U  = 
U_ t  e.  ( ( `' A " NN )  i^i  J ) ( { t }  X.  (bits `  ( A `  t )
) )
Assertion
Ref Expression
eulerpartlemgu  |-  ( A  e.  ( T  i^i  R )  ->  U  =  { <. t ,  n >.  |  ( t  e.  ( ( `' A " NN )  i^i  J
)  /\  n  e.  ( (bits  o.  A
) `  t )
) } )
Distinct variable groups:    z, t    f, g, k, n, t, A    f, J, n, t    f, N, k, n, t    n, O, t    P, g, k    R, f, k, n, t    T, n, t
Allowed substitution hints:    A( x, y, z, o, r)    D( x, y, z, t, f, g, k, n, o, r)    P( x, y, z, t, f, n, o, r)    R( x, y, z, g, o, r)    T( x, y, z, f, g, k, o, r)    U( x, y, z, t, f, g, k, n, o, r)    F( x, y, z, t, f, g, k, n, o, r)    G( x, y, z, t, f, g, k, n, o, r)    H( x, y, z, t, f, g, k, n, o, r)    J( x, y, z, g, k, o, r)    M( x, y, z, t, f, g, k, n, o, r)    N( x, y, z, g, o, r)    O( x, y, z, f, g, k, o, r)

Proof of Theorem eulerpartlemgu
StepHypRef Expression
1 eulerpartlemgh.1 . 2  |-  U  = 
U_ t  e.  ( ( `' A " NN )  i^i  J ) ( { t }  X.  (bits `  ( A `  t )
) )
2 eqid 2423 . . . 4  |-  U_ t  e.  ( ( `' A " NN )  i^i  J
) ( { t }  X.  ( (bits 
o.  A ) `  t ) )  = 
U_ t  e.  ( ( `' A " NN )  i^i  J ) ( { t }  X.  ( (bits  o.  A ) `  t
) )
32marypha2lem2 7954 . . 3  |-  U_ t  e.  ( ( `' A " NN )  i^i  J
) ( { t }  X.  ( (bits 
o.  A ) `  t ) )  =  { <. t ,  n >.  |  ( t  e.  ( ( `' A " NN )  i^i  J
)  /\  n  e.  ( (bits  o.  A
) `  t )
) }
4 eulerpart.p . . . . . . . . . . 11  |-  P  =  { f  e.  ( NN0  ^m  NN )  |  ( ( `' f " NN )  e.  Fin  /\  sum_ k  e.  NN  (
( f `  k
)  x.  k )  =  N ) }
5 eulerpart.o . . . . . . . . . . 11  |-  O  =  { g  e.  P  |  A. n  e.  ( `' g " NN )  -.  2  ||  n }
6 eulerpart.d . . . . . . . . . . 11  |-  D  =  { g  e.  P  |  A. n  e.  NN  ( g `  n
)  <_  1 }
7 eulerpart.j . . . . . . . . . . 11  |-  J  =  { z  e.  NN  |  -.  2  ||  z }
8 eulerpart.f . . . . . . . . . . 11  |-  F  =  ( x  e.  J ,  y  e.  NN0  |->  ( ( 2 ^ y )  x.  x
) )
9 eulerpart.h . . . . . . . . . . 11  |-  H  =  { r  e.  ( ( ~P NN0  i^i  Fin )  ^m  J )  |  ( r supp  (/) )  e. 
Fin }
10 eulerpart.m . . . . . . . . . . 11  |-  M  =  ( r  e.  H  |->  { <. x ,  y
>.  |  ( x  e.  J  /\  y  e.  ( r `  x
) ) } )
11 eulerpart.r . . . . . . . . . . 11  |-  R  =  { f  |  ( `' f " NN )  e.  Fin }
12 eulerpart.t . . . . . . . . . . 11  |-  T  =  { f  e.  ( NN0  ^m  NN )  |  ( `' f
" NN )  C_  J }
134, 5, 6, 7, 8, 9, 10, 11, 12eulerpartlemt0 29204 . . . . . . . . . 10  |-  ( A  e.  ( T  i^i  R )  <->  ( A  e.  ( NN0  ^m  NN )  /\  ( `' A " NN )  e.  Fin  /\  ( `' A " NN )  C_  J ) )
1413simp1bi 1021 . . . . . . . . 9  |-  ( A  e.  ( T  i^i  R )  ->  A  e.  ( NN0  ^m  NN ) )
15 elmapi 7499 . . . . . . . . 9  |-  ( A  e.  ( NN0  ^m  NN )  ->  A : NN
--> NN0 )
1614, 15syl 17 . . . . . . . 8  |-  ( A  e.  ( T  i^i  R )  ->  A : NN
--> NN0 )
1716adantr 467 . . . . . . 7  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( ( `' A " NN )  i^i  J ) )  ->  A : NN --> NN0 )
18 ffun 5746 . . . . . . 7  |-  ( A : NN --> NN0  ->  Fun 
A )
1917, 18syl 17 . . . . . 6  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( ( `' A " NN )  i^i  J ) )  ->  Fun  A )
20 inss1 3683 . . . . . . . . 9  |-  ( ( `' A " NN )  i^i  J )  C_  ( `' A " NN )
21 cnvimass 5205 . . . . . . . . . 10  |-  ( `' A " NN ) 
C_  dom  A
22 fdm 5748 . . . . . . . . . . 11  |-  ( A : NN --> NN0  ->  dom 
A  =  NN )
2316, 22syl 17 . . . . . . . . . 10  |-  ( A  e.  ( T  i^i  R )  ->  dom  A  =  NN )
2421, 23syl5sseq 3513 . . . . . . . . 9  |-  ( A  e.  ( T  i^i  R )  ->  ( `' A " NN )  C_  NN )
2520, 24syl5ss 3476 . . . . . . . 8  |-  ( A  e.  ( T  i^i  R )  ->  ( ( `' A " NN )  i^i  J )  C_  NN )
2625sselda 3465 . . . . . . 7  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( ( `' A " NN )  i^i  J ) )  ->  t  e.  NN )
2723eleq2d 2493 . . . . . . . 8  |-  ( A  e.  ( T  i^i  R )  ->  ( t  e.  dom  A  <->  t  e.  NN ) )
2827adantr 467 . . . . . . 7  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( ( `' A " NN )  i^i  J ) )  ->  ( t  e. 
dom  A  <->  t  e.  NN ) )
2926, 28mpbird 236 . . . . . 6  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( ( `' A " NN )  i^i  J ) )  ->  t  e.  dom  A )
30 fvco 5955 . . . . . 6  |-  ( ( Fun  A  /\  t  e.  dom  A )  -> 
( (bits  o.  A
) `  t )  =  (bits `  ( A `  t ) ) )
3119, 29, 30syl2anc 666 . . . . 5  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( ( `' A " NN )  i^i  J ) )  ->  ( (bits  o.  A ) `  t
)  =  (bits `  ( A `  t ) ) )
3231xpeq2d 4875 . . . 4  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( ( `' A " NN )  i^i  J ) )  ->  ( { t }  X.  ( (bits 
o.  A ) `  t ) )  =  ( { t }  X.  (bits `  ( A `  t )
) ) )
3332iuneq2dv 4319 . . 3  |-  ( A  e.  ( T  i^i  R )  ->  U_ t  e.  ( ( `' A " NN )  i^i  J
) ( { t }  X.  ( (bits 
o.  A ) `  t ) )  = 
U_ t  e.  ( ( `' A " NN )  i^i  J ) ( { t }  X.  (bits `  ( A `  t )
) ) )
343, 33syl5reqr 2479 . 2  |-  ( A  e.  ( T  i^i  R )  ->  U_ t  e.  ( ( `' A " NN )  i^i  J
) ( { t }  X.  (bits `  ( A `  t ) ) )  =  { <. t ,  n >.  |  ( t  e.  ( ( `' A " NN )  i^i  J )  /\  n  e.  ( (bits  o.  A ) `
 t ) ) } )
351, 34syl5eq 2476 1  |-  ( A  e.  ( T  i^i  R )  ->  U  =  { <. t ,  n >.  |  ( t  e.  ( ( `' A " NN )  i^i  J
)  /\  n  e.  ( (bits  o.  A
) `  t )
) } )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 188    /\ wa 371    = wceq 1438    e. wcel 1869   {cab 2408   A.wral 2776   {crab 2780    i^i cin 3436    C_ wss 3437   (/)c0 3762   ~Pcpw 3980   {csn 3997   U_ciun 4297   class class class wbr 4421   {copab 4479    |-> cmpt 4480    X. cxp 4849   `'ccnv 4850   dom cdm 4851    |` cres 4853   "cima 4854    o. ccom 4855   Fun wfun 5593   -->wf 5595   ` cfv 5599  (class class class)co 6303    |-> cmpt2 6305   supp csupp 6923    ^m cmap 7478   Fincfn 7575   1c1 9542    x. cmul 9546    <_ cle 9678   NNcn 10611   2c2 10661   NN0cn0 10871   ^cexp 12273   sum_csu 13745    || cdvds 14298  bitscbits 14385  𝟭cind 28834
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1666  ax-4 1679  ax-5 1749  ax-6 1795  ax-7 1840  ax-8 1871  ax-9 1873  ax-10 1888  ax-11 1893  ax-12 1906  ax-13 2054  ax-ext 2401  ax-sep 4544  ax-nul 4553  ax-pow 4600  ax-pr 4658  ax-un 6595
This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3an 985  df-tru 1441  df-ex 1661  df-nf 1665  df-sb 1788  df-eu 2270  df-mo 2271  df-clab 2409  df-cleq 2415  df-clel 2418  df-nfc 2573  df-ne 2621  df-ral 2781  df-rex 2782  df-rab 2785  df-v 3084  df-sbc 3301  df-csb 3397  df-dif 3440  df-un 3442  df-in 3444  df-ss 3451  df-nul 3763  df-if 3911  df-pw 3982  df-sn 3998  df-pr 4000  df-op 4004  df-uni 4218  df-iun 4299  df-br 4422  df-opab 4481  df-mpt 4482  df-id 4766  df-xp 4857  df-rel 4858  df-cnv 4859  df-co 4860  df-dm 4861  df-rn 4862  df-res 4863  df-ima 4864  df-iota 5563  df-fun 5601  df-fn 5602  df-f 5603  df-fv 5607  df-ov 6306  df-oprab 6307  df-mpt2 6308  df-1st 6805  df-2nd 6806  df-map 7480
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator