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

Theorem ballotleme 24526
Description: Elements of  E. (Contributed by Thierry Arnoux, 14-Dec-2016.)
Hypotheses
Ref Expression
ballotth.m  |-  M  e.  NN
ballotth.n  |-  N  e.  NN
ballotth.o  |-  O  =  { c  e.  ~P ( 1 ... ( M  +  N )
)  |  ( # `  c )  =  M }
ballotth.p  |-  P  =  ( x  e.  ~P O  |->  ( ( # `  x )  /  ( # `
 O ) ) )
ballotth.f  |-  F  =  ( c  e.  O  |->  ( i  e.  ZZ  |->  ( ( # `  (
( 1 ... i
)  i^i  c )
)  -  ( # `  ( ( 1 ... i )  \  c
) ) ) ) )
ballotth.e  |-  E  =  { c  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `  c ) `
 i ) }
Assertion
Ref Expression
ballotleme  |-  ( C  e.  E  <->  ( C  e.  O  /\  A. i  e.  ( 1 ... ( M  +  N )
) 0  <  (
( F `  C
) `  i )
) )
Distinct variable groups:    M, c    N, c    O, c    i, M   
i, N    i, O, c    F, c, i    C, i
Allowed substitution hints:    C( x, c)    P( x, i, c)    E( x, i, c)    F( x)    M( x)    N( x)    O( x)

Proof of Theorem ballotleme
Dummy variable  d is distinct from all other variables.
StepHypRef Expression
1 fveq2 5661 . . . . 5  |-  ( d  =  C  ->  ( F `  d )  =  ( F `  C ) )
21fveq1d 5663 . . . 4  |-  ( d  =  C  ->  (
( F `  d
) `  i )  =  ( ( F `
 C ) `  i ) )
32breq2d 4158 . . 3  |-  ( d  =  C  ->  (
0  <  ( ( F `  d ) `  i )  <->  0  <  ( ( F `  C
) `  i )
) )
43ralbidv 2662 . 2  |-  ( d  =  C  ->  ( A. i  e.  (
1 ... ( M  +  N ) ) 0  <  ( ( F `
 d ) `  i )  <->  A. i  e.  ( 1 ... ( M  +  N )
) 0  <  (
( F `  C
) `  i )
) )
5 ballotth.e . . 3  |-  E  =  { c  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `  c ) `
 i ) }
6 fveq2 5661 . . . . . . 7  |-  ( c  =  d  ->  ( F `  c )  =  ( F `  d ) )
76fveq1d 5663 . . . . . 6  |-  ( c  =  d  ->  (
( F `  c
) `  i )  =  ( ( F `
 d ) `  i ) )
87breq2d 4158 . . . . 5  |-  ( c  =  d  ->  (
0  <  ( ( F `  c ) `  i )  <->  0  <  ( ( F `  d
) `  i )
) )
98ralbidv 2662 . . . 4  |-  ( c  =  d  ->  ( A. i  e.  (
1 ... ( M  +  N ) ) 0  <  ( ( F `
 c ) `  i )  <->  A. i  e.  ( 1 ... ( M  +  N )
) 0  <  (
( F `  d
) `  i )
) )
109cbvrabv 2891 . . 3  |-  { c  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `
 c ) `  i ) }  =  { d  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `  d ) `
 i ) }
115, 10eqtri 2400 . 2  |-  E  =  { d  e.  O  |  A. i  e.  ( 1 ... ( M  +  N ) ) 0  <  ( ( F `  d ) `
 i ) }
124, 11elrab2 3030 1  |-  ( C  e.  E  <->  ( C  e.  O  /\  A. i  e.  ( 1 ... ( M  +  N )
) 0  <  (
( F `  C
) `  i )
) )
Colors of variables: wff set class
Syntax hints:    <-> wb 177    /\ wa 359    = wceq 1649    e. wcel 1717   A.wral 2642   {crab 2646    \ cdif 3253    i^i cin 3255   ~Pcpw 3735   class class class wbr 4146    e. cmpt 4200   ` cfv 5387  (class class class)co 6013   0cc0 8916   1c1 8917    + caddc 8919    < clt 9046    - cmin 9216    / cdiv 9602   NNcn 9925   ZZcz 10207   ...cfz 10968   #chash 11538
This theorem is referenced by:  ballotlemodife  24527  ballotlem4  24528
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ral 2647  df-rex 2648  df-rab 2651  df-v 2894  df-dif 3259  df-un 3261  df-in 3263  df-ss 3270  df-nul 3565  df-if 3676  df-sn 3756  df-pr 3757  df-op 3759  df-uni 3951  df-br 4147  df-iota 5351  df-fv 5395
  Copyright terms: Public domain W3C validator