MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rami Structured version   Visualization version   GIF version

Theorem rami 15942
Description: The defining property of a Ramsey number. (Contributed by Mario Carneiro, 22-Apr-2015.)
Hypotheses
Ref Expression
rami.c 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})
rami.m (𝜑𝑀 ∈ ℕ0)
rami.r (𝜑𝑅𝑉)
rami.f (𝜑𝐹:𝑅⟶ℕ0)
rami.x (𝜑 → (𝑀 Ramsey 𝐹) ∈ ℕ0)
rami.s (𝜑𝑆𝑊)
rami.l (𝜑 → (𝑀 Ramsey 𝐹) ≤ (♯‘𝑆))
rami.g (𝜑𝐺:(𝑆𝐶𝑀)⟶𝑅)
Assertion
Ref Expression
rami (𝜑 → ∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝐺 “ {𝑐})))
Distinct variable groups:   𝑥,𝑐,𝐶   𝐺,𝑐,𝑥   𝜑,𝑐,𝑥   𝑆,𝑐,𝑥   𝐹,𝑐,𝑥   𝑎,𝑏,𝑐,𝑖,𝑥,𝑀   𝑅,𝑐,𝑥   𝑉,𝑐,𝑥
Allowed substitution hints:   𝜑(𝑖,𝑎,𝑏)   𝐶(𝑖,𝑎,𝑏)   𝑅(𝑖,𝑎,𝑏)   𝑆(𝑖,𝑎,𝑏)   𝐹(𝑖,𝑎,𝑏)   𝐺(𝑖,𝑎,𝑏)   𝑉(𝑖,𝑎,𝑏)   𝑊(𝑥,𝑖,𝑎,𝑏,𝑐)

Proof of Theorem rami
Dummy variables 𝑓 𝑛 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cnveq 5452 . . . . . 6 (𝑓 = 𝐺𝑓 = 𝐺)
21imaeq1d 5624 . . . . 5 (𝑓 = 𝐺 → (𝑓 “ {𝑐}) = (𝐺 “ {𝑐}))
32sseq2d 3775 . . . 4 (𝑓 = 𝐺 → ((𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}) ↔ (𝑥𝐶𝑀) ⊆ (𝐺 “ {𝑐})))
43anbi2d 742 . . 3 (𝑓 = 𝐺 → (((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})) ↔ ((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝐺 “ {𝑐}))))
542rexbidv 3196 . 2 (𝑓 = 𝐺 → (∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})) ↔ ∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝐺 “ {𝑐}))))
6 rami.s . . 3 (𝜑𝑆𝑊)
7 rami.x . . . . 5 (𝜑 → (𝑀 Ramsey 𝐹) ∈ ℕ0)
8 rami.m . . . . . 6 (𝜑𝑀 ∈ ℕ0)
9 rami.r . . . . . 6 (𝜑𝑅𝑉)
10 rami.f . . . . . 6 (𝜑𝐹:𝑅⟶ℕ0)
11 rami.c . . . . . . . 8 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})
12 eqid 2761 . . . . . . . 8 {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))} = {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))}
1311, 12ramtcl2 15938 . . . . . . 7 ((𝑀 ∈ ℕ0𝑅𝑉𝐹:𝑅⟶ℕ0) → ((𝑀 Ramsey 𝐹) ∈ ℕ0 ↔ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))} ≠ ∅))
1411, 12ramtcl 15937 . . . . . . 7 ((𝑀 ∈ ℕ0𝑅𝑉𝐹:𝑅⟶ℕ0) → ((𝑀 Ramsey 𝐹) ∈ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))} ↔ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))} ≠ ∅))
1513, 14bitr4d 271 . . . . . 6 ((𝑀 ∈ ℕ0𝑅𝑉𝐹:𝑅⟶ℕ0) → ((𝑀 Ramsey 𝐹) ∈ ℕ0 ↔ (𝑀 Ramsey 𝐹) ∈ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))}))
168, 9, 10, 15syl3anc 1477 . . . . 5 (𝜑 → ((𝑀 Ramsey 𝐹) ∈ ℕ0 ↔ (𝑀 Ramsey 𝐹) ∈ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))}))
177, 16mpbid 222 . . . 4 (𝜑 → (𝑀 Ramsey 𝐹) ∈ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))})
18 breq1 4808 . . . . . . . 8 (𝑛 = (𝑀 Ramsey 𝐹) → (𝑛 ≤ (♯‘𝑠) ↔ (𝑀 Ramsey 𝐹) ≤ (♯‘𝑠)))
1918imbi1d 330 . . . . . . 7 (𝑛 = (𝑀 Ramsey 𝐹) → ((𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))) ↔ ((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))))
2019albidv 1999 . . . . . 6 (𝑛 = (𝑀 Ramsey 𝐹) → (∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))) ↔ ∀𝑠((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))))
2120elrab 3505 . . . . 5 ((𝑀 Ramsey 𝐹) ∈ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))} ↔ ((𝑀 Ramsey 𝐹) ∈ ℕ0 ∧ ∀𝑠((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))))
2221simprbi 483 . . . 4 ((𝑀 Ramsey 𝐹) ∈ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))} → ∀𝑠((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))))
2317, 22syl 17 . . 3 (𝜑 → ∀𝑠((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))))
24 rami.l . . 3 (𝜑 → (𝑀 Ramsey 𝐹) ≤ (♯‘𝑆))
25 fveq2 6354 . . . . . 6 (𝑠 = 𝑆 → (♯‘𝑠) = (♯‘𝑆))
2625breq2d 4817 . . . . 5 (𝑠 = 𝑆 → ((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) ↔ (𝑀 Ramsey 𝐹) ≤ (♯‘𝑆)))
27 oveq1 6822 . . . . . . 7 (𝑠 = 𝑆 → (𝑠𝐶𝑀) = (𝑆𝐶𝑀))
2827oveq2d 6831 . . . . . 6 (𝑠 = 𝑆 → (𝑅𝑚 (𝑠𝐶𝑀)) = (𝑅𝑚 (𝑆𝐶𝑀)))
29 pweq 4306 . . . . . . . 8 (𝑠 = 𝑆 → 𝒫 𝑠 = 𝒫 𝑆)
3029rexeqdv 3285 . . . . . . 7 (𝑠 = 𝑆 → (∃𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})) ↔ ∃𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))))
3130rexbidv 3191 . . . . . 6 (𝑠 = 𝑆 → (∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})) ↔ ∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))))
3228, 31raleqbidv 3292 . . . . 5 (𝑠 = 𝑆 → (∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})) ↔ ∀𝑓 ∈ (𝑅𝑚 (𝑆𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))))
3326, 32imbi12d 333 . . . 4 (𝑠 = 𝑆 → (((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))) ↔ ((𝑀 Ramsey 𝐹) ≤ (♯‘𝑆) → ∀𝑓 ∈ (𝑅𝑚 (𝑆𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))))
3433spcgv 3434 . . 3 (𝑆𝑊 → (∀𝑠((𝑀 Ramsey 𝐹) ≤ (♯‘𝑠) → ∀𝑓 ∈ (𝑅𝑚 (𝑠𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑠((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐}))) → ((𝑀 Ramsey 𝐹) ≤ (♯‘𝑆) → ∀𝑓 ∈ (𝑅𝑚 (𝑆𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))))
356, 23, 24, 34syl3c 66 . 2 (𝜑 → ∀𝑓 ∈ (𝑅𝑚 (𝑆𝐶𝑀))∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝑓 “ {𝑐})))
36 rami.g . . 3 (𝜑𝐺:(𝑆𝐶𝑀)⟶𝑅)
37 ovex 6843 . . . 4 (𝑆𝐶𝑀) ∈ V
38 elmapg 8039 . . . 4 ((𝑅𝑉 ∧ (𝑆𝐶𝑀) ∈ V) → (𝐺 ∈ (𝑅𝑚 (𝑆𝐶𝑀)) ↔ 𝐺:(𝑆𝐶𝑀)⟶𝑅))
399, 37, 38sylancl 697 . . 3 (𝜑 → (𝐺 ∈ (𝑅𝑚 (𝑆𝐶𝑀)) ↔ 𝐺:(𝑆𝐶𝑀)⟶𝑅))
4036, 39mpbird 247 . 2 (𝜑𝐺 ∈ (𝑅𝑚 (𝑆𝐶𝑀)))
415, 35, 40rspcdva 3456 1 (𝜑 → ∃𝑐𝑅𝑥 ∈ 𝒫 𝑆((𝐹𝑐) ≤ (♯‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (𝐺 “ {𝑐})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1072  wal 1630   = wceq 1632  wcel 2140  wne 2933  wral 3051  wrex 3052  {crab 3055  Vcvv 3341  wss 3716  c0 4059  𝒫 cpw 4303  {csn 4322   class class class wbr 4805  ccnv 5266  cima 5270  wf 6046  cfv 6050  (class class class)co 6815  cmpt2 6817  𝑚 cmap 8026  cle 10288  0cn0 11505  chash 13332   Ramsey cram 15926
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1989  ax-6 2055  ax-7 2091  ax-8 2142  ax-9 2149  ax-10 2169  ax-11 2184  ax-12 2197  ax-13 2392  ax-ext 2741  ax-rep 4924  ax-sep 4934  ax-nul 4942  ax-pow 4993  ax-pr 5056  ax-un 7116  ax-cnex 10205  ax-resscn 10206  ax-1cn 10207  ax-icn 10208  ax-addcl 10209  ax-addrcl 10210  ax-mulcl 10211  ax-mulrcl 10212  ax-mulcom 10213  ax-addass 10214  ax-mulass 10215  ax-distr 10216  ax-i2m1 10217  ax-1ne0 10218  ax-1rid 10219  ax-rnegex 10220  ax-rrecex 10221  ax-cnre 10222  ax-pre-lttri 10223  ax-pre-lttrn 10224  ax-pre-ltadd 10225  ax-pre-mulgt0 10226
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2048  df-eu 2612  df-mo 2613  df-clab 2748  df-cleq 2754  df-clel 2757  df-nfc 2892  df-ne 2934  df-nel 3037  df-ral 3056  df-rex 3057  df-reu 3058  df-rmo 3059  df-rab 3060  df-v 3343  df-sbc 3578  df-csb 3676  df-dif 3719  df-un 3721  df-in 3723  df-ss 3730  df-pss 3732  df-nul 4060  df-if 4232  df-pw 4305  df-sn 4323  df-pr 4325  df-tp 4327  df-op 4329  df-uni 4590  df-iun 4675  df-br 4806  df-opab 4866  df-mpt 4883  df-tr 4906  df-id 5175  df-eprel 5180  df-po 5188  df-so 5189  df-fr 5226  df-we 5228  df-xp 5273  df-rel 5274  df-cnv 5275  df-co 5276  df-dm 5277  df-rn 5278  df-res 5279  df-ima 5280  df-pred 5842  df-ord 5888  df-on 5889  df-lim 5890  df-suc 5891  df-iota 6013  df-fun 6052  df-fn 6053  df-f 6054  df-f1 6055  df-fo 6056  df-f1o 6057  df-fv 6058  df-riota 6776  df-ov 6818  df-oprab 6819  df-mpt2 6820  df-om 7233  df-1st 7335  df-2nd 7336  df-wrecs 7578  df-recs 7639  df-rdg 7677  df-er 7914  df-map 8028  df-en 8125  df-dom 8126  df-sdom 8127  df-sup 8516  df-inf 8517  df-pnf 10289  df-mnf 10290  df-xr 10291  df-ltxr 10292  df-le 10293  df-sub 10481  df-neg 10482  df-nn 11234  df-n0 11506  df-z 11591  df-uz 11901  df-ram 15928
This theorem is referenced by:  ramlb  15946  ramub1lem2  15954
  Copyright terms: Public domain W3C validator