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

Theorem eulerpartlemf 27935
Description: Lemma for eulerpart 27947: Odd partitions are zero for even numbers. (Contributed by Thierry Arnoux, 9-Sep-2017.)
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 }
Assertion
Ref Expression
eulerpartlemf  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  -> 
( A `  t
)  =  0 )
Distinct variable groups:    z, t    f, g, k, n, t, A    f, J    f, N    P, g
Allowed substitution hints:    A( x, y, z, r)    D( x, y, z, t, f, g, k, n, r)    P( x, y, z, t, f, k, n, r)    R( x, y, z, t, f, g, k, n, r)    T( x, y, z, t, f, g, k, n, r)    F( x, y, z, t, f, g, k, n, r)    H( x, y, z, t, f, g, k, n, r)    J( x, y, z, t, g, k, n, r)    M( x, y, z, t, f, g, k, n, r)    N( x, y, z, t, g, k, n, r)    O( x, y, z, t, f, g, k, n, r)

Proof of Theorem eulerpartlemf
StepHypRef Expression
1 eldif 3479 . . . . . 6  |-  ( t  e.  ( NN  \  J )  <->  ( t  e.  NN  /\  -.  t  e.  J ) )
2 breq2 4444 . . . . . . . . . . 11  |-  ( z  =  t  ->  (
2  ||  z  <->  2  ||  t ) )
32notbid 294 . . . . . . . . . 10  |-  ( z  =  t  ->  ( -.  2  ||  z  <->  -.  2  ||  t ) )
4 eulerpart.j . . . . . . . . . 10  |-  J  =  { z  e.  NN  |  -.  2  ||  z }
53, 4elrab2 3256 . . . . . . . . 9  |-  ( t  e.  J  <->  ( t  e.  NN  /\  -.  2  ||  t ) )
65simplbi2 625 . . . . . . . 8  |-  ( t  e.  NN  ->  ( -.  2  ||  t  -> 
t  e.  J ) )
76con1d 124 . . . . . . 7  |-  ( t  e.  NN  ->  ( -.  t  e.  J  ->  2  ||  t ) )
87imp 429 . . . . . 6  |-  ( ( t  e.  NN  /\  -.  t  e.  J
)  ->  2  ||  t )
91, 8sylbi 195 . . . . 5  |-  ( t  e.  ( NN  \  J )  ->  2  ||  t )
109adantl 466 . . . 4  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  -> 
2  ||  t )
1110adantr 465 . . 3  |-  ( ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  /\  ( A `
 t )  e.  NN )  ->  2  ||  t )
12 simpll 753 . . . 4  |-  ( ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  /\  ( A `
 t )  e.  NN )  ->  A  e.  ( T  i^i  R
) )
13 eldifi 3619 . . . . . 6  |-  ( t  e.  ( NN  \  J )  ->  t  e.  NN )
14 eulerpart.p . . . . . . . . . . 11  |-  P  =  { f  e.  ( NN0  ^m  NN )  |  ( ( `' f " NN )  e.  Fin  /\  sum_ k  e.  NN  (
( f `  k
)  x.  k )  =  N ) }
15 eulerpart.o . . . . . . . . . . 11  |-  O  =  { g  e.  P  |  A. n  e.  ( `' g " NN )  -.  2  ||  n }
16 eulerpart.d . . . . . . . . . . 11  |-  D  =  { g  e.  P  |  A. n  e.  NN  ( g `  n
)  <_  1 }
17 eulerpart.f . . . . . . . . . . 11  |-  F  =  ( x  e.  J ,  y  e.  NN0  |->  ( ( 2 ^ y )  x.  x
) )
18 eulerpart.h . . . . . . . . . . 11  |-  H  =  { r  e.  ( ( ~P NN0  i^i  Fin )  ^m  J )  |  ( r supp  (/) )  e. 
Fin }
19 eulerpart.m . . . . . . . . . . 11  |-  M  =  ( r  e.  H  |->  { <. x ,  y
>.  |  ( x  e.  J  /\  y  e.  ( r `  x
) ) } )
20 eulerpart.r . . . . . . . . . . 11  |-  R  =  { f  |  ( `' f " NN )  e.  Fin }
21 eulerpart.t . . . . . . . . . . 11  |-  T  =  { f  e.  ( NN0  ^m  NN )  |  ( `' f
" NN )  C_  J }
2214, 15, 16, 4, 17, 18, 19, 20, 21eulerpartlemt0 27934 . . . . . . . . . 10  |-  ( A  e.  ( T  i^i  R )  <->  ( A  e.  ( NN0  ^m  NN )  /\  ( `' A " NN )  e.  Fin  /\  ( `' A " NN )  C_  J ) )
2322simp1bi 1006 . . . . . . . . 9  |-  ( A  e.  ( T  i^i  R )  ->  A  e.  ( NN0  ^m  NN ) )
24 elmapi 7430 . . . . . . . . 9  |-  ( A  e.  ( NN0  ^m  NN )  ->  A : NN
--> NN0 )
2523, 24syl 16 . . . . . . . 8  |-  ( A  e.  ( T  i^i  R )  ->  A : NN
--> NN0 )
26 ffn 5722 . . . . . . . 8  |-  ( A : NN --> NN0  ->  A  Fn  NN )
27 elpreima 5992 . . . . . . . 8  |-  ( A  Fn  NN  ->  (
t  e.  ( `' A " NN )  <-> 
( t  e.  NN  /\  ( A `  t
)  e.  NN ) ) )
2825, 26, 273syl 20 . . . . . . 7  |-  ( A  e.  ( T  i^i  R )  ->  ( t  e.  ( `' A " NN )  <->  ( t  e.  NN  /\  ( A `
 t )  e.  NN ) ) )
2928baibd 902 . . . . . 6  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  NN )  ->  ( t  e.  ( `' A " NN )  <-> 
( A `  t
)  e.  NN ) )
3013, 29sylan2 474 . . . . 5  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  -> 
( t  e.  ( `' A " NN )  <-> 
( A `  t
)  e.  NN ) )
3130biimpar 485 . . . 4  |-  ( ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  /\  ( A `
 t )  e.  NN )  ->  t  e.  ( `' A " NN ) )
3222simp3bi 1008 . . . . . 6  |-  ( A  e.  ( T  i^i  R )  ->  ( `' A " NN )  C_  J )
3332sselda 3497 . . . . 5  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( `' A " NN ) )  ->  t  e.  J
)
345simprbi 464 . . . . 5  |-  ( t  e.  J  ->  -.  2  ||  t )
3533, 34syl 16 . . . 4  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( `' A " NN ) )  ->  -.  2  ||  t )
3612, 31, 35syl2anc 661 . . 3  |-  ( ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  /\  ( A `
 t )  e.  NN )  ->  -.  2  ||  t )
3711, 36pm2.65da 576 . 2  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  ->  -.  ( A `  t
)  e.  NN )
3825adantr 465 . . . 4  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  ->  A : NN --> NN0 )
3913adantl 466 . . . 4  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  -> 
t  e.  NN )
4038, 39ffvelrnd 6013 . . 3  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  -> 
( A `  t
)  e.  NN0 )
41 elnn0 10786 . . 3  |-  ( ( A `  t )  e.  NN0  <->  ( ( A `
 t )  e.  NN  \/  ( A `
 t )  =  0 ) )
4240, 41sylib 196 . 2  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  -> 
( ( A `  t )  e.  NN  \/  ( A `  t
)  =  0 ) )
43 orel1 382 . 2  |-  ( -.  ( A `  t
)  e.  NN  ->  ( ( ( A `  t )  e.  NN  \/  ( A `  t
)  =  0 )  ->  ( A `  t )  =  0 ) )
4437, 42, 43sylc 60 1  |-  ( ( A  e.  ( T  i^i  R )  /\  t  e.  ( NN  \  J ) )  -> 
( A `  t
)  =  0 )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    \/ wo 368    /\ wa 369    = wceq 1374    e. wcel 1762   {cab 2445   A.wral 2807   {crab 2811    \ cdif 3466    i^i cin 3468    C_ wss 3469   (/)c0 3778   ~Pcpw 4003   class class class wbr 4440   {copab 4497    |-> cmpt 4498   `'ccnv 4991   "cima 4995    Fn wfn 5574   -->wf 5575   ` cfv 5579  (class class class)co 6275    |-> cmpt2 6277   supp csupp 6891    ^m cmap 7410   Fincfn 7506   0cc0 9481   1c1 9482    x. cmul 9486    <_ cle 9618   NNcn 10525   2c2 10574   NN0cn0 10784   ^cexp 12122   sum_csu 13457    || cdivides 13836
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pow 4618  ax-pr 4679  ax-un 6567  ax-1cn 9539  ax-icn 9540  ax-addcl 9541  ax-mulcl 9543  ax-i2m1 9549
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-sbc 3325  df-csb 3429  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-pw 4005  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-iun 4320  df-br 4441  df-opab 4499  df-mpt 4500  df-id 4788  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-rn 5003  df-res 5004  df-ima 5005  df-iota 5542  df-fun 5581  df-fn 5582  df-f 5583  df-fv 5587  df-ov 6278  df-oprab 6279  df-mpt2 6280  df-1st 6774  df-2nd 6775  df-map 7412  df-n0 10785
This theorem is referenced by:  eulerpartlemgh  27943
  Copyright terms: Public domain W3C validator