ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ballotfilemelo Unicode version

Theorem ballotfilemelo 13141
Description: Elementhood in  O. (Contributed by Thierry Arnoux, 17-Apr-2017.)
Hypotheses
Ref Expression
ballotth.m  |-  M  e.  NN
ballotth.n  |-  N  e.  NN
ballotfi.o  |-  O  =  { c  e.  ( ~P ( 1 ... ( M  +  N
) )  i^i  Fin )  |  ( `  c
)  =  M }
Assertion
Ref Expression
ballotfilemelo  |-  ( C  e.  O  <->  ( C  C_  ( 1 ... ( M  +  N )
)  /\  C  e.  Fin  /\  ( `  C
)  =  M ) )
Distinct variable groups:    M, c    N, c    O, c
Allowed substitution hint:    C( c)

Proof of Theorem ballotfilemelo
Dummy variable  d is distinct from all other variables.
StepHypRef Expression
1 elfpw 7215 . . 3  |-  ( C  e.  ( ~P (
1 ... ( M  +  N ) )  i^i 
Fin )  <->  ( C  C_  ( 1 ... ( M  +  N )
)  /\  C  e.  Fin ) )
21anbi1i 458 . 2  |-  ( ( C  e.  ( ~P ( 1 ... ( M  +  N )
)  i^i  Fin )  /\  ( `  C )  =  M )  <->  ( ( C  C_  ( 1 ... ( M  +  N
) )  /\  C  e.  Fin )  /\  ( `  C )  =  M ) )
3 fveqeq2 5679 . . 3  |-  ( d  =  C  ->  (
( `  d )  =  M  <->  ( `  C )  =  M ) )
4 ballotfi.o . . . 4  |-  O  =  { c  e.  ( ~P ( 1 ... ( M  +  N
) )  i^i  Fin )  |  ( `  c
)  =  M }
5 fveqeq2 5679 . . . . 5  |-  ( c  =  d  ->  (
( `  c )  =  M  <->  ( `  d )  =  M ) )
65cbvrabv 2812 . . . 4  |-  { c  e.  ( ~P (
1 ... ( M  +  N ) )  i^i 
Fin )  |  ( `  c )  =  M }  =  { d  e.  ( ~P (
1 ... ( M  +  N ) )  i^i 
Fin )  |  ( `  d )  =  M }
74, 6eqtri 2253 . . 3  |-  O  =  { d  e.  ( ~P ( 1 ... ( M  +  N
) )  i^i  Fin )  |  ( `  d
)  =  M }
83, 7elrab2 2976 . 2  |-  ( C  e.  O  <->  ( C  e.  ( ~P ( 1 ... ( M  +  N ) )  i^i 
Fin )  /\  ( `  C )  =  M ) )
9 df-3an 1007 . 2  |-  ( ( C  C_  ( 1 ... ( M  +  N ) )  /\  C  e.  Fin  /\  ( `  C )  =  M )  <->  ( ( C 
C_  ( 1 ... ( M  +  N
) )  /\  C  e.  Fin )  /\  ( `  C )  =  M ) )
102, 8, 93bitr4i 212 1  |-  ( C  e.  O  <->  ( C  C_  ( 1 ... ( M  +  N )
)  /\  C  e.  Fin  /\  ( `  C
)  =  M ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2203   {crab 2524    i^i cin 3210    C_ wss 3211   ~Pcpw 3669   ` cfv 5352  (class class class)co 6050   Fincfn 6975   1c1 8128    + caddc 8130   NNcn 9237   ...cfz 10342  ♯chash 11138
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-rab 2529  df-v 2815  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-iota 5312  df-fv 5360
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator