MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ramsey Unicode version

Theorem ramsey 13079
Description: Ramsey's theorem with the definition Ramsey eliminated. If 
M is an integer,  R is a specified finite set of colors, and  F : R --> NN0 is a set of lower bounds for each color, then there is an  n such that for every set  s of size greater than  n and every coloring  f of the set  ( s C M ) of all  M-element subsets of  s, there is a color  c and a subset  x  C_  s such that  x is larger than  F (
c ) and the  M-element subsets of  x are monochromatic with color  c. This is the hypergraph version of Ramsey's theorem; the version for simple graphs is the case  M  =  2. (Contributed by Mario Carneiro, 23-Apr-2015.)
Hypothesis
Ref Expression
ramsey.c  |-  C  =  ( a  e.  _V ,  i  e.  NN0  |->  { b  e.  ~P a  |  ( # `  b
)  =  i } )
Assertion
Ref Expression
ramsey  |-  ( ( M  e.  NN0  /\  R  e.  Fin  /\  F : R --> NN0 )  ->  E. n  e.  NN0  A. s ( n  <_  ( # `  s
)  ->  A. f  e.  ( R  ^m  (
s C M ) ) E. c  e.  R  E. x  e. 
~P  s ( ( F `  c )  <_  ( # `  x
)  /\  ( x C M )  C_  ( `' f " {
c } ) ) ) )
Distinct variable groups:    f, c, n, s, x, F    a,
b, c, f, i, n, s, x, M    R, c, f, n, s, x    C, c, f, x
Allowed substitution hints:    C( i, n, s, a, b)    R( i, a, b)    F( i, a, b)

Proof of Theorem ramsey
StepHypRef Expression
1 ramcl 13078 . . 3  |-  ( ( M  e.  NN0  /\  R  e.  Fin  /\  F : R --> NN0 )  ->  ( M Ramsey  F )  e.  NN0 )
2 ramsey.c . . . 4  |-  C  =  ( a  e.  _V ,  i  e.  NN0  |->  { b  e.  ~P a  |  ( # `  b
)  =  i } )
3 eqid 2285 . . . 4  |-  { n  e.  NN0  |  A. s
( n  <_  ( # `
 s )  ->  A. f  e.  ( R  ^m  ( s C M ) ) E. c  e.  R  E. x  e.  ~P  s
( ( F `  c )  <_  ( # `
 x )  /\  ( x C M )  C_  ( `' f " { c } ) ) ) }  =  { n  e. 
NN0  |  A. s
( n  <_  ( # `
 s )  ->  A. f  e.  ( R  ^m  ( s C M ) ) E. c  e.  R  E. x  e.  ~P  s
( ( F `  c )  <_  ( # `
 x )  /\  ( x C M )  C_  ( `' f " { c } ) ) ) }
42, 3ramtcl2 13060 . . 3  |-  ( ( M  e.  NN0  /\  R  e.  Fin  /\  F : R --> NN0 )  ->  (
( M Ramsey  F )  e.  NN0  <->  { n  e.  NN0  | 
A. s ( n  <_  ( # `  s
)  ->  A. f  e.  ( R  ^m  (
s C M ) ) E. c  e.  R  E. x  e. 
~P  s ( ( F `  c )  <_  ( # `  x
)  /\  ( x C M )  C_  ( `' f " {
c } ) ) ) }  =/=  (/) ) )
51, 4mpbid 201 . 2  |-  ( ( M  e.  NN0  /\  R  e.  Fin  /\  F : R --> NN0 )  ->  { n  e.  NN0  |  A. s
( n  <_  ( # `
 s )  ->  A. f  e.  ( R  ^m  ( s C M ) ) E. c  e.  R  E. x  e.  ~P  s
( ( F `  c )  <_  ( # `
 x )  /\  ( x C M )  C_  ( `' f " { c } ) ) ) }  =/=  (/) )
6 rabn0 3476 . 2  |-  ( { n  e.  NN0  |  A. s ( n  <_ 
( # `  s )  ->  A. f  e.  ( R  ^m  ( s C M ) ) E. c  e.  R  E. x  e.  ~P  s ( ( F `
 c )  <_ 
( # `  x )  /\  ( x C M )  C_  ( `' f " {
c } ) ) ) }  =/=  (/)  <->  E. n  e.  NN0  A. s ( n  <_  ( # `  s
)  ->  A. f  e.  ( R  ^m  (
s C M ) ) E. c  e.  R  E. x  e. 
~P  s ( ( F `  c )  <_  ( # `  x
)  /\  ( x C M )  C_  ( `' f " {
c } ) ) ) )
75, 6sylib 188 1  |-  ( ( M  e.  NN0  /\  R  e.  Fin  /\  F : R --> NN0 )  ->  E. n  e.  NN0  A. s ( n  <_  ( # `  s
)  ->  A. f  e.  ( R  ^m  (
s C M ) ) E. c  e.  R  E. x  e. 
~P  s ( ( F `  c )  <_  ( # `  x
)  /\  ( x C M )  C_  ( `' f " {
c } ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934   A.wal 1529    = wceq 1625    e. wcel 1686    =/= wne 2448   A.wral 2545   E.wrex 2546   {crab 2549   _Vcvv 2790    C_ wss 3154   (/)c0 3457   ~Pcpw 3627   {csn 3642   class class class wbr 4025   `'ccnv 4690   "cima 4694   -->wf 5253   ` cfv 5257  (class class class)co 5860    e. cmpt2 5862    ^m cmap 6774   Fincfn 6865    <_ cle 8870   NN0cn0 9967   #chash 11339   Ramsey cram 13048
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-13 1688  ax-14 1690  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266  ax-rep 4133  ax-sep 4143  ax-nul 4151  ax-pow 4190  ax-pr 4216  ax-un 4514  ax-inf2 7344  ax-cnex 8795  ax-resscn 8796  ax-1cn 8797  ax-icn 8798  ax-addcl 8799  ax-addrcl 8800  ax-mulcl 8801  ax-mulrcl 8802  ax-mulcom 8803  ax-addass 8804  ax-mulass 8805  ax-distr 8806  ax-i2m1 8807  ax-1ne0 8808  ax-1rid 8809  ax-rnegex 8810  ax-rrecex 8811  ax-cnre 8812  ax-pre-lttri 8813  ax-pre-lttrn 8814  ax-pre-ltadd 8815  ax-pre-mulgt0 8816  ax-pre-sup 8817
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1531  df-nf 1534  df-sb 1632  df-eu 2149  df-mo 2150  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ne 2450  df-nel 2451  df-ral 2550  df-rex 2551  df-reu 2552  df-rmo 2553  df-rab 2554  df-v 2792  df-sbc 2994  df-csb 3084  df-dif 3157  df-un 3159  df-in 3161  df-ss 3168  df-pss 3170  df-nul 3458  df-if 3568  df-pw 3629  df-sn 3648  df-pr 3649  df-tp 3650  df-op 3651  df-uni 3830  df-int 3865  df-iun 3909  df-br 4026  df-opab 4080  df-mpt 4081  df-tr 4116  df-eprel 4307  df-id 4311  df-po 4316  df-so 4317  df-fr 4354  df-se 4355  df-we 4356  df-ord 4397  df-on 4398  df-lim 4399  df-suc 4400  df-om 4659  df-xp 4697  df-rel 4698  df-cnv 4699  df-co 4700  df-dm 4701  df-rn 4702  df-res 4703  df-ima 4704  df-iota 5221  df-fun 5259  df-fn 5260  df-f 5261  df-f1 5262  df-fo 5263  df-f1o 5264  df-fv 5265  df-isom 5266  df-ov 5863  df-oprab 5864  df-mpt2 5865  df-1st 6124  df-2nd 6125  df-riota 6306  df-recs 6390  df-rdg 6425  df-1o 6481  df-2o 6482  df-oadd 6485  df-er 6662  df-map 6776  df-en 6866  df-dom 6867  df-sdom 6868  df-fin 6869  df-sup 7196  df-oi 7227  df-card 7574  df-cda 7796  df-pnf 8871  df-mnf 8872  df-xr 8873  df-ltxr 8874  df-le 8875  df-sub 9041  df-neg 9042  df-div 9426  df-nn 9749  df-2 9806  df-3 9807  df-n0 9968  df-z 10027  df-uz 10233  df-rp 10357  df-ico 10664  df-fz 10785  df-fzo 10873  df-seq 11049  df-exp 11107  df-fac 11291  df-bc 11318  df-hash 11340  df-cj 11586  df-re 11587  df-im 11588  df-sqr 11722  df-abs 11723  df-clim 11964  df-sum 12161  df-ram 13050
  Copyright terms: Public domain W3C validator