Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ramtlecl | Structured version Visualization version GIF version |
Description: The set 𝑇 of numbers with the Ramsey number property is upward-closed. (Contributed by Mario Carneiro, 21-Apr-2015.) |
Ref | Expression |
---|---|
ramtlecl.t | ⊢ 𝑇 = {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑)} |
Ref | Expression |
---|---|
ramtlecl | ⊢ (𝑀 ∈ 𝑇 → (ℤ≥‘𝑀) ⊆ 𝑇) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1 4586 | . . . . . . . 8 ⊢ (𝑛 = 𝑀 → (𝑛 ≤ (#‘𝑠) ↔ 𝑀 ≤ (#‘𝑠))) | |
2 | 1 | imbi1d 330 | . . . . . . 7 ⊢ (𝑛 = 𝑀 → ((𝑛 ≤ (#‘𝑠) → 𝜑) ↔ (𝑀 ≤ (#‘𝑠) → 𝜑))) |
3 | 2 | albidv 1836 | . . . . . 6 ⊢ (𝑛 = 𝑀 → (∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑) ↔ ∀𝑠(𝑀 ≤ (#‘𝑠) → 𝜑))) |
4 | ramtlecl.t | . . . . . 6 ⊢ 𝑇 = {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑)} | |
5 | 3, 4 | elrab2 3333 | . . . . 5 ⊢ (𝑀 ∈ 𝑇 ↔ (𝑀 ∈ ℕ0 ∧ ∀𝑠(𝑀 ≤ (#‘𝑠) → 𝜑))) |
6 | 5 | simplbi 475 | . . . 4 ⊢ (𝑀 ∈ 𝑇 → 𝑀 ∈ ℕ0) |
7 | eluznn0 11633 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑛 ∈ ℕ0) | |
8 | 7 | ex 449 | . . . . 5 ⊢ (𝑀 ∈ ℕ0 → (𝑛 ∈ (ℤ≥‘𝑀) → 𝑛 ∈ ℕ0)) |
9 | 8 | ssrdv 3574 | . . . 4 ⊢ (𝑀 ∈ ℕ0 → (ℤ≥‘𝑀) ⊆ ℕ0) |
10 | 6, 9 | syl 17 | . . 3 ⊢ (𝑀 ∈ 𝑇 → (ℤ≥‘𝑀) ⊆ ℕ0) |
11 | 5 | simprbi 479 | . . . . 5 ⊢ (𝑀 ∈ 𝑇 → ∀𝑠(𝑀 ≤ (#‘𝑠) → 𝜑)) |
12 | eluzle 11576 | . . . . . . . . . 10 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → 𝑀 ≤ 𝑛) | |
13 | 12 | adantl 481 | . . . . . . . . 9 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑀 ≤ 𝑛) |
14 | nn0ssre 11173 | . . . . . . . . . . . 12 ⊢ ℕ0 ⊆ ℝ | |
15 | ressxr 9962 | . . . . . . . . . . . 12 ⊢ ℝ ⊆ ℝ* | |
16 | 14, 15 | sstri 3577 | . . . . . . . . . . 11 ⊢ ℕ0 ⊆ ℝ* |
17 | 6 | adantr 480 | . . . . . . . . . . 11 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℕ0) |
18 | 16, 17 | sseldi 3566 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℝ*) |
19 | 6, 7 | sylan 487 | . . . . . . . . . . 11 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑛 ∈ ℕ0) |
20 | 16, 19 | sseldi 3566 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → 𝑛 ∈ ℝ*) |
21 | vex 3176 | . . . . . . . . . . 11 ⊢ 𝑠 ∈ V | |
22 | hashxrcl 13010 | . . . . . . . . . . 11 ⊢ (𝑠 ∈ V → (#‘𝑠) ∈ ℝ*) | |
23 | 21, 22 | mp1i 13 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (#‘𝑠) ∈ ℝ*) |
24 | xrletr 11865 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ* ∧ 𝑛 ∈ ℝ* ∧ (#‘𝑠) ∈ ℝ*) → ((𝑀 ≤ 𝑛 ∧ 𝑛 ≤ (#‘𝑠)) → 𝑀 ≤ (#‘𝑠))) | |
25 | 18, 20, 23, 24 | syl3anc 1318 | . . . . . . . . 9 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝑀 ≤ 𝑛 ∧ 𝑛 ≤ (#‘𝑠)) → 𝑀 ≤ (#‘𝑠))) |
26 | 13, 25 | mpand 707 | . . . . . . . 8 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → (𝑛 ≤ (#‘𝑠) → 𝑀 ≤ (#‘𝑠))) |
27 | 26 | imim1d 80 | . . . . . . 7 ⊢ ((𝑀 ∈ 𝑇 ∧ 𝑛 ∈ (ℤ≥‘𝑀)) → ((𝑀 ≤ (#‘𝑠) → 𝜑) → (𝑛 ≤ (#‘𝑠) → 𝜑))) |
28 | 27 | ralrimdva 2952 | . . . . . 6 ⊢ (𝑀 ∈ 𝑇 → ((𝑀 ≤ (#‘𝑠) → 𝜑) → ∀𝑛 ∈ (ℤ≥‘𝑀)(𝑛 ≤ (#‘𝑠) → 𝜑))) |
29 | 28 | alimdv 1832 | . . . . 5 ⊢ (𝑀 ∈ 𝑇 → (∀𝑠(𝑀 ≤ (#‘𝑠) → 𝜑) → ∀𝑠∀𝑛 ∈ (ℤ≥‘𝑀)(𝑛 ≤ (#‘𝑠) → 𝜑))) |
30 | 11, 29 | mpd 15 | . . . 4 ⊢ (𝑀 ∈ 𝑇 → ∀𝑠∀𝑛 ∈ (ℤ≥‘𝑀)(𝑛 ≤ (#‘𝑠) → 𝜑)) |
31 | ralcom4 3197 | . . . 4 ⊢ (∀𝑛 ∈ (ℤ≥‘𝑀)∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑) ↔ ∀𝑠∀𝑛 ∈ (ℤ≥‘𝑀)(𝑛 ≤ (#‘𝑠) → 𝜑)) | |
32 | 30, 31 | sylibr 223 | . . 3 ⊢ (𝑀 ∈ 𝑇 → ∀𝑛 ∈ (ℤ≥‘𝑀)∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑)) |
33 | ssrab 3643 | . . 3 ⊢ ((ℤ≥‘𝑀) ⊆ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑)} ↔ ((ℤ≥‘𝑀) ⊆ ℕ0 ∧ ∀𝑛 ∈ (ℤ≥‘𝑀)∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑))) | |
34 | 10, 32, 33 | sylanbrc 695 | . 2 ⊢ (𝑀 ∈ 𝑇 → (ℤ≥‘𝑀) ⊆ {𝑛 ∈ ℕ0 ∣ ∀𝑠(𝑛 ≤ (#‘𝑠) → 𝜑)}) |
35 | 34, 4 | syl6sseqr 3615 | 1 ⊢ (𝑀 ∈ 𝑇 → (ℤ≥‘𝑀) ⊆ 𝑇) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∀wal 1473 = wceq 1475 ∈ wcel 1977 ∀wral 2896 {crab 2900 Vcvv 3173 ⊆ wss 3540 class class class wbr 4583 ‘cfv 5804 ℝcr 9814 ℝ*cxr 9952 ≤ cle 9954 ℕ0cn0 11169 ℤ≥cuz 11563 #chash 12979 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-xnn0 11241 df-z 11255 df-uz 11564 df-hash 12980 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |