Theorem 0ram 16960

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 2737	. . 3 ⊢ (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖}) = (𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})
2		0nn0 12428	. . . 4 ⊢ 0 ∈ ℕ0
3	2	a1i 11	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 0 ∈ ℕ0)
4		simpl1 1193	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 𝑅 ∈ 𝑉)
5		simpl3 1195	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 𝐹:𝑅⟶ℕ0)
6	5	frnd 6678	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ran 𝐹 ⊆ ℕ0)
7		nn0ssz 12523	. . . . . 6 ⊢ ℕ0 ⊆ ℤ
8	6, 7	sstrdi 3948	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ran 𝐹 ⊆ ℤ)
9	5	fdmd 6680	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → dom 𝐹 = 𝑅)
10		simpl2 1194	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → 𝑅 ≠ ∅)
11	9, 10	eqnetrd 3000	. . . . . 6 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → dom 𝐹 ≠ ∅)
12		dm0rn0 5881	. . . . . . 7 ⊢ (dom 𝐹 = ∅ ↔ ran 𝐹 = ∅)
13	12	necon3bii 2985	. . . . . 6 ⊢ (dom 𝐹 ≠ ∅ ↔ ran 𝐹 ≠ ∅)
14	11, 13	sylib 218	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ran 𝐹 ≠ ∅)
15		simpr 484	. . . . 5 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥)
16		suprzcl2 12863	. . . . 5 ⊢ ((ran 𝐹 ⊆ ℤ ∧ ran 𝐹 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹)
17	8, 14, 15, 16	syl3anc 1374	. . . 4 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ran 𝐹)
18	6, 17	sseldd 3936	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ℕ0)
19	1	hashbc0 16945	. . . . . . 7 ⊢ (𝑠 ∈ V → (𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅})
20	19	elv 3447	. . . . . 6 ⊢ (𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅}
21	20	feq2i 6662	. . . . 5 ⊢ (𝑓:(𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅 ↔ 𝑓:{∅}⟶𝑅)
22	21	biimpi 216	. . . 4 ⊢ (𝑓:(𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅 → 𝑓:{∅}⟶𝑅)
23		simprr 773	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝑓:{∅}⟶𝑅)
24		0ex 5254	. . . . . . 7 ⊢ ∅ ∈ V
25	24	snid 4621	. . . . . 6 ⊢ ∅ ∈ {∅}
26		ffvelcdm 7035	. . . . . 6 ⊢ ((𝑓:{∅}⟶𝑅 ∧ ∅ ∈ {∅}) → (𝑓‘∅) ∈ 𝑅)
27	23, 25, 26	sylancl 587	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝑓‘∅) ∈ 𝑅)
28		vex 3446	. . . . . . 7 ⊢ 𝑠 ∈ V
29	28	pwid 4578	. . . . . 6 ⊢ 𝑠 ∈ 𝒫 𝑠
30	29	a1i 11	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝑠 ∈ 𝒫 𝑠)
31	5	adantr 480	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝐹:𝑅⟶ℕ0)
32	31, 27	ffvelcdmd 7039	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ℕ0)
33	32	nn0red 12475	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ℝ)
34	33	rexrd 11194	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ℝ*)
35	18	nn0red 12475	. . . . . . . 8 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ℝ)
36	35	rexrd 11194	. . . . . . 7 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ∈ ℝ*)
37	36	adantr 480	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → sup(ran 𝐹, ℝ, < ) ∈ ℝ*)
38		hashxrcl 14292	. . . . . . 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 6671	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → 𝐹 Fn 𝑅)
43		fnfvelrn 7034	. . . . . . . 8 ⊢ ((𝐹 Fn 𝑅 ∧ (𝑓‘∅) ∈ 𝑅) → (𝐹‘(𝑓‘∅)) ∈ ran 𝐹)
44	42, 27, 43	syl2anc 585	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ∈ ran 𝐹)
45		suprzub 12864	. . . . . . 7 ⊢ ((ran 𝐹 ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥 ∧ (𝐹‘(𝑓‘∅)) ∈ ran 𝐹) → (𝐹‘(𝑓‘∅)) ≤ sup(ran 𝐹, ℝ, < ))
46	40, 41, 44, 45	syl3anc 1374	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ≤ sup(ran 𝐹, ℝ, < ))
47		simprl 771	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠))
48	34, 37, 39, 46, 47	xrletrd 13088	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠))
49	25	a1i 11	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ∅ ∈ {∅})
50		fvex 6855	. . . . . . . 8 ⊢ (𝑓‘∅) ∈ V
51	50	snid 4621	. . . . . . 7 ⊢ (𝑓‘∅) ∈ {(𝑓‘∅)}
52	51	a1i 11	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (𝑓‘∅) ∈ {(𝑓‘∅)})
53		ffn 6670	. . . . . . 7 ⊢ (𝑓:{∅}⟶𝑅 → 𝑓 Fn {∅})
54		elpreima 7012	. . . . . . 7 ⊢ (𝑓 Fn {∅} → (∅ ∈ (◡𝑓 “ {(𝑓‘∅)}) ↔ (∅ ∈ {∅} ∧ (𝑓‘∅) ∈ {(𝑓‘∅)})))
55	23, 53, 54	3syl 18	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → (∅ ∈ (◡𝑓 “ {(𝑓‘∅)}) ↔ (∅ ∈ {∅} ∧ (𝑓‘∅) ∈ {(𝑓‘∅)})))
56	49, 52, 55	mpbir2and 714	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))
57		fveq2 6842	. . . . . . . 8 ⊢ (𝑐 = (𝑓‘∅) → (𝐹‘𝑐) = (𝐹‘(𝑓‘∅)))
58	57	breq1d 5110	. . . . . . 7 ⊢ (𝑐 = (𝑓‘∅) → ((𝐹‘𝑐) ≤ (♯‘𝑧) ↔ (𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧)))
59	1	hashbc0 16945	. . . . . . . . . . 11 ⊢ (𝑧 ∈ V → (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅})
60	59	elv 3447	. . . . . . . . . 10 ⊢ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅}
61	60	sseq1i 3964	. . . . . . . . 9 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐}) ↔ {∅} ⊆ (◡𝑓 “ {𝑐}))
62	24	snss 4743	. . . . . . . . 9 ⊢ (∅ ∈ (◡𝑓 “ {𝑐}) ↔ {∅} ⊆ (◡𝑓 “ {𝑐}))
63	61, 62	bitr4i 278	. . . . . . . 8 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐}) ↔ ∅ ∈ (◡𝑓 “ {𝑐}))
64		sneq 4592	. . . . . . . . . 10 ⊢ (𝑐 = (𝑓‘∅) → {𝑐} = {(𝑓‘∅)})
65	64	imaeq2d 6027	. . . . . . . . 9 ⊢ (𝑐 = (𝑓‘∅) → (◡𝑓 “ {𝑐}) = (◡𝑓 “ {(𝑓‘∅)}))
66	65	eleq2d 2823	. . . . . . . 8 ⊢ (𝑐 = (𝑓‘∅) → (∅ ∈ (◡𝑓 “ {𝑐}) ↔ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)})))
67	63, 66	bitrid 283	. . . . . . 7 ⊢ (𝑐 = (𝑓‘∅) → ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐}) ↔ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)})))
68	58, 67	anbi12d 633	. . . . . 6 ⊢ (𝑐 = (𝑓‘∅) → (((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})) ↔ ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))))
69		fveq2 6842	. . . . . . . 8 ⊢ (𝑧 = 𝑠 → (♯‘𝑧) = (♯‘𝑠))
70	69	breq2d 5112	. . . . . . 7 ⊢ (𝑧 = 𝑠 → ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧) ↔ (𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠)))
71	70	anbi1d 632	. . . . . 6 ⊢ (𝑧 = 𝑠 → (((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑧) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)})) ↔ ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))))
72	68, 71	rspc2ev 3591	. . . . 5 ⊢ (((𝑓‘∅) ∈ 𝑅 ∧ 𝑠 ∈ 𝒫 𝑠 ∧ ((𝐹‘(𝑓‘∅)) ≤ (♯‘𝑠) ∧ ∅ ∈ (◡𝑓 “ {(𝑓‘∅)}))) → ∃𝑐 ∈ 𝑅 ∃𝑧 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})))
73	27, 30, 48, 56, 72	syl112anc 1377	. . . 4 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:{∅}⟶𝑅)) → ∃𝑐 ∈ 𝑅 ∃𝑧 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})))
74	22, 73	sylanr2 684	. . 3 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (sup(ran 𝐹, ℝ, < ) ≤ (♯‘𝑠) ∧ 𝑓:(𝑠(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅)) → ∃𝑐 ∈ 𝑅 ∃𝑧 ∈ 𝒫 𝑠((𝐹‘𝑐) ≤ (♯‘𝑧) ∧ (𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡𝑓 “ {𝑐})))
75	1, 3, 4, 5, 18, 74	ramub 16953	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) ≤ sup(ran 𝐹, ℝ, < ))
76		ffn 6670	. . . . 5 ⊢ (𝐹:𝑅⟶ℕ0 → 𝐹 Fn 𝑅)
77		fvelrnb 6902	. . . . 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 1214	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → 𝑅 ∈ 𝑉)
82		simpll3 1216	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → 𝐹:𝑅⟶ℕ0)
83		nnm1nn0 12454	. . . . . . . . . 10 ⊢ ((𝐹‘𝑐) ∈ ℕ → ((𝐹‘𝑐) − 1) ∈ ℕ0)
84	83	ad2antll 730	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → ((𝐹‘𝑐) − 1) ∈ ℕ0)
85		vex 3446	. . . . . . . . . . . . 13 ⊢ 𝑐 ∈ V
86	24, 85	f1osn 6823	. . . . . . . . . . . 12 ⊢ {⟨∅, 𝑐⟩}:{∅}–1-1-onto→{𝑐}
87		f1of 6782	. . . . . . . . . . . 12 ⊢ ({⟨∅, 𝑐⟩}:{∅}–1-1-onto→{𝑐} → {⟨∅, 𝑐⟩}:{∅}⟶{𝑐})
88	86, 87	ax-mp 5	. . . . . . . . . . 11 ⊢ {⟨∅, 𝑐⟩}:{∅}⟶{𝑐}
89		simprl 771	. . . . . . . . . . . 12 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → 𝑐 ∈ 𝑅)
90	89	snssd 4767	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → {𝑐} ⊆ 𝑅)
91		fss 6686	. . . . . . . . . . 11 ⊢ (({⟨∅, 𝑐⟩}:{∅}⟶{𝑐} ∧ {𝑐} ⊆ 𝑅) → {⟨∅, 𝑐⟩}:{∅}⟶𝑅)
92	88, 90, 91	sylancr 588	. . . . . . . . . 10 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → {⟨∅, 𝑐⟩}:{∅}⟶𝑅)
93		ovex 7401	. . . . . . . . . . . 12 ⊢ (1...((𝐹‘𝑐) − 1)) ∈ V
94	1	hashbc0 16945	. . . . . . . . . . . 12 ⊢ ((1...((𝐹‘𝑐) − 1)) ∈ V → ((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅})
95	93, 94	ax-mp 5	. . . . . . . . . . 11 ⊢ ((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) = {∅}
96	95	feq2i 6662	. . . . . . . . . 10 ⊢ ({⟨∅, 𝑐⟩}:((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅 ↔ {⟨∅, 𝑐⟩}:{∅}⟶𝑅)
97	92, 96	sylibr 234	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → {⟨∅, 𝑐⟩}:((1...((𝐹‘𝑐) − 1))(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0)⟶𝑅)
98	60	sseq1i 3964	. . . . . . . . . . 11 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ {∅} ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}))
99	24	snss 4743	. . . . . . . . . . 11 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ {∅} ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}))
100	98, 99	bitr4i 278	. . . . . . . . . 10 ⊢ ((𝑧(𝑎 ∈ V, 𝑖 ∈ ℕ0 ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})0) ⊆ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ ∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}))
101		fzfid 13908	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (1...((𝐹‘𝑐) − 1)) ∈ Fin)
102		simprr 773	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))
103		ssdomg 8949	. . . . . . . . . . . . . . 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 9181	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → 𝑧 ∈ Fin)
106		hashdom 14314	. . . . . . . . . . . . . . 15 ⊢ ((𝑧 ∈ Fin ∧ (1...((𝐹‘𝑐) − 1)) ∈ Fin) → ((♯‘𝑧) ≤ (♯‘(1...((𝐹‘𝑐) − 1))) ↔ 𝑧 ≼ (1...((𝐹‘𝑐) − 1))))
107	105, 101, 106	syl2anc 585	. . . . . . . . . . . . . 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 14281	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑐) − 1) ∈ ℕ0 → (♯‘(1...((𝐹‘𝑐) − 1))) = ((𝐹‘𝑐) − 1))
111	109, 110	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘(1...((𝐹‘𝑐) − 1))) = ((𝐹‘𝑐) − 1))
112	108, 111	breqtrd 5126	. . . . . . . . . . . 12 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘𝑧) ≤ ((𝐹‘𝑐) − 1))
113		hashcl 14291	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ Fin → (♯‘𝑧) ∈ ℕ0)
114	105, 113	syl 17	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘𝑧) ∈ ℕ0)
115	5	ffvelcdmda 7038	. . . . . . . . . . . . . . 15 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → (𝐹‘𝑐) ∈ ℕ0)
116	115	adantrr 718	. . . . . . . . . . . . . 14 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → (𝐹‘𝑐) ∈ ℕ0)
117	116	adantr 480	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (𝐹‘𝑐) ∈ ℕ0)
118		nn0ltlem1 12564	. . . . . . . . . . . . 13 ⊢ (((♯‘𝑧) ∈ ℕ0 ∧ (𝐹‘𝑐) ∈ ℕ0) → ((♯‘𝑧) < (𝐹‘𝑐) ↔ (♯‘𝑧) ≤ ((𝐹‘𝑐) − 1)))
119	114, 117, 118	syl2anc 585	. . . . . . . . . . . 12 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → ((♯‘𝑧) < (𝐹‘𝑐) ↔ (♯‘𝑧) ≤ ((𝐹‘𝑐) − 1)))
120	112, 119	mpbird 257	. . . . . . . . . . 11 ⊢ (((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) ∧ (𝑑 ∈ 𝑅 ∧ 𝑧 ⊆ (1...((𝐹‘𝑐) − 1)))) → (♯‘𝑧) < (𝐹‘𝑐))
121	24, 85	fvsn 7137	. . . . . . . . . . . . . . 15 ⊢ ({⟨∅, 𝑐⟩}‘∅) = 𝑐
122		f1ofn 6783	. . . . . . . . . . . . . . . . 17 ⊢ ({⟨∅, 𝑐⟩}:{∅}–1-1-onto→{𝑐} → {⟨∅, 𝑐⟩} Fn {∅})
123		elpreima 7012	. . . . . . . . . . . . . . . . 17 ⊢ ({⟨∅, 𝑐⟩} Fn {∅} → (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ (∅ ∈ {∅} ∧ ({⟨∅, 𝑐⟩}‘∅) ∈ {𝑑})))
124	86, 122, 123	mp2b 10	. . . . . . . . . . . . . . . 16 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) ↔ (∅ ∈ {∅} ∧ ({⟨∅, 𝑐⟩}‘∅) ∈ {𝑑}))
125	124	simprbi 497	. . . . . . . . . . . . . . 15 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → ({⟨∅, 𝑐⟩}‘∅) ∈ {𝑑})
126	121, 125	eqeltrrid 2842	. . . . . . . . . . . . . 14 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → 𝑐 ∈ {𝑑})
127		elsni 4599	. . . . . . . . . . . . . 14 ⊢ (𝑐 ∈ {𝑑} → 𝑐 = 𝑑)
128	126, 127	syl 17	. . . . . . . . . . . . 13 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → 𝑐 = 𝑑)
129	128	fveq2d 6846	. . . . . . . . . . . 12 ⊢ (∅ ∈ (◡{⟨∅, 𝑐⟩} “ {𝑑}) → (𝐹‘𝑐) = (𝐹‘𝑑))
130	129	breq2d 5112	. . . . . . . . . . 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 16959	. . . . . . . 8 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → ((𝐹‘𝑐) − 1) < (0 Ramsey 𝐹))
134		ramubcl 16958	. . . . . . . . . . 11 ⊢ (((0 ∈ ℕ0 ∧ 𝑅 ∈ 𝑉 ∧ 𝐹:𝑅⟶ℕ0) ∧ (sup(ran 𝐹, ℝ, < ) ∈ ℕ0 ∧ (0 Ramsey 𝐹) ≤ sup(ran 𝐹, ℝ, < ))) → (0 Ramsey 𝐹) ∈ ℕ0)
135	3, 4, 5, 18, 75, 134	syl32anc 1381	. . . . . . . . . 10 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) ∈ ℕ0)
136	135	adantr 480	. . . . . . . . 9 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ (𝑐 ∈ 𝑅 ∧ (𝐹‘𝑐) ∈ ℕ)) → (0 Ramsey 𝐹) ∈ ℕ0)
137		nn0lem1lt 12569	. . . . . . . . 9 ⊢ (((𝐹‘𝑐) ∈ ℕ0 ∧ (0 Ramsey 𝐹) ∈ ℕ0) → ((𝐹‘𝑐) ≤ (0 Ramsey 𝐹) ↔ ((𝐹‘𝑐) − 1) < (0 Ramsey 𝐹)))
138	116, 136, 137	syl2anc 585	. . . . . . . 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 12477	. . . . . . 7 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → 0 ≤ (0 Ramsey 𝐹))
143		breq1 5103	. . . . . . 7 ⊢ ((𝐹‘𝑐) = 0 → ((𝐹‘𝑐) ≤ (0 Ramsey 𝐹) ↔ 0 ≤ (0 Ramsey 𝐹)))
144	142, 143	syl5ibrcom 247	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → ((𝐹‘𝑐) = 0 → (𝐹‘𝑐) ≤ (0 Ramsey 𝐹)))
145		elnn0 12415	. . . . . . 7 ⊢ ((𝐹‘𝑐) ∈ ℕ0 ↔ ((𝐹‘𝑐) ∈ ℕ ∨ (𝐹‘𝑐) = 0))
146	115, 145	sylib 218	. . . . . 6 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → ((𝐹‘𝑐) ∈ ℕ ∨ (𝐹‘𝑐) = 0))
147	140, 144, 146	mpjaod 861	. . . . 5 ⊢ ((((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) ∧ 𝑐 ∈ 𝑅) → (𝐹‘𝑐) ≤ (0 Ramsey 𝐹))
148		breq1 5103	. . . . 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 3139	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (∃𝑐 ∈ 𝑅 (𝐹‘𝑐) = sup(ran 𝐹, ℝ, < ) → sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹)))
151	79, 150	mpd 15	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹))
152	135	nn0red 12475	. . 3 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) ∈ ℝ)
153	152, 35	letri3d 11287	. 2 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → ((0 Ramsey 𝐹) = sup(ran 𝐹, ℝ, < ) ↔ ((0 Ramsey 𝐹) ≤ sup(ran 𝐹, ℝ, < ) ∧ sup(ran 𝐹, ℝ, < ) ≤ (0 Ramsey 𝐹))))
154	75, 151, 153	mpbir2and 714	1 ⊢ (((𝑅 ∈ 𝑉 ∧ 𝑅 ≠ ∅ ∧ 𝐹:𝑅⟶ℕ0) ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ ran 𝐹 𝑦 ≤ 𝑥) → (0 Ramsey 𝐹) = sup(ran 𝐹, ℝ, < ))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3401  Vcvv 3442   ⊆ wss 3903  ∅c0 4287  𝒫 cpw 4556  {csn 4582  ⟨cop 4588   class class class wbr 5100  ^◡ccnv 5631  dom cdm 5632  ran crn 5633   “ cima 5635   Fn wfn 6495  ⟶wf 6496  –1-1-onto→wf1o 6499  ‘cfv 6500  (class class class)co 7368   ∈ cmpo 7370   ≼ cdom 8893  Fincfn 8895  supcsup 9355  ℝcr 11037  0cc0 11038  1c1 11039  ℝ^*cxr 11177   < clt 11178   ≤ cle 11179   − cmin 11376  ℕcn 12157  ℕ₀cn0 12413  ℤcz 12500  ...cfz 13435  ♯chash 14265   Ramsey cram 16939

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-oadd 8411  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-sup 9357  df-inf 9358  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-n0 12414  df-xnn0 12487  df-z 12501  df-uz 12764  df-fz 13436  df-hash 14266  df-ram 16941

This theorem is referenced by:  0ram2  16961  ramz  16965