Theorem 0ram 17067

Description: The Ramsey number when 𝑀 = 0. (Contributed by Mario Carneiro, 22-Apr-2015.)

Assertion

Ref	Expression
0ram	⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) = sup(ran 𝐹, ℝ, < ))

Distinct variable groups:   𝑥,𝑦,𝑅   𝑥,𝐹,𝑦   𝑥,𝑉

Allowed substitution hint:   𝑉(𝑦)

Proof of Theorem 0ram

Dummy variables 𝑏 𝑑 𝑧 𝑓 𝑐 𝑠 𝑎 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2740	. . 3 ⊢ (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖}) = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})
2		0nn0 12568	. . . 4 ⊢ 0 ∈ ℕ0
3	2	a1i 11	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 0 ∈ ℕ0)
4		simpl1 1191	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 𝑅 ∈ 𝑉)
5		simpl3 1193	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 𝐹:𝑅⟶ℕ0)
6	5	frnd 6755	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ran 𝐹 ⊆ ℕ0)
7		nn0ssz 12662	. . . . . 6 ⊢ ℕ0 ⊆ ℤ
8	6, 7	sstrdi 4021	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ran 𝐹 ⊆ ℤ)
9	5	fdmd 6757	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → dom 𝐹 = 𝑅)
10		simpl2 1192	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 𝑅 ≠ ∅)
11	9, 10	eqnetrd 3014	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → dom 𝐹 ≠ ∅)
12		dm0rn0 5949	. . . . . . 7 ⊢ (dom 𝐹 = ∅ ↔ ran 𝐹 = ∅)
13	12	necon3bii 2999	. . . . . 6 ⊢ (dom 𝐹 ≠ ∅ ↔ ran 𝐹 ≠ ∅)
14	11, 13	sylib 218	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ran 𝐹 ≠ ∅)
15		simpr 484	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥)
16		suprzcl2 13003	. . . . 5 ⊢ ((ran 𝐹 ⊆ ℤ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹)
17	8, 14, 15, 16	syl3anc 1371	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹)
18	6, 17	sseldd 4009	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ℕ0)
19	1	hashbc0 17052	. . . . . . 7 ⊢ (𝑠 ∈ V → (𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅})
20	19	elv 3493	. . . . . 6 ⊢ (𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅}
21	20	feq2i 6739	. . . . 5 ⊢ (𝑓:(𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅 ↔ 𝑓:{∅}⟶𝑅)
22	21	biimpi 216	. . . 4 ⊢ (𝑓:(𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅 → 𝑓:{∅}⟶𝑅)
23		simprr 772	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝑓:{∅}⟶𝑅)
24		0ex 5325	. . . . . . 7 ⊢ ∅ ∈ V
25	24	snid 4684	. . . . . 6 ⊢ ∅ ∈ {∅}
26		ffvelcdm 7115	. . . . . 6 ⊢ ((𝑓:{∅}⟶𝑅 ∧ ∅ ∈ {∅}) → (𝑓‘∅) ∈ 𝑅)
27	23, 25, 26	sylancl 585	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝑓‘∅) ∈ 𝑅)
28		vex 3492	. . . . . . 7 ⊢ 𝑠 ∈ V
29	28	pwid 4644	. . . . . 6 ⊢ 𝑠 ∈ 𝒫 𝑠
30	29	a1i 11	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝑠 ∈ 𝒫 𝑠)
31	5	adantr 480	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝐹:𝑅⟶ℕ0)
32	31, 27	ffvelcdmd 7119	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ℕ0)
33	32	nn0red 12614	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ℝ)
34	33	rexrd 11340	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ℝ*)
35	18	nn0red 12614	. . . . . . . 8 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
36	35	rexrd 11340	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ℝ*)
37	36	adantr 480	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → sup(ran 𝐹, ℝ, < ) ∈ ℝ*)
38		hashxrcl 14406	. . . . . . 7 ⊢ (𝑠 ∈ V → (♯‘𝑠) ∈ ℝ*)
39	28, 38	mp1i 13	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (♯‘𝑠) ∈ ℝ*)
40	8	adantr 480	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ran 𝐹 ⊆ ℤ)
41	15	adantr 480	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥)
42	31	ffnd 6748	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝐹 Fn 𝑅)
43		fnfvelrn 7114	. . . . . . . 8 ⊢ ((𝐹 Fn 𝑅 ∧ (𝑓‘∅) ∈ 𝑅) → (𝐹‘(𝑓‘∅)) ∈ ran 𝐹)
44	42, 27, 43	syl2anc 583	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ran 𝐹)
45		suprzub 13004	. . . . . . 7 ⊢ ((ran 𝐹 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥 ∧ (𝐹‘(𝑓‘∅)) ∈ ran 𝐹) → (𝐹‘(𝑓‘∅)) ≤ sup(ran 𝐹, ℝ, < ))
46	40, 41, 44, 45	syl3anc 1371	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ≤ sup(ran 𝐹, ℝ, < ))
47		simprl 770	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠))
48	34, 37, 39, 46, 47	xrletrd 13224	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠))
49	25	a1i 11	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ∅ ∈ {∅})
50		fvex 6933	. . . . . . . 8 ⊢ (𝑓‘∅) ∈ V
51	50	snid 4684	. . . . . . 7 ⊢ (𝑓‘∅) ∈ {(𝑓‘∅)}
52	51	a1i 11	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝑓‘∅) ∈ {(𝑓‘∅)})
53		ffn 6747	. . . . . . 7 ⊢ (𝑓:{∅}⟶𝑅 → 𝑓 Fn {∅})
54		elpreima 7091	. . . . . . 7 ⊢ (𝑓 Fn {∅} → (∅ ∈ (◡𝑓 “ {(𝑓‘∅)}) ↔ (∅ ∈ {∅} ∧ (𝑓‘∅) ∈ {(𝑓‘∅)})))
55	23, 53, 54	3syl 18	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (∅ ∈ (◡𝑓 “ {(𝑓‘∅)}) ↔ (∅ ∈ {∅} ∧ (𝑓‘∅) ∈ {(𝑓‘∅)})))
56	49, 52, 55	mpbir2and 712	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))
57		fveq2 6920	. . . . . . . 8 ⊢ (𝑐 = (𝑓‘∅) → (𝐹‘𝑐) = (𝐹‘(𝑓‘∅)))
58	57	breq1d 5176	. . . . . . 7 ⊢ (𝑐 = (𝑓‘∅) → ((𝐹‘𝑐) ≤ (♯‘𝑧) ↔ (𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧)))
59	1	hashbc0 17052	. . . . . . . . . . 11 ⊢ (𝑧 ∈ V → (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅})
60	59	elv 3493	. . . . . . . . . 10 ⊢ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅}
61	60	sseq1i 4037	. . . . . . . . 9 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐}) ↔ {∅} ⊆ (◡𝑓 “ {𝑐}))
62	24	snss 4810	. . . . . . . . 9 ⊢ (∅ ∈ (◡𝑓 “ {𝑐}) ↔ {∅} ⊆ (◡𝑓 “ {𝑐}))
63	61, 62	bitr4i 278	. . . . . . . 8 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐}) ↔ ∅ ∈ (◡𝑓 “ {𝑐}))
64		sneq 4658	. . . . . . . . . 10 ⊢ (𝑐 = (𝑓‘∅) → {𝑐} = {(𝑓‘∅)})
65	64	imaeq2d 6089	. . . . . . . . 9 ⊢ (𝑐 = (𝑓‘∅) → (◡𝑓 “ {𝑐}) = (◡𝑓 “ {(𝑓‘∅)}))
66	65	eleq2d 2830	. . . . . . . 8 ⊢ (𝑐 = (𝑓‘∅) → (∅ ∈ (◡𝑓 “ {𝑐}) ↔ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)})))
67	63, 66	bitrid 283	. . . . . . 7 ⊢ (𝑐 = (𝑓‘∅) → ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐}) ↔ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)})))
68	58, 67	anbi12d 631	. . . . . 6 ⊢ (𝑐 = (𝑓‘∅) → (((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})) ↔ ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))))
69		fveq2 6920	. . . . . . . 8 ⊢ (𝑧 = 𝑠 → (♯‘𝑧) = (♯‘𝑠))
70	69	breq2d 5178	. . . . . . 7 ⊢ (𝑧 = 𝑠 → ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧) ↔ (𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠)))
71	70	anbi1d 630	. . . . . 6 ⊢ (𝑧 = 𝑠 → (((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)})) ↔ ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))))
72	68, 71	rspc2ev 3648	. . . . 5 ⊢ (((𝑓‘∅) ∈ 𝑅 ∧ 𝑠 ∈ 𝒫 𝑠 ∧ ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))) → ∃𝑐 ∈ 𝑅 ∃𝑧 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})))
73	27, 30, 48, 56, 72	syl112anc 1374	. . . 4 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ∃𝑐 ∈ 𝑅 ∃𝑧 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})))
74	22, 73	sylanr2 682	. . 3 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:(𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅)) → ∃𝑐 ∈ 𝑅 ∃𝑧 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})))
75	1, 3, 4, 5, 18, 74	ramub 17060	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) ≤ sup(ran 𝐹, ℝ, < ))
76		ffn 6747	. . . . 5 ⊢ (𝐹:𝑅⟶ℕ0 → 𝐹 Fn 𝑅)
77		fvelrnb 6982	. . . . 5 ⊢ (𝐹 Fn 𝑅 → (sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹 ↔ ∃𝑐 ∈ 𝑅 (𝐹‘𝑐) = sup(ran 𝐹, ℝ, < )))
78	5, 76, 77	3syl 18	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹 ↔ ∃𝑐 ∈ 𝑅 (𝐹‘𝑐) = sup(ran 𝐹, ℝ, < )))
79	17, 78	mpbid 232	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ∃𝑐 ∈ 𝑅 (𝐹‘𝑐) = sup(ran 𝐹, ℝ, < ))
80	2	a1i 11	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → 0 ∈ ℕ0)
81		simpll1 1212	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → 𝑅 ∈ 𝑉)
82		simpll3 1214	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → 𝐹:𝑅⟶ℕ0)
83		nnm1nn0 12594	. . . . . . . . . 10 ⊢ ((𝐹‘𝑐) ∈ ℕ → ((𝐹‘𝑐) − 1) ∈ ℕ0)
84	83	ad2antll 728	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → ((𝐹‘𝑐) − 1) ∈ ℕ0)
85		vex 3492	. . . . . . . . . . . . 13 ⊢ 𝑐 ∈ V
86	24, 85	f1osn 6902	. . . . . . . . . . . 12 ⊢ {⟨∅, 𝑐⟩}:{∅}–1-1-onto→{𝑐}
87		f1of 6862	. . . . . . . . . . . 12 ⊢ ({⟨∅, 𝑐⟩}:{∅}–1-1-onto→{𝑐} → {⟨∅, 𝑐⟩}:{∅}⟶{𝑐})
88	86, 87	ax-mp 5	. . . . . . . . . . 11 ⊢ {⟨∅, 𝑐⟩}:{∅}⟶{𝑐}
89		simprl 770	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → 𝑐 ∈ 𝑅)
90	89	snssd 4834	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → {𝑐} ⊆ 𝑅)
91		fss 6763	. . . . . . . . . . 11 ⊢ (({⟨∅, 𝑐⟩}:{∅}⟶{𝑐} ∧ {𝑐} ⊆ 𝑅) → {⟨∅, 𝑐⟩}:{∅}⟶𝑅)
92	88, 90, 91	sylancr 586	. . . . . . . . . 10 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → {⟨∅, 𝑐⟩}:{∅}⟶𝑅)
93		ovex 7481	. . . . . . . . . . . 12 ⊢ (1...((𝐹‘𝑐) − 1)) ∈ V
94	1	hashbc0 17052	. . . . . . . . . . . 12 ⊢ ((1...((𝐹‘𝑐) − 1)) ∈ V → ((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅})
95	93, 94	ax-mp 5	. . . . . . . . . . 11 ⊢ ((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅}
96	95	feq2i 6739	. . . . . . . . . 10 ⊢ ({⟨∅, 𝑐⟩}:((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅 ↔ {⟨∅, 𝑐⟩}:{∅}⟶𝑅)
97	92, 96	sylibr 234	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → {⟨∅, 𝑐⟩}:((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅)
98	60	sseq1i 4037	. . . . . . . . . . 11 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ {∅} ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}))
99	24	snss 4810	. . . . . . . . . . 11 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ {∅} ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}))
100	98, 99	bitr4i 278	. . . . . . . . . 10 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ ∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}))
101		fzfid 14024	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (1...((𝐹‘𝑐) − 1)) ∈ Fin)
102		simprr 772	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))
103		ssdomg 9060	. . . . . . . . . . . . . . 15 ⊢ ((1...((𝐹‘𝑐) − 1)) ∈ Fin → (𝑧 ⊆ (1...((𝐹‘𝑐) − 1)) → 𝑧 ≼ (1...((𝐹‘𝑐) − 1))))
104	101, 102, 103	sylc 65	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → 𝑧 ≼ (1...((𝐹‘𝑐) − 1)))
105	101, 102	ssfid 9329	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → 𝑧 ∈ Fin)
106		hashdom 14428	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ Fin ∧ (1...((𝐹‘𝑐) − 1)) ∈ Fin) → ((♯‘𝑧) ≤ (♯‘(1...((𝐹‘𝑐) − 1))) ↔ 𝑧 ≼ (1...((𝐹‘𝑐) − 1))))
107	105, 101, 106	syl2anc 583	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → ((♯‘𝑧) ≤ (♯‘(1...((𝐹‘𝑐) − 1))) ↔ 𝑧 ≼ (1...((𝐹‘𝑐) − 1))))
108	104, 107	mpbird 257	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘𝑧) ≤ (♯‘(1...((𝐹‘𝑐) − 1))))
109	84	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → ((𝐹‘𝑐) − 1) ∈ ℕ0)
110		hashfz1 14395	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑐) − 1) ∈ ℕ0 → (♯‘(1...((𝐹‘𝑐) − 1))) = ((𝐹‘𝑐) − 1))
111	109, 110	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘(1...((𝐹‘𝑐) − 1))) = ((𝐹‘𝑐) − 1))
112	108, 111	breqtrd 5192	. . . . . . . . . . . 12 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘𝑧) ≤ ((𝐹‘𝑐) − 1))
113		hashcl 14405	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ Fin → (♯‘𝑧) ∈ ℕ0)
114	105, 113	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘𝑧) ∈ ℕ0)
115	5	ffvelcdmda 7118	. . . . . . . . . . . . . . 15 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → (𝐹‘𝑐) ∈ ℕ0)
116	115	adantrr 716	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → (𝐹‘𝑐) ∈ ℕ0)
117	116	adantr 480	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (𝐹‘𝑐) ∈ ℕ0)
118		nn0ltlem1 12703	. . . . . . . . . . . . 13 ⊢ (((♯‘𝑧) ∈ ℕ0 ∧ (𝐹‘𝑐) ∈ ℕ0) → ((♯‘𝑧) < (𝐹‘𝑐) ↔ (♯‘𝑧) ≤ ((𝐹‘𝑐) − 1)))
119	114, 117, 118	syl2anc 583	. . . . . . . . . . . 12 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → ((♯‘𝑧) < (𝐹‘𝑐) ↔ (♯‘𝑧) ≤ ((𝐹‘𝑐) − 1)))
120	112, 119	mpbird 257	. . . . . . . . . . 11 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘𝑧) < (𝐹‘𝑐))
121	24, 85	fvsn 7215	. . . . . . . . . . . . . . 15 ⊢ ({⟨∅, 𝑐⟩}‘∅) = 𝑐
122		f1ofn 6863	. . . . . . . . . . . . . . . . 17 ⊢ ({⟨∅, 𝑐⟩}:{∅}–1-1-onto→{𝑐} → {⟨∅, 𝑐⟩} Fn {∅})
123		elpreima 7091	. . . . . . . . . . . . . . . . 17 ⊢ ({⟨∅, 𝑐⟩} Fn {∅} → (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ (∅ ∈ {∅} ∧ ({⟨∅, 𝑐⟩}‘∅) ∈ {𝑑})))
124	86, 122, 123	mp2b 10	. . . . . . . . . . . . . . . 16 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ (∅ ∈ {∅} ∧ ({⟨∅, 𝑐⟩}‘∅) ∈ {𝑑}))
125	124	simprbi 496	. . . . . . . . . . . . . . 15 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → ({⟨∅, 𝑐⟩}‘∅) ∈ {𝑑})
126	121, 125	eqeltrrid 2849	. . . . . . . . . . . . . 14 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → 𝑐 ∈ {𝑑})
127		elsni 4665	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ {𝑑} → 𝑐 = 𝑑)
128	126, 127	syl 17	. . . . . . . . . . . . 13 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → 𝑐 = 𝑑)
129	128	fveq2d 6924	. . . . . . . . . . . 12 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → (𝐹‘𝑐) = (𝐹‘𝑑))
130	129	breq2d 5178	. . . . . . . . . . 11 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → ((♯‘𝑧) < (𝐹‘𝑐) ↔ (♯‘𝑧) < (𝐹‘𝑑)))
131	120, 130	syl5ibcom 245	. . . . . . . . . 10 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → (♯‘𝑧) < (𝐹‘𝑑)))
132	100, 131	biimtrid 242	. . . . . . . . 9 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → (♯‘𝑧) < (𝐹‘𝑑)))
133	1, 80, 81, 82, 84, 97, 132	ramlb 17066	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → ((𝐹‘𝑐) − 1) < (0 Ramsey 𝐹))
134		ramubcl 17065	. . . . . . . . . . 11 ⊢ (((0 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ (sup(ran 𝐹, ℝ, < ) ∈ ℕ0 ∧ (0 Ramsey 𝐹) ≤ sup(ran 𝐹, ℝ, < ))) → (0 Ramsey 𝐹) ∈ ℕ0)
135	3, 4, 5, 18, 75, 134	syl32anc 1378	. . . . . . . . . 10 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) ∈ ℕ0)
136	135	adantr 480	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → (0 Ramsey 𝐹) ∈ ℕ0)
137		nn0lem1lt 12708	. . . . . . . . 9 ⊢ (((𝐹‘𝑐) ∈ ℕ0 ∧ (0 Ramsey 𝐹) ∈ ℕ0) → ((𝐹‘𝑐) ≤ (0 Ramsey 𝐹) ↔ ((𝐹‘𝑐) − 1) < (0 Ramsey 𝐹)))
138	116, 136, 137	syl2anc 583	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → ((𝐹‘𝑐) ≤ (0 Ramsey 𝐹) ↔ ((𝐹‘𝑐) − 1) < (0 Ramsey 𝐹)))
139	133, 138	mpbird 257	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → (𝐹‘𝑐) ≤ (0 Ramsey 𝐹))
140	139	expr 456	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → ((𝐹‘𝑐) ∈ ℕ → (𝐹‘𝑐) ≤ (0 Ramsey 𝐹)))
141	135	adantr 480	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → (0 Ramsey 𝐹) ∈ ℕ0)
142	141	nn0ge0d 12616	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → 0 ≤ (0 Ramsey 𝐹))
143		breq1 5169	. . . . . . 7 ⊢ ((𝐹‘𝑐) = 0 → ((𝐹‘𝑐) ≤ (0 Ramsey 𝐹) ↔ 0 ≤ (0 Ramsey 𝐹)))
144	142, 143	syl5ibrcom 247	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → ((𝐹‘𝑐) = 0 → (𝐹‘𝑐) ≤ (0 Ramsey 𝐹)))
145		elnn0 12555	. . . . . . 7 ⊢ ((𝐹‘𝑐) ∈ ℕ0 ↔ ((𝐹‘𝑐) ∈ ℕ ∨ (𝐹‘𝑐) = 0))
146	115, 145	sylib 218	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → ((𝐹‘𝑐) ∈ ℕ ∨ (𝐹‘𝑐) = 0))
147	140, 144, 146	mpjaod 859	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → (𝐹‘𝑐) ≤ (0 Ramsey 𝐹))
148		breq1 5169	. . . . 5 ⊢ ((𝐹‘𝑐) = sup(ran 𝐹, ℝ, < ) → ((𝐹‘𝑐) ≤ (0 Ramsey 𝐹) ↔ sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹)))
149	147, 148	syl5ibcom 245	. . . 4 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → ((𝐹‘𝑐) = sup(ran 𝐹, ℝ, < ) → sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹)))
150	149	rexlimdva 3161	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (∃𝑐 ∈ 𝑅 (𝐹‘𝑐) = sup(ran 𝐹, ℝ, < ) → sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹)))
151	79, 150	mpd 15	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹))
152	135	nn0red 12614	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) ∈ ℝ)
153	152, 35	letri3d 11432	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ((0 Ramsey 𝐹) = sup(ran 𝐹, ℝ, < ) ↔ ((0 Ramsey 𝐹) ≤ sup(ran 𝐹, ℝ, < ) ∧ sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹))))
154	75, 151, 153	mpbir2and 712	1 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) = sup(ran 𝐹, ℝ, < ))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 846   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  ∃wrex 3076  {crab 3443  Vcvv 3488   ⊆ wss 3976  ∅c0 4352  𝒫 cpw 4622  {csn 4648  ⟨cop 4654   class class class wbr 5166  ^◡ccnv 5699  dom cdm 5700  ran crn 5701   “ cima 5703   Fn wfn 6568  ⟶wf 6569  –1-1-onto→wf1o 6572  ‘cfv 6573  (class class class)co 7448   ∈ cmpo 7450   ≼ cdom 9001  Fincfn 9003  supcsup 9509  ℝcr 11183  0cc0 11184  1c1 11185  ℝ^*cxr 11323   < clt 11324   ≤ cle 11325   − cmin 11520  ℕcn 12293  ℕ₀cn0 12553  ℤcz 12639  ...cfz 13567  ♯chash 14379   Ramsey cram 17046

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-1st 8030  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-1o 8522  df-oadd 8526  df-er 8763  df-map 8886  df-en 9004  df-dom 9005  df-sdom 9006  df-fin 9007  df-sup 9511  df-inf 9512  df-card 10008  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-n0 12554  df-xnn0 12626  df-z 12640  df-uz 12904  df-fz 13568  df-hash 14380  df-ram 17048

This theorem is referenced by:  0ram2  17068  ramz  17072