Metamath Proof Explorer


Theorem ramubcl

Description: If the Ramsey number is upper bounded, then it is an integer. (Contributed by Mario Carneiro, 20-Apr-2015)

Ref Expression
Assertion ramubcl ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → M Ramsey F ∈ ℕ 0

Proof

Step Hyp Ref Expression
1 nn0re ⊢ A ∈ ℕ 0 → A ∈ ℝ
2 ltpnf ⊢ A ∈ ℝ → A < +∞
3 rexr ⊢ A ∈ ℝ → A ∈ ℝ *
4 pnfxr ⊢ +∞ ∈ ℝ *
5 xrltnle ⊢ A ∈ ℝ * ∧ +∞ ∈ ℝ * → A < +∞ ↔ ¬ +∞ ≤ A
6 3 4 5 sylancl ⊢ A ∈ ℝ → A < +∞ ↔ ¬ +∞ ≤ A
7 2 6 mpbid ⊢ A ∈ ℝ → ¬ +∞ ≤ A
8 1 7 syl ⊢ A ∈ ℕ 0 → ¬ +∞ ≤ A
9 8 ad2antrl ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → ¬ +∞ ≤ A
10 simprr ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → M Ramsey F ≤ A
11 breq1 ⊢ M Ramsey F = +∞ → M Ramsey F ≤ A ↔ +∞ ≤ A
12 10 11 syl5ibcom ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → M Ramsey F = +∞ → +∞ ≤ A
13 9 12 mtod ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → ¬ M Ramsey F = +∞
14 elsni ⊢ M Ramsey F ∈ +∞ → M Ramsey F = +∞
15 13 14 nsyl ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → ¬ M Ramsey F ∈ +∞
16 ramcl2 ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 → M Ramsey F ∈ ℕ 0 ∪ +∞
17 16 adantr ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → M Ramsey F ∈ ℕ 0 ∪ +∞
18 elun ⊢ M Ramsey F ∈ ℕ 0 ∪ +∞ ↔ M Ramsey F ∈ ℕ 0 ∨ M Ramsey F ∈ +∞
19 17 18 sylib ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → M Ramsey F ∈ ℕ 0 ∨ M Ramsey F ∈ +∞
20 19 ord ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → ¬ M Ramsey F ∈ ℕ 0 → M Ramsey F ∈ +∞
21 15 20 mt3d ⊢ M ∈ ℕ 0 ∧ R ∈ V ∧ F : R ⟶ ℕ 0 ∧ A ∈ ℕ 0 ∧ M Ramsey F ≤ A → M Ramsey F ∈ ℕ 0