Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ramcl2lem | Structured version Visualization version GIF version |
Description: Lemma for extended real closure of the Ramsey number function. (Contributed by Mario Carneiro, 20-Apr-2015.) (Revised by AV, 14-Sep-2020.) |
Ref | Expression |
---|---|
ramval.c | ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (#‘𝑏) = 𝑖}) |
ramval.t | ⊢ 𝑇 = {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (#‘𝑠) → ∀𝑓 ∈ (𝑅 ↑𝑚 (𝑠𝐶𝑀))∃𝑐 ∈ 𝑅 ∃𝑥 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (#‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (◡𝑓 “ {𝑐})))} |
Ref | Expression |
---|---|
ramcl2lem | ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) → (𝑀 Ramsey 𝐹) = if(𝑇 = ∅, +∞, inf(𝑇, ℝ, < ))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqeq2 2633 | . 2 ⊢ (+∞ = if(𝑇 = ∅, +∞, inf(𝑇, ℝ, < )) → ((𝑀 Ramsey 𝐹) = +∞ ↔ (𝑀 Ramsey 𝐹) = if(𝑇 = ∅, +∞, inf(𝑇, ℝ, < )))) | |
2 | eqeq2 2633 | . 2 ⊢ (inf(𝑇, ℝ, < ) = if(𝑇 = ∅, +∞, inf(𝑇, ℝ, < )) → ((𝑀 Ramsey 𝐹) = inf(𝑇, ℝ, < ) ↔ (𝑀 Ramsey 𝐹) = if(𝑇 = ∅, +∞, inf(𝑇, ℝ, < )))) | |
3 | ramval.c | . . . 4 ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (#‘𝑏) = 𝑖}) | |
4 | ramval.t | . . . 4 ⊢ 𝑇 = {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (#‘𝑠) → ∀𝑓 ∈ (𝑅 ↑𝑚 (𝑠𝐶𝑀))∃𝑐 ∈ 𝑅 ∃𝑥 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (#‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (◡𝑓 “ {𝑐})))} | |
5 | 3, 4 | ramval 15712 | . . 3 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) → (𝑀 Ramsey 𝐹) = inf(𝑇, ℝ*, < )) |
6 | infeq1 8382 | . . . 4 ⊢ (𝑇 = ∅ → inf(𝑇, ℝ*, < ) = inf(∅, ℝ*, < )) | |
7 | xrinf0 12168 | . . . 4 ⊢ inf(∅, ℝ*, < ) = +∞ | |
8 | 6, 7 | syl6eq 2672 | . . 3 ⊢ (𝑇 = ∅ → inf(𝑇, ℝ*, < ) = +∞) |
9 | 5, 8 | sylan9eq 2676 | . 2 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 = ∅) → (𝑀 Ramsey 𝐹) = +∞) |
10 | df-ne 2795 | . . 3 ⊢ (𝑇 ≠ ∅ ↔ ¬ 𝑇 = ∅) | |
11 | 5 | adantr 481 | . . . 4 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → (𝑀 Ramsey 𝐹) = inf(𝑇, ℝ*, < )) |
12 | xrltso 11974 | . . . . . 6 ⊢ < Or ℝ* | |
13 | 12 | a1i 11 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → < Or ℝ*) |
14 | ssrab2 3687 | . . . . . . . . 9 ⊢ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (#‘𝑠) → ∀𝑓 ∈ (𝑅 ↑𝑚 (𝑠𝐶𝑀))∃𝑐 ∈ 𝑅 ∃𝑥 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (#‘𝑥) ∧ (𝑥𝐶𝑀) ⊆ (◡𝑓 “ {𝑐})))} ⊆ ℕ0 | |
15 | 4, 14 | eqsstri 3635 | . . . . . . . 8 ⊢ 𝑇 ⊆ ℕ0 |
16 | nn0ssre 11296 | . . . . . . . 8 ⊢ ℕ0 ⊆ ℝ | |
17 | 15, 16 | sstri 3612 | . . . . . . 7 ⊢ 𝑇 ⊆ ℝ |
18 | nn0uz 11722 | . . . . . . . . . 10 ⊢ ℕ0 = (ℤ≥‘0) | |
19 | 15, 18 | sseqtri 3637 | . . . . . . . . 9 ⊢ 𝑇 ⊆ (ℤ≥‘0) |
20 | 19 | a1i 11 | . . . . . . . 8 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) → 𝑇 ⊆ (ℤ≥‘0)) |
21 | infssuzcl 11772 | . . . . . . . 8 ⊢ ((𝑇 ⊆ (ℤ≥‘0) ∧ 𝑇 ≠ ∅) → inf(𝑇, ℝ, < ) ∈ 𝑇) | |
22 | 20, 21 | sylan 488 | . . . . . . 7 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → inf(𝑇, ℝ, < ) ∈ 𝑇) |
23 | 17, 22 | sseldi 3601 | . . . . . 6 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → inf(𝑇, ℝ, < ) ∈ ℝ) |
24 | 23 | rexrd 10089 | . . . . 5 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → inf(𝑇, ℝ, < ) ∈ ℝ*) |
25 | simpr 477 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) ∧ 𝑧 ∈ 𝑇) → 𝑧 ∈ 𝑇) | |
26 | infssuzle 11771 | . . . . . . 7 ⊢ ((𝑇 ⊆ (ℤ≥‘0) ∧ 𝑧 ∈ 𝑇) → inf(𝑇, ℝ, < ) ≤ 𝑧) | |
27 | 19, 25, 26 | sylancr 695 | . . . . . 6 ⊢ ((((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) ∧ 𝑧 ∈ 𝑇) → inf(𝑇, ℝ, < ) ≤ 𝑧) |
28 | 23 | adantr 481 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) ∧ 𝑧 ∈ 𝑇) → inf(𝑇, ℝ, < ) ∈ ℝ) |
29 | 17 | a1i 11 | . . . . . . . 8 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → 𝑇 ⊆ ℝ) |
30 | 29 | sselda 3603 | . . . . . . 7 ⊢ ((((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) ∧ 𝑧 ∈ 𝑇) → 𝑧 ∈ ℝ) |
31 | 28, 30 | lenltd 10183 | . . . . . 6 ⊢ ((((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) ∧ 𝑧 ∈ 𝑇) → (inf(𝑇, ℝ, < ) ≤ 𝑧 ↔ ¬ 𝑧 < inf(𝑇, ℝ, < ))) |
32 | 27, 31 | mpbid 222 | . . . . 5 ⊢ ((((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) ∧ 𝑧 ∈ 𝑇) → ¬ 𝑧 < inf(𝑇, ℝ, < )) |
33 | 13, 24, 22, 32 | infmin 8400 | . . . 4 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → inf(𝑇, ℝ*, < ) = inf(𝑇, ℝ, < )) |
34 | 11, 33 | eqtrd 2656 | . . 3 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ 𝑇 ≠ ∅) → (𝑀 Ramsey 𝐹) = inf(𝑇, ℝ, < )) |
35 | 10, 34 | sylan2br 493 | . 2 ⊢ (((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ ¬ 𝑇 = ∅) → (𝑀 Ramsey 𝐹) = inf(𝑇, ℝ, < )) |
36 | 1, 2, 9, 35 | ifbothda 4123 | 1 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) → (𝑀 Ramsey 𝐹) = if(𝑇 = ∅, +∞, inf(𝑇, ℝ, < ))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1037 ∀wal 1481 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ∃wrex 2913 {crab 2916 Vcvv 3200 ⊆ wss 3574 ∅c0 3915 ifcif 4086 𝒫 cpw 4158 {csn 4177 class class class wbr 4653 Or wor 5034 ◡ccnv 5113 “ cima 5117 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↦ cmpt2 6652 ↑𝑚 cmap 7857 infcinf 8347 ℝcr 9935 0cc0 9936 +∞cpnf 10071 ℝ*cxr 10073 < clt 10074 ≤ cle 10075 ℕ0cn0 11292 ℤ≥cuz 11687 #chash 13117 Ramsey cram 15703 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-sup 8348 df-inf 8349 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-ram 15705 |
This theorem is referenced by: ramtcl 15714 ramtcl2 15715 ramtub 15716 ramcl2 15720 |
Copyright terms: Public domain | W3C validator |